/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:57:24,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:57:24,038 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:57:24,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:57:24,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:57:24,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:57:24,117 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:57:24,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:57:24,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:57:24,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:57:24,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:57:24,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:57:24,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:57:24,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:57:24,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:57:24,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:57:24,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:57:24,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:57:24,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:57:24,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:57:24,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:57:24,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:57:24,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:57:24,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:57:24,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:57:24,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:57:24,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:57:24,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:57:24,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:57:24,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:57:24,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:57:24,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:57:24,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:57:24,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:57:24,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:57:24,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:57:24,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:57:24,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:57:24,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:57:24,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:57:24,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:57:24,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:57:24,314 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:57:24,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:57:24,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:57:24,316 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:57:24,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:57:24,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:57:24,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:57:24,322 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:57:24,322 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:57:24,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:57:24,324 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:57:24,324 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:57:24,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:57:24,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:57:24,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:57:24,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:57:24,325 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:57:24,325 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:57:24,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:57:24,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:57:24,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:57:24,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:57:24,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:57:24,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:57:24,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:57:24,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:24,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:57:24,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:57:24,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:57:24,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:57:24,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:57:24,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:57:24,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:57:24,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:57:24,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:57:24,855 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:57:24,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2022-10-15 17:57:24,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d164d4/ab596b0f93184430a90df0e31665761b/FLAG01cc0d1ca [2022-10-15 17:57:25,652 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:57:25,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/cstrncmp-alloca-2.i [2022-10-15 17:57:25,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d164d4/ab596b0f93184430a90df0e31665761b/FLAG01cc0d1ca [2022-10-15 17:57:25,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/616d164d4/ab596b0f93184430a90df0e31665761b [2022-10-15 17:57:25,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:57:25,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:57:25,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:25,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:57:25,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:57:25,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:25" (1/1) ... [2022-10-15 17:57:25,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762b412c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:25, skipping insertion in model container [2022-10-15 17:57:25,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:57:25" (1/1) ... [2022-10-15 17:57:25,961 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:57:26,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:57:26,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:26,415 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:57:26,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:57:26,511 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:57:26,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26 WrapperNode [2022-10-15 17:57:26,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:57:26,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:26,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:57:26,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:57:26,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,573 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2022-10-15 17:57:26,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:57:26,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:57:26,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:57:26,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:57:26,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,608 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:57:26,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:57:26,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:57:26,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:57:26,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (1/1) ... [2022-10-15 17:57:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:57:26,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:26,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:57:26,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:57:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:57:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:57:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:57:26,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:57:26,862 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:57:26,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:57:27,459 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:57:27,472 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:57:27,473 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 17:57:27,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:27 BoogieIcfgContainer [2022-10-15 17:57:27,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:57:27,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:57:27,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:57:27,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:57:27,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:57:25" (1/3) ... [2022-10-15 17:57:27,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906c6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:27, skipping insertion in model container [2022-10-15 17:57:27,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:57:26" (2/3) ... [2022-10-15 17:57:27,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906c6be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:57:27, skipping insertion in model container [2022-10-15 17:57:27,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:57:27" (3/3) ... [2022-10-15 17:57:27,490 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca-2.i [2022-10-15 17:57:27,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:57:27,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-10-15 17:57:27,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:57:27,600 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;@7e3bbd1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:57:27,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-10-15 17:57:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 43 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-15 17:57:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:57:27,616 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:27,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:57:27,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:27,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2022-10-15 17:57:27,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:27,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054748697] [2022-10-15 17:57:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:28,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:28,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054748697] [2022-10-15 17:57:28,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054748697] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:28,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:28,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:28,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965791593] [2022-10-15 17:57:28,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:28,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:28,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:28,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:28,262 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 43 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:28,333 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-10-15 17:57:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:57:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:28,351 INFO L225 Difference]: With dead ends: 43 [2022-10-15 17:57:28,352 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 17:57:28,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:28,361 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:28,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 17:57:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-10-15 17:57:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-10-15 17:57:28,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 6 [2022-10-15 17:57:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:28,415 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-10-15 17:57:28,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-10-15 17:57:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:57:28,416 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:28,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:57:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:57:28,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2022-10-15 17:57:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:28,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571837076] [2022-10-15 17:57:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:28,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571837076] [2022-10-15 17:57:28,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571837076] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:28,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:28,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946501246] [2022-10-15 17:57:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:28,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:28,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:28,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:28,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:28,658 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:28,716 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-10-15 17:57:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:28,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:57:28,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:28,719 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:57:28,719 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 17:57:28,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:28,722 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:28,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 17:57:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 17:57:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-10-15 17:57:28,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 6 [2022-10-15 17:57:28,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:28,733 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-10-15 17:57:28,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-10-15 17:57:28,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:57:28,734 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:28,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:28,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:57:28,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:28,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:28,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2022-10-15 17:57:28,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:28,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446645032] [2022-10-15 17:57:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:28,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446645032] [2022-10-15 17:57:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446645032] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:28,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:28,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752408065] [2022-10-15 17:57:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:28,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:28,901 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:28,971 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-10-15 17:57:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:57:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:28,976 INFO L225 Difference]: With dead ends: 39 [2022-10-15 17:57:28,976 INFO L226 Difference]: Without dead ends: 39 [2022-10-15 17:57:28,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:28,985 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:28,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:28,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-15 17:57:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-15 17:57:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 38 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-15 17:57:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-10-15 17:57:29,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 7 [2022-10-15 17:57:29,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:29,008 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-10-15 17:57:29,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-10-15 17:57:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:57:29,010 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:29,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:29,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:57:29,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:29,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2022-10-15 17:57:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:29,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125180929] [2022-10-15 17:57:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:29,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125180929] [2022-10-15 17:57:29,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125180929] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:29,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:29,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859951439] [2022-10-15 17:57:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:29,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:29,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:29,279 INFO L87 Difference]: Start difference. First operand 39 states and 46 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-15 17:57:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:29,363 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-10-15 17:57:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:29,365 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-15 17:57:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:29,369 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:57:29,370 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:57:29,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:29,380 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:29,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 37 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:29,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:57:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:57:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 37 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-15 17:57:29,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-10-15 17:57:29,394 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 7 [2022-10-15 17:57:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:29,395 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-10-15 17:57:29,395 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-15 17:57:29,396 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-10-15 17:57:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:57:29,396 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:29,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:29,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:57:29,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2111256018, now seen corresponding path program 1 times [2022-10-15 17:57:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918113298] [2022-10-15 17:57:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:29,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918113298] [2022-10-15 17:57:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918113298] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:29,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:29,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631864304] [2022-10-15 17:57:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:29,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:29,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:29,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:29,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:29,813 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:29,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:29,869 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-10-15 17:57:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-15 17:57:29,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:29,871 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:57:29,871 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 17:57:29,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:29,874 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:29,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 17:57:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-15 17:57:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-10-15 17:57:29,883 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 11 [2022-10-15 17:57:29,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:29,884 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-10-15 17:57:29,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-10-15 17:57:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:57:29,885 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:29,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:29,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:57:29,887 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1024420044, now seen corresponding path program 1 times [2022-10-15 17:57:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:29,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4062650] [2022-10-15 17:57:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:29,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:29,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4062650] [2022-10-15 17:57:29,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4062650] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:29,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:29,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:29,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785377243] [2022-10-15 17:57:29,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:30,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:30,002 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,070 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-10-15 17:57:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:57:30,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,071 INFO L225 Difference]: With dead ends: 29 [2022-10-15 17:57:30,072 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 17:57:30,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:57:30,075 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 17:57:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-15 17:57:30,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5) internal successors, (33), 28 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-15 17:57:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-10-15 17:57:30,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 12 [2022-10-15 17:57:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,086 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-10-15 17:57:30,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-10-15 17:57:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:57:30,090 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:30,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:57:30,091 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1024420043, now seen corresponding path program 1 times [2022-10-15 17:57:30,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125893382] [2022-10-15 17:57:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125893382] [2022-10-15 17:57:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125893382] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:30,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:57:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592839486] [2022-10-15 17:57:30,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:57:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:57:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:57:30,311 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,382 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2022-10-15 17:57:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:57:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:57:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,384 INFO L225 Difference]: With dead ends: 46 [2022-10-15 17:57:30,384 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 17:57:30,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:57:30,385 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 104 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 46 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 17:57:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-10-15 17:57:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-10-15 17:57:30,391 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 12 [2022-10-15 17:57:30,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,391 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-10-15 17:57:30,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-10-15 17:57:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:57:30,392 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:30,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:57:30,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1692250283, now seen corresponding path program 1 times [2022-10-15 17:57:30,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5963055] [2022-10-15 17:57:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:30,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:30,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5963055] [2022-10-15 17:57:30,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5963055] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:30,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:30,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:30,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102712733] [2022-10-15 17:57:30,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:57:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:57:30,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:57:30,456 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-15 17:57:30,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,489 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-10-15 17:57:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:57:30,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-15 17:57:30,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,490 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:57:30,491 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:57:30,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:57:30,492 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:57:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:57:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-10-15 17:57:30,497 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-10-15 17:57:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,497 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-10-15 17:57:30,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-15 17:57:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-10-15 17:57:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:57:30,498 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:30,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:57:30,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1692250282, now seen corresponding path program 1 times [2022-10-15 17:57:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667044667] [2022-10-15 17:57:30,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:30,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:30,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667044667] [2022-10-15 17:57:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667044667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:30,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:30,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:57:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362161462] [2022-10-15 17:57:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:57:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:57:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:57:30,690 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-15 17:57:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,753 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-10-15 17:57:30,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:57:30,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-15 17:57:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,755 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:57:30,755 INFO L226 Difference]: Without dead ends: 37 [2022-10-15 17:57:30,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:57:30,757 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-10-15 17:57:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-10-15 17:57:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-10-15 17:57:30,762 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 13 [2022-10-15 17:57:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,763 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-10-15 17:57:30,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-15 17:57:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-10-15 17:57:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:57:30,764 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,764 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:30,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:57:30,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1931361025, now seen corresponding path program 1 times [2022-10-15 17:57:30,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659812462] [2022-10-15 17:57:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:30,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:30,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659812462] [2022-10-15 17:57:30,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659812462] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:30,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:30,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:30,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200288379] [2022-10-15 17:57:30,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:30,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:30,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:30,809 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,819 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-10-15 17:57:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-15 17:57:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,821 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:57:30,821 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:57:30,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:30,823 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:57:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:57:30,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-10-15 17:57:30,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2022-10-15 17:57:30,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,828 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-10-15 17:57:30,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-10-15 17:57:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:57:30,829 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,830 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:30,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:57:30,830 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1820690373, now seen corresponding path program 1 times [2022-10-15 17:57:30,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920801499] [2022-10-15 17:57:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:30,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920801499] [2022-10-15 17:57:30,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920801499] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:30,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:30,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:57:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957807386] [2022-10-15 17:57:30,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:30,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:30,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:30,876 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:30,884 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-10-15 17:57:30,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:30,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:57:30,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:30,886 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:57:30,886 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:57:30,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:30,888 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:30,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:57:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:57:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-10-15 17:57:30,892 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 20 [2022-10-15 17:57:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:30,893 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-10-15 17:57:30,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-10-15 17:57:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:57:30,897 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:30,897 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] [2022-10-15 17:57:30,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:57:30,898 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -88589824, now seen corresponding path program 1 times [2022-10-15 17:57:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810574467] [2022-10-15 17:57:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:31,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810574467] [2022-10-15 17:57:31,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810574467] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:31,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:57:31,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616113407] [2022-10-15 17:57:31,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:31,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:57:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:57:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:57:31,258 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:31,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:31,372 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-10-15 17:57:31,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:57:31,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:57:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:31,374 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:57:31,374 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:57:31,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:57:31,375 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:31,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:57:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:57:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:57:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-10-15 17:57:31,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2022-10-15 17:57:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:31,380 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-10-15 17:57:31,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:31,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-10-15 17:57:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:57:31,381 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:31,381 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] [2022-10-15 17:57:31,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:57:31,382 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -906238274, now seen corresponding path program 1 times [2022-10-15 17:57:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570667510] [2022-10-15 17:57:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:31,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570667510] [2022-10-15 17:57:31,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570667510] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763355321] [2022-10-15 17:57:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:31,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:31,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:31,849 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:57:31,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:57:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:31,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-15 17:57:31,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:32,123 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 11 treesize of output 7 [2022-10-15 17:57:32,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:57:32,805 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-10-15 17:57:32,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 13 [2022-10-15 17:57:32,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:32,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:57:32,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763355321] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:32,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:57:32,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2022-10-15 17:57:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201016165] [2022-10-15 17:57:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:32,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:57:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:57:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:57:32,871 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:32,970 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-10-15 17:57:32,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:57:32,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:57:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:32,999 INFO L225 Difference]: With dead ends: 51 [2022-10-15 17:57:33,000 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:57:33,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2022-10-15 17:57:33,003 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:33,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 147 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2022-10-15 17:57:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:57:33,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:57:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-10-15 17:57:33,010 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 22 [2022-10-15 17:57:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-10-15 17:57:33,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-10-15 17:57:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:57:33,014 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:33,014 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] [2022-10-15 17:57:33,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:57:33,229 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,SelfDestructingSolverStorable12 [2022-10-15 17:57:33,230 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1699785280, now seen corresponding path program 1 times [2022-10-15 17:57:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:33,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663144760] [2022-10-15 17:57:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:33,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663144760] [2022-10-15 17:57:33,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663144760] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:33,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478732287] [2022-10-15 17:57:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:33,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:33,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:57:33,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:57:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:33,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 17:57:33,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:33,772 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 10 treesize of output 8 [2022-10-15 17:57:33,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:57:33,848 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-15 17:57:34,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:34,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-10-15 17:57:34,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:34,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:57:34,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncmp_~s1#1.offset_13| Int) (v_ArrVal_141 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrncmp_~s1#1.offset_13| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_141) |c_ULTIMATE.start_main_~nondetString1~0#1.base|) |v_ULTIMATE.start_cstrncmp_~s1#1.offset_13|) 0) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrncmp_~s1#1.offset_13|) (not (<= 0 |v_ULTIMATE.start_cstrncmp_~s1#1.offset_13|)))) is different from false [2022-10-15 17:57:34,677 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:34,678 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-15 17:57:34,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:34,696 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 33 treesize of output 34 [2022-10-15 17:57:34,711 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-15 17:57:34,731 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 9 treesize of output 7 [2022-10-15 17:57:34,865 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 10 treesize of output 8 [2022-10-15 17:57:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:34,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478732287] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:57:34,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:57:34,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 23 [2022-10-15 17:57:34,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394616358] [2022-10-15 17:57:34,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:57:34,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 17:57:34,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:34,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 17:57:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=439, Unknown=1, NotChecked=42, Total=552 [2022-10-15 17:57:34,884 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 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-15 17:57:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:35,310 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-10-15 17:57:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:57:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 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) Word has length 22 [2022-10-15 17:57:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:35,311 INFO L225 Difference]: With dead ends: 54 [2022-10-15 17:57:35,312 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 17:57:35,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=648, Unknown=1, NotChecked=52, Total=812 [2022-10-15 17:57:35,314 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 32 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:35,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 255 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-10-15 17:57:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 17:57:35,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-10-15 17:57:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 47 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-15 17:57:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-15 17:57:35,326 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2022-10-15 17:57:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:35,327 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-15 17:57:35,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 24 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-15 17:57:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-15 17:57:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:57:35,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:35,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:35,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-10-15 17:57:35,542 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,SelfDestructingSolverStorable13 [2022-10-15 17:57:35,543 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1153736107, now seen corresponding path program 1 times [2022-10-15 17:57:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:35,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389421446] [2022-10-15 17:57:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:36,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389421446] [2022-10-15 17:57:36,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389421446] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:36,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089131139] [2022-10-15 17:57:36,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:36,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:36,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:36,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:57:36,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:57:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:36,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 17:57:36,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:36,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:57:36,826 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-10-15 17:57:36,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2022-10-15 17:57:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:37,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:57:37,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:37,564 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 91 treesize of output 91 [2022-10-15 17:57:37,577 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-15 17:57:37,607 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 32 treesize of output 30 [2022-10-15 17:57:37,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:37,626 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 49 treesize of output 49 [2022-10-15 17:57:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:37,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089131139] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:57:37,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:57:37,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-10-15 17:57:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412586940] [2022-10-15 17:57:37,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:57:37,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 17:57:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 17:57:37,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:57:37,654 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 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-15 17:57:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:38,347 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2022-10-15 17:57:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:57:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 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) Word has length 23 [2022-10-15 17:57:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:38,348 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:57:38,348 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 17:57:38,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 17:57:38,350 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:38,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 218 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2022-10-15 17:57:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 17:57:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-10-15 17:57:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.146341463414634) internal successors, (47), 45 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-10-15 17:57:38,354 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 23 [2022-10-15 17:57:38,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:38,354 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-10-15 17:57:38,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 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-15 17:57:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-10-15 17:57:38,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 17:57:38,356 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:38,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:38,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:57:38,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:38,570 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:38,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2077213877, now seen corresponding path program 2 times [2022-10-15 17:57:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:38,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476609055] [2022-10-15 17:57:38,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:39,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:39,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476609055] [2022-10-15 17:57:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476609055] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:39,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784795808] [2022-10-15 17:57:39,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:57:39,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:39,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:39,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:57:39,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:57:39,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:57:39,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:57:39,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-15 17:57:39,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:39,435 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 10 treesize of output 8 [2022-10-15 17:57:39,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:57:39,520 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-15 17:57:40,240 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-10-15 17:57:40,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 29 [2022-10-15 17:57:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:57:41,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (= (select .cse0 (+ |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|)) (= (select .cse0 |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|) 0) (<= (+ |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|)))) is different from false [2022-10-15 17:57:41,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:41,058 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 45 treesize of output 34 [2022-10-15 17:57:41,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:41,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 65 [2022-10-15 17:57:41,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-10-15 17:57:41,105 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-15 17:57:41,204 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 10 treesize of output 8 [2022-10-15 17:57:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784795808] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:57:41,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:57:41,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 31 [2022-10-15 17:57:41,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948853888] [2022-10-15 17:57:41,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:57:41,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-15 17:57:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:41,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-15 17:57:41,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=828, Unknown=1, NotChecked=58, Total=992 [2022-10-15 17:57:41,224 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:42,122 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-10-15 17:57:42,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:57:42,122 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 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 32 [2022-10-15 17:57:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:42,123 INFO L225 Difference]: With dead ends: 48 [2022-10-15 17:57:42,123 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 17:57:42,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=241, Invalid=1568, Unknown=1, NotChecked=82, Total=1892 [2022-10-15 17:57:42,125 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:42,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 324 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 66 Unchecked, 0.0s Time] [2022-10-15 17:57:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 17:57:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-10-15 17:57:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-10-15 17:57:42,129 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 32 [2022-10-15 17:57:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:42,129 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-10-15 17:57:42,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.806451612903226) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-10-15 17:57:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 17:57:42,131 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:42,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:42,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:57:42,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:57:42,335 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:42,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash 30879232, now seen corresponding path program 2 times [2022-10-15 17:57:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:42,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960982938] [2022-10-15 17:57:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:43,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960982938] [2022-10-15 17:57:43,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960982938] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:43,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624858326] [2022-10-15 17:57:43,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:57:43,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:43,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:43,215 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-15 17:57:43,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-15 17:57:43,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:57:43,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:57:43,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 35 conjunts are in the unsatisfiable core [2022-10-15 17:57:43,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:43,334 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:57:43,335 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 17:57:43,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:57:44,170 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-10-15 17:57:44,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2022-10-15 17:57:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:44,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:57:45,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:45,699 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 91 treesize of output 91 [2022-10-15 17:57:45,740 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 32 treesize of output 30 [2022-10-15 17:57:45,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:57:45,756 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 49 treesize of output 49 [2022-10-15 17:57:45,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:57:45,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624858326] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:57:45,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:57:45,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2022-10-15 17:57:45,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585362481] [2022-10-15 17:57:45,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:57:45,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-10-15 17:57:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-10-15 17:57:45,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1122, Unknown=0, NotChecked=0, Total=1260 [2022-10-15 17:57:45,846 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:47,424 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-10-15 17:57:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-15 17:57:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 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 33 [2022-10-15 17:57:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:47,426 INFO L225 Difference]: With dead ends: 50 [2022-10-15 17:57:47,427 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 17:57:47,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=375, Invalid=2705, Unknown=0, NotChecked=0, Total=3080 [2022-10-15 17:57:47,435 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:47,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 302 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-10-15 17:57:47,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 17:57:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-10-15 17:57:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2022-10-15 17:57:47,453 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 33 [2022-10-15 17:57:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:47,453 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2022-10-15 17:57:47,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4857142857142858) internal successors, (87), 36 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-10-15 17:57:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 17:57:47,455 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:47,455 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:47,487 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-15 17:57:47,660 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,SelfDestructingSolverStorable16 [2022-10-15 17:57:47,662 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash 30888283, now seen corresponding path program 1 times [2022-10-15 17:57:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:47,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555749226] [2022-10-15 17:57:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:57:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555749226] [2022-10-15 17:57:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555749226] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:57:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431332625] [2022-10-15 17:57:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:57:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:57:47,825 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-15 17:57:47,828 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-15 17:57:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:57:47,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:57:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:57:47,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:57:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:57:48,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431332625] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:57:48,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:57:48,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-10-15 17:57:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438531267] [2022-10-15 17:57:48,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:57:48,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:57:48,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:48,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:57:48,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:57:48,011 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:48,059 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-10-15 17:57:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:57:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 33 [2022-10-15 17:57:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:48,060 INFO L225 Difference]: With dead ends: 43 [2022-10-15 17:57:48,061 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 17:57:48,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:57:48,062 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:48,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 82 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 17:57:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-15 17:57:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.075) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-10-15 17:57:48,065 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 33 [2022-10-15 17:57:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:48,067 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-10-15 17:57:48,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-10-15 17:57:48,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 17:57:48,072 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:48,072 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:48,122 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-15 17:57:48,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 17:57:48,288 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash 800181507, now seen corresponding path program 1 times [2022-10-15 17:57:48,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:48,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074285747] [2022-10-15 17:57:48,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:48,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-10-15 17:57:48,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:48,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074285747] [2022-10-15 17:57:48,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074285747] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:48,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:48,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618885972] [2022-10-15 17:57:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:48,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:48,368 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:48,382 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-10-15 17:57:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 36 [2022-10-15 17:57:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:48,384 INFO L225 Difference]: With dead ends: 41 [2022-10-15 17:57:48,384 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 17:57:48,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:48,386 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:48,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 25 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 17:57:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-10-15 17:57:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-10-15 17:57:48,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2022-10-15 17:57:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:48,392 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-10-15 17:57:48,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-10-15 17:57:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 17:57:48,394 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:57:48,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:48,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 17:57:48,395 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:57:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:57:48,396 INFO L85 PathProgramCache]: Analyzing trace with hash 175282628, now seen corresponding path program 1 times [2022-10-15 17:57:48,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:57:48,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680669271] [2022-10-15 17:57:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:57:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:57:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:57:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 17:57:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:57:48,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680669271] [2022-10-15 17:57:48,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680669271] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:57:48,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:57:48,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:57:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625060076] [2022-10-15 17:57:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:57:48,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:57:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:57:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:57:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:48,466 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:57:48,483 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-10-15 17:57:48,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:57:48,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-10-15 17:57:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:57:48,484 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:57:48,485 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:57:48,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:57:48,486 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:57:48,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:57:48,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:57:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:57:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:57:48,492 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-10-15 17:57:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:57:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:57:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:57:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:57:48,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:57:48,496 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-10-15 17:57:48,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-10-15 17:57:48,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-10-15 17:57:48,497 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-10-15 17:57:48,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-10-15 17:57:48,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-10-15 17:57:48,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-10-15 17:57:48,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-10-15 17:57:48,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2022-10-15 17:57:48,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2022-10-15 17:57:48,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2022-10-15 17:57:48,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2022-10-15 17:57:48,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2022-10-15 17:57:48,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2022-10-15 17:57:48,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-10-15 17:57:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 17:57:48,504 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:57:48,508 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:57:48,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:57:48 BoogieIcfgContainer [2022-10-15 17:57:48,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:57:48,513 INFO L158 Benchmark]: Toolchain (without parser) took 22579.42ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 124.9MB in the beginning and 225.9MB in the end (delta: -101.0MB). Peak memory consumption was 106.3MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,513 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:57:48,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.50ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 109.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,515 INFO L158 Benchmark]: Boogie Preprocessor took 37.69ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,515 INFO L158 Benchmark]: RCFGBuilder took 863.20ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 123.9MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,516 INFO L158 Benchmark]: TraceAbstraction took 21032.04ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 123.4MB in the beginning and 225.9MB in the end (delta: -102.5MB). Peak memory consumption was 105.6MB. Max. memory is 8.0GB. [2022-10-15 17:57:48,518 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.37ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 570.50ms. Allocated memory is still 151.0MB. Free memory was 124.7MB in the beginning and 109.4MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 151.0MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.69ms. Allocated memory is still 151.0MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 863.20ms. Allocated memory is still 151.0MB. Free memory was 105.8MB in the beginning and 123.9MB in the end (delta: -18.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 21032.04ms. Allocated memory was 151.0MB in the beginning and 357.6MB in the end (delta: 206.6MB). Free memory was 123.4MB in the beginning and 225.9MB in the end (delta: -102.5MB). Peak memory consumption was 105.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 562]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 699 mSDsluCounter, 1968 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 318 IncrementalHoareTripleChecker+Unchecked, 1489 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 479 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 235 SyntacticMatches, 19 SemanticMatches, 227 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=14, InterpolantAutomatonStates: 145, 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, 20 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 662 ConstructedInterpolants, 95 QuantifiedInterpolants, 8217 SizeOfPredicates, 84 NumberOfNonLiveVariables, 921 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 31 InterpolantComputations, 15 PerfectInterpolantSequences, 116/229 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:57:48,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...