/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/strlcat.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 04:35:18,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 04:35:18,836 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 04:35:18,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 04:35:18,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 04:35:18,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 04:35:18,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 04:35:18,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 04:35:18,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 04:35:18,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 04:35:18,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 04:35:18,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 04:35:18,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 04:35:18,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 04:35:18,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 04:35:18,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 04:35:18,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 04:35:18,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 04:35:18,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 04:35:18,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 04:35:18,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 04:35:18,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 04:35:18,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 04:35:18,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 04:35:18,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 04:35:18,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 04:35:18,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 04:35:18,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 04:35:18,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 04:35:18,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 04:35:18,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 04:35:18,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 04:35:18,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 04:35:18,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 04:35:18,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 04:35:18,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 04:35:18,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 04:35:18,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 04:35:18,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 04:35:18,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 04:35:18,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 04:35:18,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-16 04:35:18,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 04:35:18,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 04:35:18,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 04:35:18,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 04:35:18,968 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 04:35:18,968 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 04:35:18,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 04:35:18,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 04:35:18,970 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 04:35:18,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 04:35:18,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 04:35:18,970 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 04:35:18,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 04:35:18,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 04:35:18,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 04:35:18,971 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 04:35:18,971 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 04:35:18,972 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 04:35:18,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 04:35:18,973 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 04:35:18,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 04:35:18,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 04:35:18,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 04:35:18,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 04:35:18,974 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 04:35:18,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:35:18,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 04:35:18,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 04:35:18,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 04:35:18,976 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 04:35:18,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 04:35:19,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 04:35:19,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 04:35:19,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 04:35:19,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 04:35:19,447 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 04:35:19,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strlcat.i [2022-10-16 04:35:19,509 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29979634/83784d5bc5474dc1845f3e34de6d120a/FLAG15d37e64b [2022-10-16 04:35:20,174 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 04:35:20,175 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strlcat.i [2022-10-16 04:35:20,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29979634/83784d5bc5474dc1845f3e34de6d120a/FLAG15d37e64b [2022-10-16 04:35:20,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b29979634/83784d5bc5474dc1845f3e34de6d120a [2022-10-16 04:35:20,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 04:35:20,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 04:35:20,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 04:35:20,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 04:35:20,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 04:35:20,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:20,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284f3fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20, skipping insertion in model container [2022-10-16 04:35:20,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:20,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 04:35:20,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 04:35:20,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:35:20,838 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 04:35:20,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 04:35:20,927 INFO L208 MainTranslator]: Completed translation [2022-10-16 04:35:20,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20 WrapperNode [2022-10-16 04:35:20,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 04:35:20,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 04:35:20,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 04:35:20,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 04:35:20,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:20,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:20,983 INFO L138 Inliner]: procedures = 114, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-10-16 04:35:20,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 04:35:20,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 04:35:20,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 04:35:20,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 04:35:20,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:20,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,014 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 04:35:21,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 04:35:21,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 04:35:21,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 04:35:21,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (1/1) ... [2022-10-16 04:35:21,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 04:35:21,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:21,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 04:35:21,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 04:35:21,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 04:35:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 04:35:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 04:35:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 04:35:21,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 04:35:21,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 04:35:21,231 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 04:35:21,234 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 04:35:21,718 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 04:35:21,727 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 04:35:21,727 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 04:35:21,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:35:21 BoogieIcfgContainer [2022-10-16 04:35:21,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 04:35:21,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 04:35:21,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 04:35:21,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 04:35:21,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:35:20" (1/3) ... [2022-10-16 04:35:21,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec262e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:35:21, skipping insertion in model container [2022-10-16 04:35:21,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:35:20" (2/3) ... [2022-10-16 04:35:21,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec262e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:35:21, skipping insertion in model container [2022-10-16 04:35:21,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:35:21" (3/3) ... [2022-10-16 04:35:21,741 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcat.i [2022-10-16 04:35:21,768 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 04:35:21,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2022-10-16 04:35:21,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 04:35:21,835 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;@3b6657a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 04:35:21,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2022-10-16 04:35:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.90625) internal successors, (61), 49 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-16 04:35:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:35:21,849 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:21,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:35:21,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-10-16 04:35:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:21,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863911764] [2022-10-16 04:35:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:22,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:22,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:22,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863911764] [2022-10-16 04:35:22,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863911764] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:22,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:22,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:35:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412653434] [2022-10-16 04:35:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:22,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,113 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.90625) internal successors, (61), 49 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:22,178 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2022-10-16 04:35:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:22,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 04:35:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:22,192 INFO L225 Difference]: With dead ends: 51 [2022-10-16 04:35:22,193 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 04:35:22,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,200 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:22,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:22,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 04:35:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-16 04:35:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-10-16 04:35:22,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 4 [2022-10-16 04:35:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:22,245 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-10-16 04:35:22,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-10-16 04:35:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:35:22,246 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:22,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:35:22,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 04:35:22,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:22,248 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-10-16 04:35:22,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:22,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554877385] [2022-10-16 04:35:22,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:22,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:22,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:22,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554877385] [2022-10-16 04:35:22,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554877385] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:22,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:22,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:35:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969922934] [2022-10-16 04:35:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:22,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:22,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,355 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:22,446 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-10-16 04:35:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:22,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 04:35:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:22,448 INFO L225 Difference]: With dead ends: 47 [2022-10-16 04:35:22,450 INFO L226 Difference]: Without dead ends: 47 [2022-10-16 04:35:22,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,453 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:22,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:35:22,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-16 04:35:22,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-16 04:35:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-10-16 04:35:22,467 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 4 [2022-10-16 04:35:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:22,467 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-10-16 04:35:22,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-10-16 04:35:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-16 04:35:22,469 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:22,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-16 04:35:22,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 04:35:22,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-10-16 04:35:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:22,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479327118] [2022-10-16 04:35:22,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479327118] [2022-10-16 04:35:22,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479327118] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:22,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:22,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:35:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020020696] [2022-10-16 04:35:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,660 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:22,705 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-10-16 04:35:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-16 04:35:22,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:22,707 INFO L225 Difference]: With dead ends: 48 [2022-10-16 04:35:22,707 INFO L226 Difference]: Without dead ends: 48 [2022-10-16 04:35:22,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,712 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 83 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-16 04:35:22,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 83 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-16 04:35:22,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-10-16 04:35:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-10-16 04:35:22,729 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 4 [2022-10-16 04:35:22,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:22,731 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-10-16 04:35:22,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-10-16 04:35:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:35:22,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:22,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:22,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 04:35:22,734 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:22,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782697, now seen corresponding path program 1 times [2022-10-16 04:35:22,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801625829] [2022-10-16 04:35:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:22,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:22,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:22,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801625829] [2022-10-16 04:35:22,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801625829] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:22,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:22,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:35:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257575824] [2022-10-16 04:35:22,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:22,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:22,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:22,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,840 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:22,876 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-10-16 04:35:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:22,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 04:35:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:22,878 INFO L225 Difference]: With dead ends: 45 [2022-10-16 04:35:22,878 INFO L226 Difference]: Without dead ends: 45 [2022-10-16 04:35:22,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:22,880 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 43 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:22,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 37 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-16 04:35:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-16 04:35:22,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-10-16 04:35:22,889 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 7 [2022-10-16 04:35:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:22,890 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-10-16 04:35:22,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-10-16 04:35:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:35:22,891 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:22,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:22,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 04:35:22,892 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:22,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782698, now seen corresponding path program 1 times [2022-10-16 04:35:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:22,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132452082] [2022-10-16 04:35:22,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:23,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132452082] [2022-10-16 04:35:23,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132452082] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:23,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:23,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 04:35:23,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563195056] [2022-10-16 04:35:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:23,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:23,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:23,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:23,096 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:23,149 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-10-16 04:35:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 04:35:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:23,153 INFO L225 Difference]: With dead ends: 46 [2022-10-16 04:35:23,153 INFO L226 Difference]: Without dead ends: 46 [2022-10-16 04:35:23,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:23,158 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 40 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-16 04:35:23,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 40 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-16 04:35:23,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-10-16 04:35:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-10-16 04:35:23,172 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 7 [2022-10-16 04:35:23,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:23,173 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-10-16 04:35:23,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-10-16 04:35:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 04:35:23,174 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:23,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:23,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 04:35:23,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:23,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782726, now seen corresponding path program 1 times [2022-10-16 04:35:23,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:23,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021123343] [2022-10-16 04:35:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:23,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:23,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021123343] [2022-10-16 04:35:23,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021123343] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:23,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:23,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:35:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538271120] [2022-10-16 04:35:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:23,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:35:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:35:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:35:23,289 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:23,330 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-10-16 04:35:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:35:23,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 04:35:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:23,331 INFO L225 Difference]: With dead ends: 45 [2022-10-16 04:35:23,332 INFO L226 Difference]: Without dead ends: 44 [2022-10-16 04:35:23,332 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-16 04:35:23,333 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:23,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-16 04:35:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-16 04:35:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-10-16 04:35:23,339 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-10-16 04:35:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:23,340 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-10-16 04:35:23,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-10-16 04:35:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:35:23,341 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:23,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:23,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 04:35:23,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383918, now seen corresponding path program 1 times [2022-10-16 04:35:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:23,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104129159] [2022-10-16 04:35:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:23,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:23,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104129159] [2022-10-16 04:35:23,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104129159] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:23,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:23,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 04:35:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204186761] [2022-10-16 04:35:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:23,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:35:23,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:23,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:35:23,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:23,599 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:23,667 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-10-16 04:35:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:35:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 04:35:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:23,669 INFO L225 Difference]: With dead ends: 42 [2022-10-16 04:35:23,669 INFO L226 Difference]: Without dead ends: 42 [2022-10-16 04:35:23,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:35:23,671 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 76 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:23,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 30 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:35:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-16 04:35:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-16 04:35:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 41 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-16 04:35:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-10-16 04:35:23,677 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 9 [2022-10-16 04:35:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:23,678 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-10-16 04:35:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-10-16 04:35:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 04:35:23,679 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:23,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:23,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 04:35:23,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1151383919, now seen corresponding path program 1 times [2022-10-16 04:35:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:23,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396200468] [2022-10-16 04:35:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:23,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396200468] [2022-10-16 04:35:23,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396200468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:23,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:23,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 04:35:23,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973433750] [2022-10-16 04:35:23,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:23,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:35:23,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:35:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:23,866 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:23,964 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-10-16 04:35:23,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:35:23,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 04:35:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:23,966 INFO L225 Difference]: With dead ends: 67 [2022-10-16 04:35:23,966 INFO L226 Difference]: Without dead ends: 67 [2022-10-16 04:35:23,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 04:35:23,967 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 165 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:23,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 48 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:35:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-16 04:35:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-10-16 04:35:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 52 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2022-10-16 04:35:23,974 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 9 [2022-10-16 04:35:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:23,974 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2022-10-16 04:35:23,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-10-16 04:35:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 04:35:23,975 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:23,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:23,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 04:35:23,976 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 698971654, now seen corresponding path program 1 times [2022-10-16 04:35:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:23,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703876315] [2022-10-16 04:35:23,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:24,007 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-16 04:35:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703876315] [2022-10-16 04:35:24,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703876315] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:24,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:24,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:35:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937568146] [2022-10-16 04:35:24,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:24,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 04:35:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 04:35:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:24,010 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:24,018 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-10-16 04:35:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 04:35:24,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-16 04:35:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:24,019 INFO L225 Difference]: With dead ends: 55 [2022-10-16 04:35:24,020 INFO L226 Difference]: Without dead ends: 55 [2022-10-16 04:35:24,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 04:35:24,021 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:24,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-16 04:35:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-10-16 04:35:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-10-16 04:35:24,027 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 13 [2022-10-16 04:35:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:24,027 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-10-16 04:35:24,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-10-16 04:35:24,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 04:35:24,028 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:24,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:24,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 04:35:24,029 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 698969732, now seen corresponding path program 1 times [2022-10-16 04:35:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:24,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269036034] [2022-10-16 04:35:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:24,603 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-16 04:35:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269036034] [2022-10-16 04:35:24,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269036034] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:24,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939654292] [2022-10-16 04:35:24,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:24,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:24,608 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-16 04:35:24,615 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-16 04:35:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:24,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-16 04:35:24,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:24,856 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-16 04:35:25,016 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-16 04:35:25,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-16 04:35:25,073 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 04:35:25,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-10-16 04:35:25,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-10-16 04:35:25,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:25,346 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-16 04:35:25,577 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-16 04:35:25,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:25,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strlcat_~d~0#1.offset_14| Int) (v_ArrVal_65 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~in~0#1.offset| |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|) (<= (+ |v_ULTIMATE.start_strlcat_~d~0#1.offset_14| 2) (select |c_#length| |c_ULTIMATE.start_main_~in~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~out~0#1.base| v_ArrVal_65) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|) 0) (not (<= 0 |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|)))) is different from false [2022-10-16 04:35:25,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_strlcat_~d~0#1.offset_14| Int) (v_ArrVal_65 (Array Int Int)) (v_ArrVal_64 Int) (|v_ULTIMATE.start_main_#t~malloc18#1.base_5| Int)) (or (< |c_ULTIMATE.start_main_~in~0#1.offset| |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|) (<= (+ |v_ULTIMATE.start_strlcat_~d~0#1.offset_14| 2) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc18#1.base_5| v_ArrVal_64) |c_ULTIMATE.start_main_~in~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_5|) 0)) (not (<= 0 |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|)) (= 0 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc18#1.base_5| v_ArrVal_65) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strlcat_~d~0#1.offset_14|)))) is different from false [2022-10-16 04:35:26,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:26,009 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-16 04:35:26,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 04:35:26,021 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 16 treesize of output 12 [2022-10-16 04:35:26,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 04:35:26,049 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-10-16 04:35:26,050 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 15 [2022-10-16 04:35:26,058 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 04:35:26,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-10-16 04:35:26,075 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-16 04:35:26,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939654292] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:26,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:26,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2022-10-16 04:35:26,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643820868] [2022-10-16 04:35:26,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:26,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 04:35:26,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:26,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 04:35:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=472, Unknown=2, NotChecked=90, Total=650 [2022-10-16 04:35:26,079 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:26,750 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2022-10-16 04:35:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 04:35:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 04:35:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:26,754 INFO L225 Difference]: With dead ends: 122 [2022-10-16 04:35:26,754 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 04:35:26,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=914, Unknown=2, NotChecked=126, Total=1190 [2022-10-16 04:35:26,756 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 193 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:26,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 637 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 244 Invalid, 0 Unknown, 373 Unchecked, 0.2s Time] [2022-10-16 04:35:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 04:35:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 62. [2022-10-16 04:35:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-10-16 04:35:26,765 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 13 [2022-10-16 04:35:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:26,766 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-10-16 04:35:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-10-16 04:35:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 04:35:26,767 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:26,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:26,813 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-16 04:35:26,981 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,SelfDestructingSolverStorable9 [2022-10-16 04:35:26,982 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:26,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1696819422, now seen corresponding path program 1 times [2022-10-16 04:35:26,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:26,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949270234] [2022-10-16 04:35:26,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:26,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:27,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:27,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949270234] [2022-10-16 04:35:27,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949270234] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:27,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:27,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:35:27,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587032981] [2022-10-16 04:35:27,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:27,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:35:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:35:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:35:27,058 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:27,096 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-10-16 04:35:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:35:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 04:35:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:27,098 INFO L225 Difference]: With dead ends: 60 [2022-10-16 04:35:27,098 INFO L226 Difference]: Without dead ends: 60 [2022-10-16 04:35:27,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:27,099 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:27,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-16 04:35:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-10-16 04:35:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 59 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2022-10-16 04:35:27,104 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 15 [2022-10-16 04:35:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:27,105 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2022-10-16 04:35:27,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,105 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2022-10-16 04:35:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 04:35:27,106 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:27,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:27,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 04:35:27,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1696819423, now seen corresponding path program 1 times [2022-10-16 04:35:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:27,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250184173] [2022-10-16 04:35:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:27,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:27,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250184173] [2022-10-16 04:35:27,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250184173] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:27,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:27,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:35:27,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490897539] [2022-10-16 04:35:27,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:27,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:35:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:27,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:35:27,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:35:27,249 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:27,303 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-10-16 04:35:27,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:35:27,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-16 04:35:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:27,305 INFO L225 Difference]: With dead ends: 82 [2022-10-16 04:35:27,305 INFO L226 Difference]: Without dead ends: 82 [2022-10-16 04:35:27,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:27,306 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:27,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 41 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-16 04:35:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2022-10-16 04:35:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 67 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-10-16 04:35:27,313 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 15 [2022-10-16 04:35:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:27,313 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-10-16 04:35:27,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-10-16 04:35:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 04:35:27,314 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:27,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:27,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 04:35:27,315 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1061768763, now seen corresponding path program 1 times [2022-10-16 04:35:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:27,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593921660] [2022-10-16 04:35:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:27,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593921660] [2022-10-16 04:35:27,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593921660] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:27,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:27,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 04:35:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563741430] [2022-10-16 04:35:27,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:27,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:35:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:27,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:35:27,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:27,391 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:27,449 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2022-10-16 04:35:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 04:35:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 04:35:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:27,450 INFO L225 Difference]: With dead ends: 68 [2022-10-16 04:35:27,450 INFO L226 Difference]: Without dead ends: 68 [2022-10-16 04:35:27,451 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-16 04:35:27,452 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 69 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:27,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 46 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-16 04:35:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-10-16 04:35:27,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 66 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-10-16 04:35:27,457 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 16 [2022-10-16 04:35:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:27,457 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-10-16 04:35:27,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-10-16 04:35:27,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 04:35:27,459 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:27,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 04:35:27,459 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1061768764, now seen corresponding path program 1 times [2022-10-16 04:35:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46856819] [2022-10-16 04:35:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:27,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:27,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:27,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46856819] [2022-10-16 04:35:27,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46856819] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:27,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:27,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 04:35:27,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675720134] [2022-10-16 04:35:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:27,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:35:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:27,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:35:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:27,623 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:27,707 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-10-16 04:35:27,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 04:35:27,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-16 04:35:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:27,708 INFO L225 Difference]: With dead ends: 89 [2022-10-16 04:35:27,708 INFO L226 Difference]: Without dead ends: 89 [2022-10-16 04:35:27,709 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-16 04:35:27,710 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 102 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:27,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 60 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:35:27,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-16 04:35:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2022-10-16 04:35:27,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.5) internal successors, (90), 67 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2022-10-16 04:35:27,715 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 16 [2022-10-16 04:35:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:27,715 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2022-10-16 04:35:27,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2022-10-16 04:35:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-16 04:35:27,716 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:27,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:27,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 04:35:27,717 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:27,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:27,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1115132185, now seen corresponding path program 2 times [2022-10-16 04:35:27,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:27,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366415565] [2022-10-16 04:35:27,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:27,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:28,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366415565] [2022-10-16 04:35:28,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366415565] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:28,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703629821] [2022-10-16 04:35:28,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 04:35:28,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:28,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:28,389 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-16 04:35:28,407 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-16 04:35:28,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 04:35:28,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 04:35:28,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2022-10-16 04:35:28,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:28,478 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-16 04:35:28,503 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-16 04:35:28,539 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-16 04:35:28,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-10-16 04:35:28,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 04:35:28,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-16 04:35:28,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:28,707 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-16 04:35:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:28,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:29,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_118 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc18#1.base_6| Int) (|v_ULTIMATE.start_strlcat_~d~0#1.offset_18| Int) (v_ArrVal_117 Int)) (let ((.cse0 (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc18#1.base_6| v_ArrVal_117) |c_ULTIMATE.start_main_~in~0#1.base|))) (or (not (<= (+ |v_ULTIMATE.start_strlcat_~d~0#1.offset_18| 1) .cse0)) (<= (+ |v_ULTIMATE.start_strlcat_~d~0#1.offset_18| 2) .cse0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc18#1.base_6|) 0)) (< |v_ULTIMATE.start_strlcat_~d~0#1.offset_18| 1) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc18#1.base_6| v_ArrVal_118) |c_ULTIMATE.start_main_~in~0#1.base|) |v_ULTIMATE.start_strlcat_~d~0#1.offset_18|) 0)))) is different from false [2022-10-16 04:35:29,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:29,503 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-16 04:35:29,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-16 04:35:29,517 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-10-16 04:35:29,517 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 15 [2022-10-16 04:35:29,531 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-16 04:35:29,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-10-16 04:35:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:29,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703629821] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:29,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:29,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2022-10-16 04:35:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456237552] [2022-10-16 04:35:29,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:29,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-16 04:35:29,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:29,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-16 04:35:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=767, Unknown=6, NotChecked=56, Total=930 [2022-10-16 04:35:29,700 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:31,930 INFO L93 Difference]: Finished difference Result 220 states and 264 transitions. [2022-10-16 04:35:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-10-16 04:35:31,931 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-16 04:35:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:31,932 INFO L225 Difference]: With dead ends: 220 [2022-10-16 04:35:31,933 INFO L226 Difference]: Without dead ends: 220 [2022-10-16 04:35:31,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=733, Invalid=2687, Unknown=6, NotChecked=114, Total=3540 [2022-10-16 04:35:31,939 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 648 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:31,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 919 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 631 Invalid, 0 Unknown, 378 Unchecked, 0.6s Time] [2022-10-16 04:35:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-10-16 04:35:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 62. [2022-10-16 04:35:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.490909090909091) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-10-16 04:35:31,946 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 17 [2022-10-16 04:35:31,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:31,946 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-10-16 04:35:31,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-10-16 04:35:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-16 04:35:31,947 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:31,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:31,984 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-16 04:35:32,162 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,SelfDestructingSolverStorable14 [2022-10-16 04:35:32,163 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:32,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1842477907, now seen corresponding path program 1 times [2022-10-16 04:35:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:32,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984251420] [2022-10-16 04:35:32,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:32,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984251420] [2022-10-16 04:35:32,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984251420] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:32,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:32,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:35:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135592325] [2022-10-16 04:35:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 04:35:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:32,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 04:35:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:32,254 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-16 04:35:32,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:32,283 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-10-16 04:35:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 04:35:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 18 [2022-10-16 04:35:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:32,284 INFO L225 Difference]: With dead ends: 65 [2022-10-16 04:35:32,284 INFO L226 Difference]: Without dead ends: 65 [2022-10-16 04:35:32,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 04:35:32,285 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 71 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:32,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-16 04:35:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-10-16 04:35:32,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 61 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:32,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2022-10-16 04:35:32,289 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 18 [2022-10-16 04:35:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:32,289 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2022-10-16 04:35:32,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-16 04:35:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2022-10-16 04:35:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 04:35:32,291 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:32,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:32,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 04:35:32,291 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:32,292 INFO L85 PathProgramCache]: Analyzing trace with hash -511617514, now seen corresponding path program 1 times [2022-10-16 04:35:32,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:32,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105907974] [2022-10-16 04:35:32,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:32,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:32,667 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-16 04:35:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105907974] [2022-10-16 04:35:32,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105907974] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269154366] [2022-10-16 04:35:32,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:32,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:32,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:32,670 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-16 04:35:32,675 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-16 04:35:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:32,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-16 04:35:32,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:32,766 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-16 04:35:32,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:32,970 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-16 04:35:33,060 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-16 04:35:33,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:33,282 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-16 04:35:33,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 16 treesize of output 12 [2022-10-16 04:35:33,294 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 22 treesize of output 20 [2022-10-16 04:35:33,305 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-16 04:35:33,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269154366] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:33,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:33,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-10-16 04:35:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008079736] [2022-10-16 04:35:33,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:33,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-16 04:35:33,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:33,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-16 04:35:33,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-10-16 04:35:33,308 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:33,522 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2022-10-16 04:35:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 04:35:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 04:35:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:33,524 INFO L225 Difference]: With dead ends: 100 [2022-10-16 04:35:33,524 INFO L226 Difference]: Without dead ends: 100 [2022-10-16 04:35:33,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-10-16 04:35:33,525 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:33,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 241 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-10-16 04:35:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-16 04:35:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2022-10-16 04:35:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-10-16 04:35:33,529 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 19 [2022-10-16 04:35:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:33,529 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-10-16 04:35:33,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2022-10-16 04:35:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 04:35:33,531 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:33,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:33,571 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-16 04:35:33,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:33,743 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -511626460, now seen corresponding path program 1 times [2022-10-16 04:35:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:33,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658445947] [2022-10-16 04:35:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:33,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658445947] [2022-10-16 04:35:33,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658445947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:33,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:33,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 04:35:33,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326135373] [2022-10-16 04:35:33,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:33,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 04:35:33,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:33,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 04:35:33,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 04:35:33,795 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:33,831 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-10-16 04:35:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 04:35:33,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 04:35:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:33,833 INFO L225 Difference]: With dead ends: 71 [2022-10-16 04:35:33,833 INFO L226 Difference]: Without dead ends: 71 [2022-10-16 04:35:33,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 04:35:33,834 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:33,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-16 04:35:33,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-10-16 04:35:33,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 69 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-10-16 04:35:33,838 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 19 [2022-10-16 04:35:33,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:33,838 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-10-16 04:35:33,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:33,839 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-10-16 04:35:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 04:35:33,839 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:33,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:33,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-16 04:35:33,840 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:33,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -511626459, now seen corresponding path program 1 times [2022-10-16 04:35:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:33,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866457867] [2022-10-16 04:35:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:33,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:33,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866457867] [2022-10-16 04:35:33,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866457867] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:33,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:33,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:35:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703567800] [2022-10-16 04:35:33,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 04:35:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 04:35:33,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:35:33,965 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:34,027 INFO L93 Difference]: Finished difference Result 123 states and 155 transitions. [2022-10-16 04:35:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:35:34,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 04:35:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:34,029 INFO L225 Difference]: With dead ends: 123 [2022-10-16 04:35:34,029 INFO L226 Difference]: Without dead ends: 123 [2022-10-16 04:35:34,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:35:34,030 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:34,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 82 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-10-16 04:35:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-10-16 04:35:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.38) internal successors, (138), 104 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-10-16 04:35:34,035 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 19 [2022-10-16 04:35:34,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:34,035 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-10-16 04:35:34,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-10-16 04:35:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 04:35:34,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:34,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:34,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 04:35:34,037 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:34,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:34,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1280884675, now seen corresponding path program 1 times [2022-10-16 04:35:34,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:34,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832149760] [2022-10-16 04:35:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:34,337 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-16 04:35:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:34,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832149760] [2022-10-16 04:35:34,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832149760] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:34,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82215076] [2022-10-16 04:35:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:34,340 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-16 04:35:34,366 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-16 04:35:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:34,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 04:35:34,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:34,436 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-16 04:35:34,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:34,622 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-16 04:35:34,715 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-16 04:35:34,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:34,998 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-16 04:35:35,002 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 16 treesize of output 12 [2022-10-16 04:35:35,008 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 22 treesize of output 20 [2022-10-16 04:35:35,019 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-16 04:35:35,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82215076] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:35,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:35,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2022-10-16 04:35:35,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503706320] [2022-10-16 04:35:35,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:35,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 04:35:35,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 04:35:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-10-16 04:35:35,022 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:35,243 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2022-10-16 04:35:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 04:35:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 04:35:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:35,245 INFO L225 Difference]: With dead ends: 126 [2022-10-16 04:35:35,245 INFO L226 Difference]: Without dead ends: 126 [2022-10-16 04:35:35,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-10-16 04:35:35,247 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:35,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 319 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 57 Unchecked, 0.1s Time] [2022-10-16 04:35:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-10-16 04:35:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2022-10-16 04:35:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.3727272727272728) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:35,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 151 transitions. [2022-10-16 04:35:35,251 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 151 transitions. Word has length 19 [2022-10-16 04:35:35,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:35,251 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 151 transitions. [2022-10-16 04:35:35,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 151 transitions. [2022-10-16 04:35:35,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-16 04:35:35,253 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:35,253 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-16 04:35:35,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-16 04:35:35,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:35,465 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:35,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:35,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1318065658, now seen corresponding path program 1 times [2022-10-16 04:35:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:35,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070664703] [2022-10-16 04:35:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:35,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070664703] [2022-10-16 04:35:35,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070664703] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:35,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 04:35:35,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 04:35:35,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637366189] [2022-10-16 04:35:35,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:35,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 04:35:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 04:35:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:35:35,670 INFO L87 Difference]: Start difference. First operand 115 states and 151 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-16 04:35:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:35,700 INFO L93 Difference]: Finished difference Result 114 states and 150 transitions. [2022-10-16 04:35:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 04:35:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-16 04:35:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:35,701 INFO L225 Difference]: With dead ends: 114 [2022-10-16 04:35:35,702 INFO L226 Difference]: Without dead ends: 108 [2022-10-16 04:35:35,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 04:35:35,703 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:35,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 82 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 04:35:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-16 04:35:35,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-16 04:35:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 107 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2022-10-16 04:35:35,706 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 20 [2022-10-16 04:35:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:35,707 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2022-10-16 04:35:35,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-16 04:35:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2022-10-16 04:35:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 04:35:35,708 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:35,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:35,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 04:35:35,708 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -165163059, now seen corresponding path program 2 times [2022-10-16 04:35:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:35,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713644938] [2022-10-16 04:35:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713644938] [2022-10-16 04:35:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713644938] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293956645] [2022-10-16 04:35:36,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 04:35:36,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:36,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:35:36,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 04:35:36,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 04:35:36,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 04:35:36,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 04:35:36,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:36,281 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-16 04:35:36,293 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 13 treesize of output 9 [2022-10-16 04:35:36,531 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:36,531 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 17 treesize of output 17 [2022-10-16 04:35:36,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:36,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:37,093 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-16 04:35:37,098 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 22 treesize of output 20 [2022-10-16 04:35:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:37,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293956645] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:37,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:37,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2022-10-16 04:35:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931826178] [2022-10-16 04:35:37,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:37,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-10-16 04:35:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-10-16 04:35:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2022-10-16 04:35:37,152 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 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-16 04:35:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:37,923 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2022-10-16 04:35:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-16 04:35:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 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) Word has length 23 [2022-10-16 04:35:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:37,929 INFO L225 Difference]: With dead ends: 119 [2022-10-16 04:35:37,929 INFO L226 Difference]: Without dead ends: 119 [2022-10-16 04:35:37,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=1230, Unknown=0, NotChecked=0, Total=1482 [2022-10-16 04:35:37,933 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:37,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 235 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-10-16 04:35:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-10-16 04:35:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2022-10-16 04:35:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.26) internal successors, (126), 103 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2022-10-16 04:35:37,937 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 23 [2022-10-16 04:35:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:37,937 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2022-10-16 04:35:37,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 26 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-16 04:35:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-10-16 04:35:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 04:35:37,938 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:37,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:37,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 04:35:38,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-16 04:35:38,154 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash 95310330, now seen corresponding path program 1 times [2022-10-16 04:35:38,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:38,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536963134] [2022-10-16 04:35:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:38,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:38,286 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-16 04:35:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536963134] [2022-10-16 04:35:38,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536963134] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:38,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129793695] [2022-10-16 04:35:38,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:38,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:38,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:38,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:35:38,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 04:35:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:38,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2022-10-16 04:35:38,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 04:35:38,430 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 04:35:38,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129793695] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 04:35:38,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 04:35:38,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-10-16 04:35:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831509104] [2022-10-16 04:35:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 04:35:38,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 04:35:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 04:35:38,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-16 04:35:38,433 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:38,500 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2022-10-16 04:35:38,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 04:35:38,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 04:35:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:38,502 INFO L225 Difference]: With dead ends: 122 [2022-10-16 04:35:38,502 INFO L226 Difference]: Without dead ends: 122 [2022-10-16 04:35:38,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-16 04:35:38,503 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:38,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 115 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 04:35:38,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-10-16 04:35:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 104. [2022-10-16 04:35:38,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.25) internal successors, (125), 103 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-10-16 04:35:38,508 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 23 [2022-10-16 04:35:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:38,509 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-10-16 04:35:38,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-10-16 04:35:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-16 04:35:38,510 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:38,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:38,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 04:35:38,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:38,725 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash -673947886, now seen corresponding path program 1 times [2022-10-16 04:35:38,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:38,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225485889] [2022-10-16 04:35:38,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:38,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 04:35:39,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 04:35:39,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225485889] [2022-10-16 04:35:39,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225485889] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 04:35:39,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541616543] [2022-10-16 04:35:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 04:35:39,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 04:35:39,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 04:35:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 04:35:39,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 32 conjunts are in the unsatisfiable core [2022-10-16 04:35:39,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 04:35:39,244 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-16 04:35:39,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-16 04:35:39,487 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-16 04:35:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 04:35:39,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 04:35:39,946 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-16 04:35:39,952 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 22 treesize of output 20 [2022-10-16 04:35:39,958 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-16 04:35:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 04:35:39,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541616543] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 04:35:39,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 04:35:39,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-10-16 04:35:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763145768] [2022-10-16 04:35:39,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 04:35:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-16 04:35:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 04:35:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-16 04:35:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-10-16 04:35:39,979 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 04:35:40,179 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2022-10-16 04:35:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 04:35:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-16 04:35:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 04:35:40,182 INFO L225 Difference]: With dead ends: 110 [2022-10-16 04:35:40,182 INFO L226 Difference]: Without dead ends: 110 [2022-10-16 04:35:40,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2022-10-16 04:35:40,184 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 04:35:40,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 195 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-10-16 04:35:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-16 04:35:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2022-10-16 04:35:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.25) internal successors, (125), 103 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-10-16 04:35:40,188 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 23 [2022-10-16 04:35:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 04:35:40,188 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-10-16 04:35:40,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 21 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 04:35:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-10-16 04:35:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-16 04:35:40,189 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 04:35:40,189 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:40,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 04:35:40,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 04:35:40,403 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2022-10-16 04:35:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 04:35:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 794469340, now seen corresponding path program 1 times [2022-10-16 04:35:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 04:35:40,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099699522] [2022-10-16 04:35:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 04:35:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 04:35:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 04:35:40,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 04:35:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 04:35:40,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 04:35:40,461 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 04:35:40,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 17 remaining) [2022-10-16 04:35:40,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 17 remaining) [2022-10-16 04:35:40,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 17 remaining) [2022-10-16 04:35:40,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 17 remaining) [2022-10-16 04:35:40,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 17 remaining) [2022-10-16 04:35:40,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 17 remaining) [2022-10-16 04:35:40,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 17 remaining) [2022-10-16 04:35:40,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 17 remaining) [2022-10-16 04:35:40,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 17 remaining) [2022-10-16 04:35:40,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 17 remaining) [2022-10-16 04:35:40,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 17 remaining) [2022-10-16 04:35:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 17 remaining) [2022-10-16 04:35:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 17 remaining) [2022-10-16 04:35:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 17 remaining) [2022-10-16 04:35:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 17 remaining) [2022-10-16 04:35:40,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 17 remaining) [2022-10-16 04:35:40,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (0 of 17 remaining) [2022-10-16 04:35:40,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 04:35:40,472 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 04:35:40,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 04:35:40,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:35:40 BoogieIcfgContainer [2022-10-16 04:35:40,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 04:35:40,527 INFO L158 Benchmark]: Toolchain (without parser) took 20071.72ms. Allocated memory was 152.0MB in the beginning and 316.7MB in the end (delta: 164.6MB). Free memory was 125.8MB in the beginning and 250.5MB in the end (delta: -124.7MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,528 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 152.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 04:35:40,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.14ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 110.0MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.28ms. Allocated memory is still 152.0MB. Free memory was 110.0MB in the beginning and 107.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,529 INFO L158 Benchmark]: Boogie Preprocessor took 34.17ms. Allocated memory is still 152.0MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,529 INFO L158 Benchmark]: RCFGBuilder took 710.48ms. Allocated memory is still 152.0MB. Free memory was 106.1MB in the beginning and 128.7MB in the end (delta: -22.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,529 INFO L158 Benchmark]: TraceAbstraction took 18794.35ms. Allocated memory was 152.0MB in the beginning and 316.7MB in the end (delta: 164.6MB). Free memory was 128.2MB in the beginning and 250.5MB in the end (delta: -122.3MB). Peak memory consumption was 43.9MB. Max. memory is 8.0GB. [2022-10-16 04:35:40,531 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.24ms. Allocated memory is still 152.0MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.14ms. Allocated memory is still 152.0MB. Free memory was 125.6MB in the beginning and 110.0MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.28ms. Allocated memory is still 152.0MB. Free memory was 110.0MB in the beginning and 107.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.17ms. Allocated memory is still 152.0MB. Free memory was 107.7MB in the beginning and 106.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.48ms. Allocated memory is still 152.0MB. Free memory was 106.1MB in the beginning and 128.7MB in the end (delta: -22.6MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * TraceAbstraction took 18794.35ms. Allocated memory was 152.0MB in the beginning and 316.7MB in the end (delta: 164.6MB). Free memory was 128.2MB in the beginning and 250.5MB in the end (delta: -122.3MB). Peak memory consumption was 43.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L538] int in_len = __VERIFIER_nondet_int(); [L539] COND FALSE !(in_len < 1) [L540] char* in = __builtin_alloca (in_len); VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=1] [L541] in[in_len-1]=0 VAL [__builtin_alloca (in_len)={4:0}, in={4:0}, in_len=1] [L542] int out_len = __VERIFIER_nondet_int(); [L543] COND FALSE !(out_len < 1) [L544] char* out = __builtin_alloca (out_len); VAL [__builtin_alloca (in_len)={4:0}, __builtin_alloca (out_len)={3:0}, in={4:0}, in_len=1, out={3:0}, out_len=2] [L545] out[out_len-1]=0 VAL [__builtin_alloca (in_len)={4:0}, __builtin_alloca (out_len)={3:0}, in={4:0}, in_len=1, out={3:0}, out_len=2] [L546] CALL strlcat(in, out, out_len) [L517] register char *d = dst; [L518] register const char *s = src; [L519] register size_t n = siz; [L520] size_t dlen; VAL [\old(siz)=2, d={4:0}, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L521] EXPR \read(*d) VAL [\old(siz)=2, \read(*d)=0, d={4:0}, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L521] *d != '\0' && n-- != 0 VAL [*d != '\0' && n-- != 0=0, \old(siz)=2, \read(*d)=0, d={4:0}, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L521] COND FALSE !(*d != '\0' && n-- != 0) [L523] dlen = d - dst [L524] n = siz - dlen VAL [\old(siz)=2, d={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L525] COND FALSE !(n == 0) VAL [\old(siz)=2, d={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L527] EXPR \read(*s) VAL [\old(siz)=2, \read(*s)=5, d={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L527] COND TRUE *s != '\0' [L528] COND TRUE n != 1 [L529] EXPR d++ VAL [\old(siz)=2, d={4:1}, d++={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L529] EXPR \read(*s) VAL [\old(siz)=2, \read(*s)=5, d={4:1}, d++={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L529] *d++ = *s VAL [\old(siz)=2, \read(*s)=5, d={4:1}, d++={4:0}, dlen=0, dst={4:0}, dst={4:0}, n=2, s={3:0}, siz=2, src={3:0}, src={3:0}] [L530] n-- VAL [\old(siz)=2, d={4:1}, dlen=0, dst={4:0}, dst={4:0}, n=1, s={3:0}, siz=2, src={3:0}, src={3:0}] [L532] s++ VAL [\old(siz)=2, d={4:1}, dlen=0, dst={4:0}, dst={4:0}, n=1, s={3:1}, siz=2, src={3:0}, src={3:0}] [L527] EXPR \read(*s) VAL [\old(siz)=2, \read(*s)=0, d={4:1}, dlen=0, dst={4:0}, dst={4:0}, n=1, s={3:1}, siz=2, src={3:0}, src={3:0}] [L527] COND FALSE !(*s != '\0') [L534] *d = '\0' - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 537]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 17 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1965 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1965 mSDsluCounter, 3683 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 949 IncrementalHoareTripleChecker+Unchecked, 2743 mSDsCounter, 200 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1962 IncrementalHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 200 mSolverCounterUnsat, 940 mSDtfsCounter, 1962 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 196 SyntacticMatches, 15 SemanticMatches, 252 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=20, InterpolantAutomatonStates: 174, 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, 24 MinimizatonAttempts, 373 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 553 ConstructedInterpolants, 90 QuantifiedInterpolants, 6467 SizeOfPredicates, 90 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 37 InterpolantComputations, 18 PerfectInterpolantSequences, 19/69 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-16 04:35:40,582 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...