/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-15/cstrpbrk_diffterm_alloca.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:53:36,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:53:36,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:53:36,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:53:36,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:53:36,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:53:36,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:53:36,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:53:36,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:53:36,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:53:36,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:53:36,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:53:36,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:53:36,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:53:36,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:53:36,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:53:36,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:53:36,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:53:36,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:53:36,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:53:36,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:53:36,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:53:36,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:53:36,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:53:36,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:53:36,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:53:36,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:53:36,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:53:36,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:53:36,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:53:36,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:53:36,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:53:36,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:53:36,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:53:36,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:53:36,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:53:36,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:53:36,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:53:36,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:53:36,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:53:36,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:53:36,256 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:53:36,294 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:53:36,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:53:36,295 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:53:36,295 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:53:36,296 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:53:36,296 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:53:36,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:53:36,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:53:36,297 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:53:36,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:53:36,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:53:36,298 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:53:36,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:53:36,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:53:36,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:53:36,299 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:53:36,299 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:53:36,299 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:53:36,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:53:36,300 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:53:36,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:53:36,300 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:53:36,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:53:36,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:53:36,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:53:36,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:36,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:53:36,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:53:36,301 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:53:36,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:53:36,302 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:53:36,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:53:36,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:53:36,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:53:36,723 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:53:36,724 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:53:36,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2022-10-15 17:53:36,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29711b902/e9b3e3b394b444eba45c24b782b49571/FLAG8f7267cac [2022-10-15 17:53:37,571 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:53:37,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2022-10-15 17:53:37,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29711b902/e9b3e3b394b444eba45c24b782b49571/FLAG8f7267cac [2022-10-15 17:53:37,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29711b902/e9b3e3b394b444eba45c24b782b49571 [2022-10-15 17:53:37,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:53:37,876 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:53:37,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:37,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:53:37,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:53:37,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:37" (1/1) ... [2022-10-15 17:53:37,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55509be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:37, skipping insertion in model container [2022-10-15 17:53:37,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:37" (1/1) ... [2022-10-15 17:53:37,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:53:37,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:53:38,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:38,387 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:53:38,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:38,496 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:53:38,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38 WrapperNode [2022-10-15 17:53:38,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:38,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:38,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:53:38,499 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:53:38,508 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:53:38" (1/1) ... [2022-10-15 17:53:38,524 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:53:38" (1/1) ... [2022-10-15 17:53:38,552 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-10-15 17:53:38,553 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:38,554 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:53:38,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:53:38,554 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:53:38,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:53:38,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:53:38,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:53:38,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:53:38,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (1/1) ... [2022-10-15 17:53:38,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:38,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:38,630 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:53:38,645 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:53:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:53:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:53:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:53:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:53:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:53:38,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:53:38,887 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:53:38,891 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:53:39,368 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:53:39,385 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:53:39,387 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:53:39,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:39 BoogieIcfgContainer [2022-10-15 17:53:39,389 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:53:39,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:53:39,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:53:39,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:53:39,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:53:37" (1/3) ... [2022-10-15 17:53:39,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127aab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:39, skipping insertion in model container [2022-10-15 17:53:39,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:38" (2/3) ... [2022-10-15 17:53:39,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127aab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:39, skipping insertion in model container [2022-10-15 17:53:39,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:39" (3/3) ... [2022-10-15 17:53:39,409 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca.i [2022-10-15 17:53:39,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:53:39,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-10-15 17:53:39,499 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:53:39,507 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;@64286607, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:53:39,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-10-15 17:53:39,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.92) 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:53:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:39,519 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:39,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:39,520 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:53:39,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2022-10-15 17:53:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:39,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752195131] [2022-10-15 17:53:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:39,963 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:53:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:39,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752195131] [2022-10-15 17:53:39,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752195131] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:39,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:39,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273126490] [2022-10-15 17:53:39,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:39,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:40,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:40,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:40,022 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.92) 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) 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:53:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:40,092 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-10-15 17:53:40,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:40,096 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:53:40,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:40,106 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:53:40,106 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:53:40,108 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:53:40,113 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 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:53:40,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:53:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:53:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-10-15 17:53:40,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2022-10-15 17:53:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:40,167 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-10-15 17:53:40,168 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:53:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-10-15 17:53:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:40,168 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:40,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:40,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:53:40,169 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:53:40,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2022-10-15 17:53:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:40,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218749169] [2022-10-15 17:53:40,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:40,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:40,513 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:53:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:40,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218749169] [2022-10-15 17:53:40,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218749169] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:40,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:40,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960859994] [2022-10-15 17:53:40,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:40,518 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:40,741 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-10-15 17:53:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:53:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:40,747 INFO L225 Difference]: With dead ends: 72 [2022-10-15 17:53:40,747 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 17:53:40,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:40,756 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 109 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:40,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 122 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 17:53:40,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 41. [2022-10-15 17:53:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 40 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:53:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-10-15 17:53:40,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2022-10-15 17:53:40,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:40,780 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-10-15 17:53:40,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-10-15 17:53:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:40,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:40,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:40,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:53:40,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2022-10-15 17:53:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:40,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189008085] [2022-10-15 17:53:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:40,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:40,965 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:53:40,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:40,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189008085] [2022-10-15 17:53:40,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189008085] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:40,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:40,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:40,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470729639] [2022-10-15 17:53:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:40,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:40,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:40,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:40,970 INFO L87 Difference]: Start difference. First operand 41 states and 47 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:53:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,008 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-10-15 17:53:41,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:41,009 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:53:41,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,010 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:53:41,010 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 17:53:41,010 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:53:41,012 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:41,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 17:53:41,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-10-15 17:53:41,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.75) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-10-15 17:53:41,019 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2022-10-15 17:53:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-10-15 17:53:41,020 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:53:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-10-15 17:53:41,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:41,021 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:53:41,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2022-10-15 17:53:41,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860945177] [2022-10-15 17:53:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,078 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:53:41,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860945177] [2022-10-15 17:53:41,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860945177] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:41,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:41,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:41,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076307547] [2022-10-15 17:53:41,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:41,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:41,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:41,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:41,082 INFO L87 Difference]: Start difference. First operand 37 states and 42 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:53:41,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,117 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-10-15 17:53:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:41,119 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:53:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,120 INFO L225 Difference]: With dead ends: 36 [2022-10-15 17:53:41,120 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:41,121 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:53:41,122 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 30 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:53:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.7083333333333333) 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:53:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-10-15 17:53:41,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2022-10-15 17:53:41,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,129 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-10-15 17:53:41,129 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:53:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-10-15 17:53:41,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:41,130 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:53:41,131 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2022-10-15 17:53:41,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489293826] [2022-10-15 17:53:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,271 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:53:41,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489293826] [2022-10-15 17:53:41,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489293826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:41,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:41,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87043176] [2022-10-15 17:53:41,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:41,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:41,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:41,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:41,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:41,277 INFO L87 Difference]: Start difference. First operand 36 states and 41 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:53:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,324 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-10-15 17:53:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:41,325 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:53:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,326 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:53:41,326 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:53:41,326 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:53:41,344 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 32 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:53:41,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:53:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:53:41,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-10-15 17:53:41,351 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2022-10-15 17:53:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,351 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-10-15 17:53:41,351 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:53:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-10-15 17:53:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:53:41,352 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:53:41,353 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:53:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2022-10-15 17:53:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214962659] [2022-10-15 17:53:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,417 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:53:41,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214962659] [2022-10-15 17:53:41,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214962659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:41,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415966289] [2022-10-15 17:53:41,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:41,421 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,482 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-10-15 17:53:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:41,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 17:53:41,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,487 INFO L225 Difference]: With dead ends: 33 [2022-10-15 17:53:41,488 INFO L226 Difference]: Without dead ends: 33 [2022-10-15 17:53:41,488 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:53:41,491 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 51 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:41,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 30 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-15 17:53:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-15 17:53:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 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:53:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-10-15 17:53:41,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2022-10-15 17:53:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,509 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-10-15 17:53:41,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-10-15 17:53:41,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:53:41,511 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:53:41,512 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:53:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2022-10-15 17:53:41,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326817590] [2022-10-15 17:53:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,748 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:53:41,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326817590] [2022-10-15 17:53:41,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326817590] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:41,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:41,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:53:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103918469] [2022-10-15 17:53:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:53:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:53:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:41,752 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,855 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-10-15 17:53:41,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:41,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-15 17:53:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,858 INFO L225 Difference]: With dead ends: 56 [2022-10-15 17:53:41,858 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 17:53:41,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:41,860 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 193 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:41,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 17:53:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 36. [2022-10-15 17:53:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-10-15 17:53:41,865 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 9 [2022-10-15 17:53:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,866 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-10-15 17:53:41,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,866 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-10-15 17:53:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:41,867 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:53:41,868 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144940, now seen corresponding path program 1 times [2022-10-15 17:53:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334891443] [2022-10-15 17:53:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,951 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:53:41,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334891443] [2022-10-15 17:53:41,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334891443] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:41,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:41,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991592945] [2022-10-15 17:53:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:41,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:41,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:41,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:41,955 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:42,018 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-10-15 17:53:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:42,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:42,020 INFO L225 Difference]: With dead ends: 35 [2022-10-15 17:53:42,020 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:53:42,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:42,021 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 64 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:42,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 37 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:53:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-10-15 17:53:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 32 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:53:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-10-15 17:53:42,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 13 [2022-10-15 17:53:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:42,027 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-10-15 17:53:42,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:53:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-10-15 17:53:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:42,028 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:42,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:42,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:53:42,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:42,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144939, now seen corresponding path program 1 times [2022-10-15 17:53:42,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:42,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530739358] [2022-10-15 17:53:42,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:42,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:42,207 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:53:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:42,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530739358] [2022-10-15 17:53:42,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530739358] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:42,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:42,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:53:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171961605] [2022-10-15 17:53:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:42,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:53:42,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:42,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:53:42,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:42,210 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:53:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:42,292 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-10-15 17:53:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:53:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:53:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:42,294 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:53:42,294 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 17:53:42,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:53:42,295 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 173 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:42,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 55 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 17:53:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-10-15 17:53:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-10-15 17:53:42,300 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 13 [2022-10-15 17:53:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:42,300 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-10-15 17:53:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:53:42,301 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-10-15 17:53:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:42,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:42,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:42,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:53:42,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:42,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:42,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1693161859, now seen corresponding path program 1 times [2022-10-15 17:53:42,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:42,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280805821] [2022-10-15 17:53:42,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:42,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:42,442 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:53:42,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:42,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280805821] [2022-10-15 17:53:42,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280805821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:42,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:42,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593931966] [2022-10-15 17:53:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:42,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:42,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:42,446 INFO L87 Difference]: Start difference. First operand 40 states and 48 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:53:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:42,470 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-10-15 17:53:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:42,471 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:53:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:42,472 INFO L225 Difference]: With dead ends: 39 [2022-10-15 17:53:42,472 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:42,472 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:53:42,473 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 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:53:42,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-10-15 17:53:42,477 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 13 [2022-10-15 17:53:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:42,478 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-10-15 17:53:42,478 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:53:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-10-15 17:53:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:53:42,479 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:42,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:42,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:53:42,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash 950889964, now seen corresponding path program 1 times [2022-10-15 17:53:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:42,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114302076] [2022-10-15 17:53:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:42,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:42,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:42,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114302076] [2022-10-15 17:53:42,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114302076] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:42,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:42,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021293841] [2022-10-15 17:53:42,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:42,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:42,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:42,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:42,518 INFO L87 Difference]: Start difference. First operand 36 states and 42 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:53:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:42,526 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-10-15 17:53:42,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:42,527 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:53:42,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:42,528 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:53:42,528 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:53:42,528 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:53:42,529 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:42,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:53:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:53:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 37 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:53:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-10-15 17:53:42,534 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2022-10-15 17:53:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:42,534 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-10-15 17:53:42,534 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:53:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-10-15 17:53:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 17:53:42,535 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:42,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:53:42,536 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:42,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1028637879, now seen corresponding path program 1 times [2022-10-15 17:53:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:42,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744037045] [2022-10-15 17:53:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:42,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:43,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744037045] [2022-10-15 17:53:43,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744037045] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:43,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:43,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:53:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467733883] [2022-10-15 17:53:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:43,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:53:43,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:43,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:53:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:43,039 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:43,121 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-10-15 17:53:43,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:53:43,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 17:53:43,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:43,123 INFO L225 Difference]: With dead ends: 45 [2022-10-15 17:53:43,123 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:53:43,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:53:43,124 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:43,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:43,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:53:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:53:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-10-15 17:53:43,130 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2022-10-15 17:53:43,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:43,131 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-10-15 17:53:43,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-10-15 17:53:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 17:53:43,132 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:43,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:43,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:53:43,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:43,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1677981515, now seen corresponding path program 1 times [2022-10-15 17:53:43,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:43,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591100536] [2022-10-15 17:53:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:43,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:43,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:43,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591100536] [2022-10-15 17:53:43,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591100536] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:43,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:43,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 17:53:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686230394] [2022-10-15 17:53:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:43,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 17:53:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 17:53:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:53:43,499 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:43,668 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-10-15 17:53:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 17:53:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 17:53:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:43,669 INFO L225 Difference]: With dead ends: 58 [2022-10-15 17:53:43,669 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 17:53:43,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:53:43,671 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 52 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:43,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 146 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 17:53:43,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-10-15 17:53:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-10-15 17:53:43,675 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2022-10-15 17:53:43,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:43,676 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-10-15 17:53:43,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-10-15 17:53:43,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 17:53:43,677 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:43,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:43,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:53:43,678 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 656913161, now seen corresponding path program 1 times [2022-10-15 17:53:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:43,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874188385] [2022-10-15 17:53:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:44,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874188385] [2022-10-15 17:53:44,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874188385] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:44,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492573366] [2022-10-15 17:53:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:44,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:44,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:44,125 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:53:44,148 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:53:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:44,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 27 conjunts are in the unsatisfiable core [2022-10-15 17:53:44,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:44,321 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:53:44,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:44,677 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:53:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:44,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:45,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:53:45,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-10-15 17:53:45,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-10-15 17:53:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492573366] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:45,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:45,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2022-10-15 17:53:45,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147169831] [2022-10-15 17:53:45,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:45,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 17:53:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:45,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 17:53:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2022-10-15 17:53:45,340 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 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:53:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:45,824 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-10-15 17:53:45,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:53:45,825 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 17:53:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:45,826 INFO L225 Difference]: With dead ends: 86 [2022-10-15 17:53:45,826 INFO L226 Difference]: Without dead ends: 86 [2022-10-15 17:53:45,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:53:45,828 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 64 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:45,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 219 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 271 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-10-15 17:53:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-10-15 17:53:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 54. [2022-10-15 17:53:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 17:53:45,832 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 19 [2022-10-15 17:53:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:45,833 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 17:53:45,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 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:53:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 17:53:45,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:53:45,834 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:45,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:45,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 17:53:46,035 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,SelfDestructingSolverStorable13 [2022-10-15 17:53:46,036 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 658274998, now seen corresponding path program 1 times [2022-10-15 17:53:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:46,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833081757] [2022-10-15 17:53:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:46,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:46,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833081757] [2022-10-15 17:53:46,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833081757] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:46,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:46,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-15 17:53:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373321077] [2022-10-15 17:53:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:46,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:53:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:46,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:53:46,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:53:46,171 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:53:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:46,331 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-10-15 17:53:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:53:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:53:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:46,332 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:53:46,332 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:53:46,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:53:46,333 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:46,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 77 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:53:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:53:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.15625) internal successors, (37), 34 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:53:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-10-15 17:53:46,336 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 20 [2022-10-15 17:53:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:46,337 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-10-15 17:53:46,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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:53:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-10-15 17:53:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:46,338 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:46,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:46,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:53:46,339 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:53:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2067169221, now seen corresponding path program 1 times [2022-10-15 17:53:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:46,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557851314] [2022-10-15 17:53:46,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:47,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557851314] [2022-10-15 17:53:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557851314] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:47,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334212027] [2022-10-15 17:53:47,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:47,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:47,330 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:53:47,351 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:53:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:47,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-15 17:53:47,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:47,438 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:53:47,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-10-15 17:53:47,483 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:53:47,541 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:53:48,450 INFO L356 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-10-15 17:53:48,451 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 33 treesize of output 51 [2022-10-15 17:53:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:48,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:49,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_cstrpbrk_~s~0#1.offset| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_14| Int) (v_ArrVal_156 (Array Int Int)) (|ULTIMATE.start_cstrpbrk_~s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_156))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (or (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_14|) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_14| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_14|)) (not (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.base|) |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_14|))) (= 49 .cse0))))) is different from false [2022-10-15 17:53:49,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:49,545 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 62 treesize of output 40 [2022-10-15 17:53:49,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:49,580 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 103 treesize of output 114 [2022-10-15 17:53:49,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:49,603 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 64 treesize of output 62 [2022-10-15 17:53:50,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:53:50,169 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:53:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334212027] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:50,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 41 [2022-10-15 17:53:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099654629] [2022-10-15 17:53:50,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:50,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-15 17:53:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:50,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-15 17:53:50,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1446, Unknown=1, NotChecked=78, Total=1722 [2022-10-15 17:53:50,213 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 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:53:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:50,596 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-10-15 17:53:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:53:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 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:53:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:50,597 INFO L225 Difference]: With dead ends: 42 [2022-10-15 17:53:50,598 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 17:53:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=223, Invalid=1672, Unknown=1, NotChecked=84, Total=1980 [2022-10-15 17:53:50,600 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:50,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 147 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2022-10-15 17:53:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 17:53:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-10-15 17:53:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-10-15 17:53:50,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2022-10-15 17:53:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:50,603 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-10-15 17:53:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 42 states have internal predecessors, (60), 0 states have call successors, (0), 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:53:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-10-15 17:53:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 17:53:50,604 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:50,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:50,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:50,818 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,SelfDestructingSolverStorable15 [2022-10-15 17:53:50,819 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:50,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1423532355, now seen corresponding path program 2 times [2022-10-15 17:53:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:50,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954077843] [2022-10-15 17:53:50,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954077843] [2022-10-15 17:53:51,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954077843] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:51,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571554892] [2022-10-15 17:53:51,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:53:51,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:51,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:51,373 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:53:51,388 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:53:51,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:53:51,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:53:51,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 17:53:51,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:51,460 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:53:51,461 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:53:51,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 17:53:51,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:51,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-10-15 17:53:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:51,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:52,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-10-15 17:53:52,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-10-15 17:53:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:52,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571554892] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:52,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:52,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 27 [2022-10-15 17:53:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268704012] [2022-10-15 17:53:52,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:52,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 17:53:52,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 17:53:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-10-15 17:53:52,497 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:53,987 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-10-15 17:53:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-10-15 17:53:53,988 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 17:53:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:53,988 INFO L225 Difference]: With dead ends: 75 [2022-10-15 17:53:53,988 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 17:53:53,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=449, Invalid=1621, Unknown=0, NotChecked=0, Total=2070 [2022-10-15 17:53:53,990 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 385 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:53,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 148 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 259 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2022-10-15 17:53:53,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 17:53:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 36. [2022-10-15 17:53:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) 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:53:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-10-15 17:53:53,993 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2022-10-15 17:53:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:53,994 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-10-15 17:53:53,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-10-15 17:53:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:53:53,995 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:53,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:54,026 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:53:54,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:54,211 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:54,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 53512199, now seen corresponding path program 1 times [2022-10-15 17:53:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:54,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546806511] [2022-10-15 17:53:54,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:54,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 17:53:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:54,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546806511] [2022-10-15 17:53:54,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546806511] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:54,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247120702] [2022-10-15 17:53:54,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:54,619 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:53:54,647 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:53:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:54,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 48 conjunts are in the unsatisfiable core [2022-10-15 17:53:54,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:54,731 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:53:54,731 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:53:54,742 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:53:54,776 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:53:54,827 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:53:55,558 INFO L356 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-10-15 17:53:55,559 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 33 treesize of output 51 [2022-10-15 17:53:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:55,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:56,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_cstrpbrk_~s~0#1.offset| Int) (v_ArrVal_203 (Array Int Int)) (|ULTIMATE.start_cstrpbrk_~s~0#1.base| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_18| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_203))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.base|) |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_18|))) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_18|) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_18|)) (= .cse0 49) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_18| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)))))) is different from false [2022-10-15 17:53:56,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:56,355 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 62 treesize of output 40 [2022-10-15 17:53:56,378 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:56,379 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 103 treesize of output 114 [2022-10-15 17:53:56,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:56,396 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 64 treesize of output 62 [2022-10-15 17:53:56,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:53:56,709 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:53:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:56,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247120702] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:56,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:56,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 33 [2022-10-15 17:53:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627930842] [2022-10-15 17:53:56,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:56,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-15 17:53:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:56,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-15 17:53:56,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=906, Unknown=1, NotChecked=62, Total=1122 [2022-10-15 17:53:56,731 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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:53:57,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:57,343 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-10-15 17:53:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 17:53:57,344 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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 28 [2022-10-15 17:53:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:57,344 INFO L225 Difference]: With dead ends: 58 [2022-10-15 17:53:57,344 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 17:53:57,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=326, Invalid=1569, Unknown=1, NotChecked=84, Total=1980 [2022-10-15 17:53:57,347 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:57,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 217 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2022-10-15 17:53:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 17:53:57,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-10-15 17:53:57,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) 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:53:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-10-15 17:53:57,349 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 28 [2022-10-15 17:53:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:57,350 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-10-15 17:53:57,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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:53:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-10-15 17:53:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 17:53:57,351 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:57,351 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:57,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-10-15 17:53:57,563 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,SelfDestructingSolverStorable17 [2022-10-15 17:53:57,564 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-10-15 17:53:57,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -587507249, now seen corresponding path program 2 times [2022-10-15 17:53:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:57,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069067718] [2022-10-15 17:53:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:58,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:58,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069067718] [2022-10-15 17:53:58,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069067718] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:58,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840059781] [2022-10-15 17:53:58,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:53:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:58,696 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:53:58,719 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:53:58,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:53:58,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:53:58,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-15 17:53:58,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:58,791 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:53:58,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11 [2022-10-15 17:53:58,824 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 15 treesize of output 11 [2022-10-15 17:53:58,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-15 17:53:59,452 INFO L356 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-10-15 17:53:59,453 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 34 treesize of output 51 [2022-10-15 17:53:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:59,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:54:01,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:54:01,317 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 62 treesize of output 40 [2022-10-15 17:54:01,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:54:01,342 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 103 treesize of output 114 [2022-10-15 17:54:01,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:54:01,358 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 64 treesize of output 62 [2022-10-15 17:54:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:54:01,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840059781] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:54:01,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:54:01,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 46 [2022-10-15 17:54:01,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675653219] [2022-10-15 17:54:01,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:54:01,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-10-15 17:54:01,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:54:01,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-10-15 17:54:01,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1921, Unknown=16, NotChecked=0, Total=2162 [2022-10-15 17:54:01,679 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 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:54:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:54:05,107 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-10-15 17:54:05,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-10-15 17:54:05,108 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 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 35 [2022-10-15 17:54:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:54:05,108 INFO L225 Difference]: With dead ends: 61 [2022-10-15 17:54:05,109 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:54:05,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=993, Invalid=6129, Unknown=18, NotChecked=0, Total=7140 [2022-10-15 17:54:05,113 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 192 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 187 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:54:05,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 262 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 858 Invalid, 0 Unknown, 187 Unchecked, 0.7s Time] [2022-10-15 17:54:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:54:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:54:05,115 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:54:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:54:05,115 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-10-15 17:54:05,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:54:05,115 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:54:05,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 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:54:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:54:05,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:54:05,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-10-15 17:54:05,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-10-15 17:54:05,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-10-15 17:54:05,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-10-15 17:54:05,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-10-15 17:54:05,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-10-15 17:54:05,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-10-15 17:54:05,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-10-15 17:54:05,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2022-10-15 17:54:05,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2022-10-15 17:54:05,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2022-10-15 17:54:05,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2022-10-15 17:54:05,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2022-10-15 17:54:05,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2022-10-15 17:54:05,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-10-15 17:54:05,160 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:54:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:54:05,340 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:54:05,344 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:54:05,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:54:05 BoogieIcfgContainer [2022-10-15 17:54:05,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:54:05,348 INFO L158 Benchmark]: Toolchain (without parser) took 27478.41ms. Allocated memory was 163.6MB in the beginning and 380.6MB in the end (delta: 217.1MB). Free memory was 137.2MB in the beginning and 205.8MB in the end (delta: -68.6MB). Peak memory consumption was 149.6MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,348 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 163.6MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:54:05,349 INFO L158 Benchmark]: CACSL2BoogieTranslator took 617.36ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 120.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.69ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 118.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,349 INFO L158 Benchmark]: Boogie Preprocessor took 32.64ms. Allocated memory is still 163.6MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,350 INFO L158 Benchmark]: RCFGBuilder took 802.10ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 139.5MB in the end (delta: -22.8MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,350 INFO L158 Benchmark]: TraceAbstraction took 25950.76ms. Allocated memory was 163.6MB in the beginning and 380.6MB in the end (delta: 217.1MB). Free memory was 139.0MB in the beginning and 205.8MB in the end (delta: -66.9MB). Peak memory consumption was 151.8MB. Max. memory is 8.0GB. [2022-10-15 17:54:05,351 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.29ms. Allocated memory is still 163.6MB. Free memory is still 133.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 617.36ms. Allocated memory is still 163.6MB. Free memory was 137.0MB in the beginning and 120.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.69ms. Allocated memory is still 163.6MB. Free memory was 120.1MB in the beginning and 118.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.64ms. Allocated memory is still 163.6MB. Free memory was 118.1MB in the beginning and 116.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 802.10ms. Allocated memory is still 163.6MB. Free memory was 116.7MB in the beginning and 139.5MB in the end (delta: -22.8MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * TraceAbstraction took 25950.76ms. Allocated memory was 163.6MB in the beginning and 380.6MB in the end (delta: 217.1MB). Free memory was 139.0MB in the beginning and 205.8MB in the end (delta: -66.9MB). Peak memory consumption was 151.8MB. 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: 379]: 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, 41 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1544 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1544 mSDsluCounter, 1853 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 473 IncrementalHoareTripleChecker+Unchecked, 1439 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2204 IncrementalHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 414 mSDtfsCounter, 2204 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 162 SyntacticMatches, 16 SemanticMatches, 313 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2771 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=13, InterpolantAutomatonStates: 186, 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, 19 MinimizatonAttempts, 164 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 522 ConstructedInterpolants, 92 QuantifiedInterpolants, 8713 SizeOfPredicates, 93 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 204 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 29/100 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:54:05,392 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...