/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-dietlibc/build_fullname.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:55:21,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:55:21,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:55:21,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:55:21,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:55:21,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:55:21,512 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:55:21,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:55:21,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:55:21,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:55:21,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:55:21,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:55:21,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:55:21,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:55:21,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:55:21,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:55:21,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:55:21,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:55:21,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:55:21,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:55:21,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:55:21,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:55:21,563 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:55:21,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:55:21,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:55:21,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:55:21,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:55:21,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:55:21,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:55:21,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:55:21,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:55:21,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:55:21,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:55:21,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:55:21,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:55:21,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:55:21,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:55:21,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:55:21,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:55:21,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:55:21,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:55:21,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:55:21,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:55:21,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:55:21,605 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:55:21,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:55:21,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:55:21,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:55:21,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:55:21,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:55:21,607 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:55:21,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:55:21,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:55:21,608 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:55:21,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:55:21,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:55:21,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:55:21,609 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:55:21,609 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:55:21,609 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:55:21,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:55:21,609 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:55:21,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:55:21,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:55:21,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:55:21,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:55:21,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:55:21,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:21,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:55:21,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:55:21,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:55:21,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:55:21,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:55:21,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:55:21,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:55:21,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:55:21,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:55:21,985 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:55:21,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/build_fullname.i [2022-10-15 17:55:22,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a46b924/47f665a9f90048c78725b05346d8c258/FLAG5d4a38917 [2022-10-15 17:55:22,689 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:55:22,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/build_fullname.i [2022-10-15 17:55:22,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a46b924/47f665a9f90048c78725b05346d8c258/FLAG5d4a38917 [2022-10-15 17:55:22,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75a46b924/47f665a9f90048c78725b05346d8c258 [2022-10-15 17:55:23,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:55:23,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:55:23,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:23,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:55:23,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:55:23,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df9ec1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23, skipping insertion in model container [2022-10-15 17:55:23,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,033 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:55:23,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:55:23,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:23,430 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:55:23,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:55:23,512 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:55:23,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23 WrapperNode [2022-10-15 17:55:23,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:55:23,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:23,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:55:23,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:55:23,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,565 INFO L138 Inliner]: procedures = 115, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 107 [2022-10-15 17:55:23,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:55:23,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:55:23,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:55:23,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:55:23,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,630 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:55:23,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:55:23,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:55:23,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:55:23,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (1/1) ... [2022-10-15 17:55:23,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:55:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:23,679 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:55:23,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:55:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2022-10-15 17:55:23,729 INFO L138 BoogieDeclarations]: Found implementation of procedure strcpy [2022-10-15 17:55:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:55:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:55:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 17:55:23,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:55:23,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:55:23,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:55:23,834 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:55:23,837 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:55:24,283 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:55:24,298 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:55:24,298 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 17:55:24,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:24 BoogieIcfgContainer [2022-10-15 17:55:24,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:55:24,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:55:24,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:55:24,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:55:24,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:55:23" (1/3) ... [2022-10-15 17:55:24,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753c590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:24, skipping insertion in model container [2022-10-15 17:55:24,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:55:23" (2/3) ... [2022-10-15 17:55:24,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@753c590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:55:24, skipping insertion in model container [2022-10-15 17:55:24,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:55:24" (3/3) ... [2022-10-15 17:55:24,311 INFO L112 eAbstractionObserver]: Analyzing ICFG build_fullname.i [2022-10-15 17:55:24,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:55:24,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-10-15 17:55:24,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:55:24,405 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;@3e5a0286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:55:24,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-10-15 17:55:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 68 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 17:55:24,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:24,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 17:55:24,420 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:24,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash 925704, now seen corresponding path program 1 times [2022-10-15 17:55:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501064835] [2022-10-15 17:55:24,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:24,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:24,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:24,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501064835] [2022-10-15 17:55:24,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501064835] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:24,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:24,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:24,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911025803] [2022-10-15 17:55:24,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:24,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:24,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:24,661 INFO L87 Difference]: Start difference. First operand has 72 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 68 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:24,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:24,750 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-10-15 17:55:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 17:55:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:24,764 INFO L225 Difference]: With dead ends: 73 [2022-10-15 17:55:24,764 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 17:55:24,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:24,771 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:24,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 17:55:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-10-15 17:55:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 66 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2022-10-15 17:55:24,821 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 4 [2022-10-15 17:55:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:24,821 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2022-10-15 17:55:24,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-10-15 17:55:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:55:24,822 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:24,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:55:24,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:55:24,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash 28695846, now seen corresponding path program 1 times [2022-10-15 17:55:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:24,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209529829] [2022-10-15 17:55:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:24,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:24,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:24,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209529829] [2022-10-15 17:55:24,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209529829] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:24,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:24,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:24,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738030014] [2022-10-15 17:55:24,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:24,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:24,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:24,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:24,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:24,998 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:25,066 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-10-15 17:55:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:25,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-10-15 17:55:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:25,069 INFO L225 Difference]: With dead ends: 69 [2022-10-15 17:55:25,069 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 17:55:25,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:25,071 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:25,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 62 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:25,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 17:55:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-10-15 17:55:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.7142857142857142) internal successors, (72), 65 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:25,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-10-15 17:55:25,082 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 5 [2022-10-15 17:55:25,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:25,083 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-10-15 17:55:25,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,083 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-10-15 17:55:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 17:55:25,084 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:25,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 17:55:25,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:55:25,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2022-10-15 17:55:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:25,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194816469] [2022-10-15 17:55:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:25,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194816469] [2022-10-15 17:55:25,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194816469] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:25,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:25,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:25,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336147470] [2022-10-15 17:55:25,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:25,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:25,277 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:25,348 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2022-10-15 17:55:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-10-15 17:55:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:25,351 INFO L225 Difference]: With dead ends: 68 [2022-10-15 17:55:25,351 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 17:55:25,351 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:55:25,353 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 55 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:25,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 131 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 17:55:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 17:55:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 64 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-10-15 17:55:25,363 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 5 [2022-10-15 17:55:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:25,363 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-10-15 17:55:25,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-10-15 17:55:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:25,365 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:25,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:25,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:55:25,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:25,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1806903783, now seen corresponding path program 1 times [2022-10-15 17:55:25,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:25,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629665141] [2022-10-15 17:55:25,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:25,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:25,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629665141] [2022-10-15 17:55:25,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629665141] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:25,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:25,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:25,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312425847] [2022-10-15 17:55:25,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:25,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:25,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:25,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:25,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:25,444 INFO L87 Difference]: Start difference. First operand 68 states and 75 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:55:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:25,493 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-10-15 17:55:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:25,494 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:55:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:25,495 INFO L225 Difference]: With dead ends: 67 [2022-10-15 17:55:25,495 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 17:55:25,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:25,497 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 49 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:25,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 63 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 17:55:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-10-15 17:55:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 63 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-10-15 17:55:25,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 7 [2022-10-15 17:55:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:25,506 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-10-15 17:55:25,507 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:55:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-10-15 17:55:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:55:25,507 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:25,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:25,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:55:25,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:25,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1806903784, now seen corresponding path program 1 times [2022-10-15 17:55:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:25,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556662411] [2022-10-15 17:55:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:25,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:25,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556662411] [2022-10-15 17:55:25,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556662411] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:25,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:25,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:25,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854746135] [2022-10-15 17:55:25,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:25,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:25,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:25,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:25,718 INFO L87 Difference]: Start difference. First operand 67 states and 74 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:55:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:25,780 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-10-15 17:55:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:25,780 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:55:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:25,782 INFO L225 Difference]: With dead ends: 66 [2022-10-15 17:55:25,782 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 17:55:25,782 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:55:25,784 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:25,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 129 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 17:55:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 17:55:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 62 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2022-10-15 17:55:25,791 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 7 [2022-10-15 17:55:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:25,792 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2022-10-15 17:55:25,792 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:55:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2022-10-15 17:55:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:55:25,793 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:25,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:25,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:55:25,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:25,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1267747560, now seen corresponding path program 1 times [2022-10-15 17:55:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:25,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599688765] [2022-10-15 17:55:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:25,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:26,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599688765] [2022-10-15 17:55:26,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599688765] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:26,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:26,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186401551] [2022-10-15 17:55:26,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:26,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:55:26,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:26,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:55:26,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:55:26,047 INFO L87 Difference]: Start difference. First operand 66 states and 73 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:55:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:26,124 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2022-10-15 17:55:26,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:55:26,125 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:55:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:26,126 INFO L225 Difference]: With dead ends: 62 [2022-10-15 17:55:26,126 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 17:55:26,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:26,130 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:26,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 66 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 17:55:26,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-15 17:55:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-10-15 17:55:26,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 9 [2022-10-15 17:55:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:26,154 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-10-15 17:55:26,154 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:55:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-10-15 17:55:26,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-15 17:55:26,155 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:26,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:55:26,155 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1267747561, now seen corresponding path program 1 times [2022-10-15 17:55:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731639932] [2022-10-15 17:55:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:26,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731639932] [2022-10-15 17:55:26,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731639932] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:26,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:26,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713603291] [2022-10-15 17:55:26,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:26,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:26,493 INFO L87 Difference]: Start difference. First operand 62 states and 69 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:55:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:26,635 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-10-15 17:55:26,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:55:26,636 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:55:26,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:26,637 INFO L225 Difference]: With dead ends: 60 [2022-10-15 17:55:26,637 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 17:55:26,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:26,640 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 86 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:26,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 83 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 17:55:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-10-15 17:55:26,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.5) internal successors, (63), 56 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2022-10-15 17:55:26,648 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 9 [2022-10-15 17:55:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:26,649 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2022-10-15 17:55:26,649 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:55:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-10-15 17:55:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:55:26,650 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:26,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:26,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:55:26,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:26,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1820120372, now seen corresponding path program 1 times [2022-10-15 17:55:26,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:26,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317123792] [2022-10-15 17:55:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:27,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317123792] [2022-10-15 17:55:27,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317123792] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:27,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:27,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 17:55:27,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620789193] [2022-10-15 17:55:27,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:27,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:55:27,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:55:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:55:27,393 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:27,818 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-10-15 17:55:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:55:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:55:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:27,821 INFO L225 Difference]: With dead ends: 89 [2022-10-15 17:55:27,821 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 17:55:27,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:55:27,823 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 173 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:27,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 224 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:55:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 17:55:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2022-10-15 17:55:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 60 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-10-15 17:55:27,831 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 12 [2022-10-15 17:55:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:27,831 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-10-15 17:55:27,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-10-15 17:55:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:55:27,832 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:27,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:27,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:55:27,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash 589162706, now seen corresponding path program 1 times [2022-10-15 17:55:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021947363] [2022-10-15 17:55:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:27,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:27,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021947363] [2022-10-15 17:55:27,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021947363] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:27,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:27,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219748937] [2022-10-15 17:55:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:27,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:27,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:27,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,863 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:27,872 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-10-15 17:55:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:27,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:55:27,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:27,873 INFO L225 Difference]: With dead ends: 64 [2022-10-15 17:55:27,873 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 17:55:27,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,875 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:27,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:27,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 17:55:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 17:55:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.446808510638298) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-10-15 17:55:27,879 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 13 [2022-10-15 17:55:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:27,880 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-10-15 17:55:27,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-10-15 17:55:27,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:27,881 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:27,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:55:27,881 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -756138353, now seen corresponding path program 1 times [2022-10-15 17:55:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:27,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358849565] [2022-10-15 17:55:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358849565] [2022-10-15 17:55:27,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358849565] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:27,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:27,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:55:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007288817] [2022-10-15 17:55:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:27,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:27,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:27,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:27,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,963 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:27,994 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-10-15 17:55:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:27,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:55:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:27,996 INFO L225 Difference]: With dead ends: 63 [2022-10-15 17:55:27,996 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 17:55:27,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:27,997 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:27,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:27,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 17:55:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-10-15 17:55:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.425531914893617) internal successors, (67), 59 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:28,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-10-15 17:55:28,002 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2022-10-15 17:55:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:28,002 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-10-15 17:55:28,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-10-15 17:55:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:55:28,003 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:28,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:55:28,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash -756138352, now seen corresponding path program 1 times [2022-10-15 17:55:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:28,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797455924] [2022-10-15 17:55:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:28,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797455924] [2022-10-15 17:55:28,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797455924] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:28,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:28,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153619162] [2022-10-15 17:55:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:28,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:28,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:28,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:28,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:28,145 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:28,213 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-10-15 17:55:28,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:55:28,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:55:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:28,215 INFO L225 Difference]: With dead ends: 67 [2022-10-15 17:55:28,215 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 17:55:28,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:28,216 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 112 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:28,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 17:55:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-10-15 17:55:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 58 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2022-10-15 17:55:28,220 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 15 [2022-10-15 17:55:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:28,221 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2022-10-15 17:55:28,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2022-10-15 17:55:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:55:28,222 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:28,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:28,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:55:28,223 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1779427391, now seen corresponding path program 1 times [2022-10-15 17:55:28,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:28,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204460407] [2022-10-15 17:55:28,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:28,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:28,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:28,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204460407] [2022-10-15 17:55:28,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204460407] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:28,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:28,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-15 17:55:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068230269] [2022-10-15 17:55:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:28,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-15 17:55:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-15 17:55:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:55:28,871 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,260 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-10-15 17:55:29,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:55:29,261 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 17:55:29,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,262 INFO L225 Difference]: With dead ends: 85 [2022-10-15 17:55:29,262 INFO L226 Difference]: Without dead ends: 85 [2022-10-15 17:55:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:55:29,264 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 224 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:29,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 186 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:55:29,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-10-15 17:55:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-10-15 17:55:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 53 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-10-15 17:55:29,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 16 [2022-10-15 17:55:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,268 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-10-15 17:55:29,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-10-15 17:55:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:29,270 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:55:29,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1810679033, now seen corresponding path program 1 times [2022-10-15 17:55:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995985128] [2022-10-15 17:55:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995985128] [2022-10-15 17:55:29,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995985128] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:29,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:55:29,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007555310] [2022-10-15 17:55:29,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:55:29,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:55:29,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:29,304 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,311 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-10-15 17:55:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:55:29,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,312 INFO L225 Difference]: With dead ends: 58 [2022-10-15 17:55:29,313 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 17:55:29,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:55:29,314 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:29,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:55:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 17:55:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-10-15 17:55:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 54 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-10-15 17:55:29,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 20 [2022-10-15 17:55:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,317 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-10-15 17:55:29,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-10-15 17:55:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:29,319 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:55:29,319 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1774602132, now seen corresponding path program 1 times [2022-10-15 17:55:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844025771] [2022-10-15 17:55:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844025771] [2022-10-15 17:55:29,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844025771] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:29,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218665372] [2022-10-15 17:55:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:29,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:29,389 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,477 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-10-15 17:55:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:55:29,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:29,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,479 INFO L225 Difference]: With dead ends: 69 [2022-10-15 17:55:29,479 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 17:55:29,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:29,480 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:29,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 147 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 17:55:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2022-10-15 17:55:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.411764705882353) internal successors, (72), 61 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-10-15 17:55:29,484 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 20 [2022-10-15 17:55:29,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,484 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-10-15 17:55:29,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-10-15 17:55:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:29,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:55:29,486 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1774602133, now seen corresponding path program 1 times [2022-10-15 17:55:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006227090] [2022-10-15 17:55:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:29,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006227090] [2022-10-15 17:55:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006227090] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:29,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:55:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981112037] [2022-10-15 17:55:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:55:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:55:29,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:29,656 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:29,790 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-10-15 17:55:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:55:29,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:29,791 INFO L225 Difference]: With dead ends: 75 [2022-10-15 17:55:29,791 INFO L226 Difference]: Without dead ends: 75 [2022-10-15 17:55:29,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:55:29,793 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 131 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:29,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-15 17:55:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-10-15 17:55:29,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 63 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-10-15 17:55:29,796 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 20 [2022-10-15 17:55:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:29,797 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-10-15 17:55:29,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-10-15 17:55:29,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:29,798 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:29,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:29,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:55:29,799 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting strcpyErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:29,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:29,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1827108187, now seen corresponding path program 1 times [2022-10-15 17:55:29,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:29,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838043663] [2022-10-15 17:55:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:29,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:29,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838043663] [2022-10-15 17:55:29,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838043663] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:29,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:29,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:55:29,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630649774] [2022-10-15 17:55:29,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:29,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:55:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:29,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:55:29,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:29,911 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:30,015 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-10-15 17:55:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:55:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:30,016 INFO L225 Difference]: With dead ends: 70 [2022-10-15 17:55:30,016 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 17:55:30,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:55:30,017 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:30,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 174 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:30,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 17:55:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-10-15 17:55:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 62 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2022-10-15 17:55:30,021 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 20 [2022-10-15 17:55:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:30,021 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2022-10-15 17:55:30,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2022-10-15 17:55:30,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:55:30,022 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:30,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:30,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 17:55:30,023 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:30,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1827108186, now seen corresponding path program 1 times [2022-10-15 17:55:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:30,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101969841] [2022-10-15 17:55:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:30,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:30,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101969841] [2022-10-15 17:55:30,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101969841] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:30,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:30,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:55:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759717756] [2022-10-15 17:55:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:30,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 17:55:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 17:55:30,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:55:30,270 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:30,450 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-10-15 17:55:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:55:30,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:55:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:30,451 INFO L225 Difference]: With dead ends: 76 [2022-10-15 17:55:30,451 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 17:55:30,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:55:30,452 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 167 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:30,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 199 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 17:55:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-10-15 17:55:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 64 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-10-15 17:55:30,456 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 20 [2022-10-15 17:55:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:30,456 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-10-15 17:55:30,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-10-15 17:55:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:55:30,457 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:30,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:30,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-15 17:55:30,458 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting strcpyErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -821908668, now seen corresponding path program 1 times [2022-10-15 17:55:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:30,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732111451] [2022-10-15 17:55:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:30,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732111451] [2022-10-15 17:55:30,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732111451] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:30,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:30,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:55:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591555718] [2022-10-15 17:55:30,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:30,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:55:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:55:30,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:30,574 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:30,661 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-10-15 17:55:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:55:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 17:55:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:30,662 INFO L225 Difference]: With dead ends: 68 [2022-10-15 17:55:30,662 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 17:55:30,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:30,664 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:30,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 121 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 17:55:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 17:55:30,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 63 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-10-15 17:55:30,667 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 21 [2022-10-15 17:55:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:30,667 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-10-15 17:55:30,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-10-15 17:55:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:55:30,668 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:30,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:30,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 17:55:30,669 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting strcpyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:30,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash -821908667, now seen corresponding path program 1 times [2022-10-15 17:55:30,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:30,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971631659] [2022-10-15 17:55:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:30,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971631659] [2022-10-15 17:55:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971631659] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:55:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529279868] [2022-10-15 17:55:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:55:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:55:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:30,851 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:31,000 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-10-15 17:55:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:55:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 17:55:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:31,002 INFO L225 Difference]: With dead ends: 89 [2022-10-15 17:55:31,002 INFO L226 Difference]: Without dead ends: 89 [2022-10-15 17:55:31,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:55:31,003 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 122 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:31,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 180 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-10-15 17:55:31,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2022-10-15 17:55:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 17:55:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-10-15 17:55:31,007 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2022-10-15 17:55:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:31,007 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-10-15 17:55:31,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-10-15 17:55:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 17:55:31,008 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:31,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:31,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-15 17:55:31,008 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting strcpyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash -805778860, now seen corresponding path program 1 times [2022-10-15 17:55:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:31,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705441867] [2022-10-15 17:55:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:31,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705441867] [2022-10-15 17:55:31,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705441867] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:31,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:31,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:55:31,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609338670] [2022-10-15 17:55:31,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:31,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 17:55:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:31,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 17:55:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 17:55:31,232 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:31,442 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-10-15 17:55:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 17:55:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-10-15 17:55:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:31,444 INFO L225 Difference]: With dead ends: 104 [2022-10-15 17:55:31,444 INFO L226 Difference]: Without dead ends: 104 [2022-10-15 17:55:31,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-10-15 17:55:31,445 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 138 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:31,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 255 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-10-15 17:55:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2022-10-15 17:55:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 75 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 17:55:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-10-15 17:55:31,449 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2022-10-15 17:55:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-10-15 17:55:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-10-15 17:55:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 17:55:31,451 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:31,451 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:31,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-15 17:55:31,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 127520093, now seen corresponding path program 1 times [2022-10-15 17:55:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:31,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400858952] [2022-10-15 17:55:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:32,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400858952] [2022-10-15 17:55:32,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400858952] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:32,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054224703] [2022-10-15 17:55:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:32,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:32,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:55:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:32,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 68 conjunts are in the unsatisfiable core [2022-10-15 17:55:32,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:32,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:32,554 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:32,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 17:55:32,606 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 17:55:32,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 17:55:32,678 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:55:32,764 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:55:32,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 17:55:32,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 17:55:33,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:33,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2022-10-15 17:55:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:33,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:34,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:34,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:34,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-10-15 17:55:34,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:34,676 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 23 treesize of output 24 [2022-10-15 17:55:34,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:34,690 INFO L356 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-10-15 17:55:34,691 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 21 treesize of output 13 [2022-10-15 17:55:34,707 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-10-15 17:55:34,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37 [2022-10-15 17:55:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:34,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054224703] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:34,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:34,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2022-10-15 17:55:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516446305] [2022-10-15 17:55:34,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:34,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-10-15 17:55:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:34,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-10-15 17:55:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=995, Unknown=6, NotChecked=0, Total=1122 [2022-10-15 17:55:34,763 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 31 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:35,273 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-10-15 17:55:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:55:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 31 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 17:55:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:35,275 INFO L225 Difference]: With dead ends: 94 [2022-10-15 17:55:35,275 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 17:55:35,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=188, Invalid=1446, Unknown=6, NotChecked=0, Total=1640 [2022-10-15 17:55:35,277 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:35,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 733 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 197 Unchecked, 0.1s Time] [2022-10-15 17:55:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 17:55:35,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-10-15 17:55:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 86 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-10-15 17:55:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-10-15 17:55:35,282 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 24 [2022-10-15 17:55:35,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:35,282 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-10-15 17:55:35,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 31 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:35,283 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2022-10-15 17:55:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 17:55:35,283 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:35,283 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:35,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:35,497 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,SelfDestructingSolverStorable20 [2022-10-15 17:55:35,498 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -385736722, now seen corresponding path program 1 times [2022-10-15 17:55:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:35,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976796784] [2022-10-15 17:55:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:36,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976796784] [2022-10-15 17:55:36,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976796784] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:36,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700740778] [2022-10-15 17:55:36,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:36,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:36,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:36,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:55:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:36,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-15 17:55:36,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:36,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:36,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:36,344 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:36,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-15 17:55:36,550 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:36,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-10-15 17:55:36,560 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 8 treesize of output 3 [2022-10-15 17:55:37,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:37,115 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 55 treesize of output 52 [2022-10-15 17:55:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:37,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:37,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_strcpy_#t~post3.offset_11| Int) (v_ArrVal_235 (Array Int Int))) (or (not (<= 0 |v_strcpy_#t~post3.offset_11|)) (<= (+ 2 |v_strcpy_#t~post3.offset_11|) (select |c_#length| |c_ULTIMATE.start_build_fullname_~filename#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_build_fullname_~dest~0#1.base| v_ArrVal_235) |c_ULTIMATE.start_build_fullname_~filename#1.base|) |v_strcpy_#t~post3.offset_11|) 0) (< |c_ULTIMATE.start_build_fullname_~filename#1.offset| |v_strcpy_#t~post3.offset_11|))) is different from false [2022-10-15 17:55:37,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_234 Int) (|v_ULTIMATE.start_main_#t~malloc23#1.base_6| Int) (|v_strcpy_#t~post3.offset_11| Int) (v_ArrVal_235 (Array Int Int))) (or (not (<= 0 |v_strcpy_#t~post3.offset_11|)) (not (<= (+ |c_ULTIMATE.start_main_~dir_len~0#1| |c_ULTIMATE.start_main_~file_len~0#1| 2) v_ArrVal_234)) (< |c_ULTIMATE.start_main_~file~0#1.offset| |v_strcpy_#t~post3.offset_11|) (<= (+ 2 |v_strcpy_#t~post3.offset_11|) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc23#1.base_6| v_ArrVal_234) |c_ULTIMATE.start_main_~file~0#1.base|)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc23#1.base_6| v_ArrVal_235) |c_ULTIMATE.start_main_~file~0#1.base|) |v_strcpy_#t~post3.offset_11|) 0))) is different from false [2022-10-15 17:55:37,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:37,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-15 17:55:37,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:37,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-10-15 17:55:37,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-10-15 17:55:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:38,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700740778] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:38,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:38,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 36 [2022-10-15 17:55:38,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395830522] [2022-10-15 17:55:38,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:38,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-15 17:55:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-15 17:55:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1073, Unknown=2, NotChecked=134, Total=1332 [2022-10-15 17:55:38,357 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 34 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:39,159 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-10-15 17:55:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:55:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 34 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 17:55:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:39,162 INFO L225 Difference]: With dead ends: 101 [2022-10-15 17:55:39,162 INFO L226 Difference]: Without dead ends: 101 [2022-10-15 17:55:39,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=1618, Unknown=2, NotChecked=166, Total=1980 [2022-10-15 17:55:39,165 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:39,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 882 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 268 Unchecked, 0.1s Time] [2022-10-15 17:55:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-15 17:55:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-10-15 17:55:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 93 states have internal predecessors, (108), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:55:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 118 transitions. [2022-10-15 17:55:39,171 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 118 transitions. Word has length 24 [2022-10-15 17:55:39,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:39,172 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 118 transitions. [2022-10-15 17:55:39,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 34 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:39,172 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 118 transitions. [2022-10-15 17:55:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 17:55:39,173 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:39,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:39,210 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:55:39,387 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,SelfDestructingSolverStorable21 [2022-10-15 17:55:39,388 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting strcpyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash -341844355, now seen corresponding path program 1 times [2022-10-15 17:55:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:39,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316212626] [2022-10-15 17:55:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316212626] [2022-10-15 17:55:39,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316212626] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:39,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492969834] [2022-10-15 17:55:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:39,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:39,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:39,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:39,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:55:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:39,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-15 17:55:39,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:39,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:39,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:40,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492969834] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:40,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:40,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-10-15 17:55:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520059724] [2022-10-15 17:55:40,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:40,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-10-15 17:55:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:40,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-10-15 17:55:40,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:55:40,215 INFO L87 Difference]: Start difference. First operand 101 states and 118 transitions. Second operand has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:40,889 INFO L93 Difference]: Finished difference Result 169 states and 194 transitions. [2022-10-15 17:55:40,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 17:55:40,890 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:55:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:40,892 INFO L225 Difference]: With dead ends: 169 [2022-10-15 17:55:40,892 INFO L226 Difference]: Without dead ends: 169 [2022-10-15 17:55:40,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2022-10-15 17:55:40,893 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 312 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:40,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 375 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:55:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-10-15 17:55:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 133. [2022-10-15 17:55:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 125 states have internal predecessors, (154), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:55:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2022-10-15 17:55:40,901 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 25 [2022-10-15 17:55:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:40,902 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2022-10-15 17:55:40,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2022-10-15 17:55:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 17:55:40,903 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:40,903 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:40,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:41,117 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1707050819, now seen corresponding path program 1 times [2022-10-15 17:55:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423841895] [2022-10-15 17:55:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423841895] [2022-10-15 17:55:41,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423841895] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:41,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450994358] [2022-10-15 17:55:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:41,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:41,633 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:41,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:55:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:41,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 61 conjunts are in the unsatisfiable core [2022-10-15 17:55:41,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:41,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:41,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:41,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:41,838 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:55:41,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 17:55:41,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 17:55:42,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:42,221 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 20 treesize of output 17 [2022-10-15 17:55:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:42,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:42,867 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 15 treesize of output 13 [2022-10-15 17:55:42,872 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 20 treesize of output 16 [2022-10-15 17:55:43,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:43,037 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 96 treesize of output 101 [2022-10-15 17:55:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:43,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450994358] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:43,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:43,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-10-15 17:55:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537712280] [2022-10-15 17:55:43,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 17:55:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 17:55:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:55:43,068 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 27 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:43,480 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2022-10-15 17:55:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:55:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 27 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 17:55:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:43,482 INFO L225 Difference]: With dead ends: 147 [2022-10-15 17:55:43,482 INFO L226 Difference]: Without dead ends: 147 [2022-10-15 17:55:43,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2022-10-15 17:55:43,484 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 17 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:43,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 637 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 305 Unchecked, 0.1s Time] [2022-10-15 17:55:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-15 17:55:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-10-15 17:55:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 125 states have (on average 1.328) internal successors, (166), 135 states have internal predecessors, (166), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 17:55:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2022-10-15 17:55:43,495 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 26 [2022-10-15 17:55:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:43,495 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2022-10-15 17:55:43,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 27 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2022-10-15 17:55:43,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 17:55:43,497 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:43,497 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:43,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:43,712 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:43,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:43,713 INFO L85 PathProgramCache]: Analyzing trace with hash 873543128, now seen corresponding path program 1 times [2022-10-15 17:55:43,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:43,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014107775] [2022-10-15 17:55:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:43,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014107775] [2022-10-15 17:55:43,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014107775] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005387947] [2022-10-15 17:55:43,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:43,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:43,941 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:55:43,962 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:55:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:44,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 17:55:44,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:44,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:44,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:44,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005387947] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:44,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:44,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2022-10-15 17:55:44,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229415602] [2022-10-15 17:55:44,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:44,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 17:55:44,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:44,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 17:55:44,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:55:44,248 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:44,559 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2022-10-15 17:55:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:55:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 17:55:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:44,561 INFO L225 Difference]: With dead ends: 186 [2022-10-15 17:55:44,561 INFO L226 Difference]: Without dead ends: 186 [2022-10-15 17:55:44,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:55:44,562 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 186 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:44,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 436 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:55:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-10-15 17:55:44,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2022-10-15 17:55:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 127 states have internal predecessors, (156), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:55:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions. [2022-10-15 17:55:44,569 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 26 [2022-10-15 17:55:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:44,569 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions. [2022-10-15 17:55:44,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:44,570 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions. [2022-10-15 17:55:44,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:55:44,570 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:44,570 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, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:44,612 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:55:44,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-10-15 17:55:44,786 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:44,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1849018955, now seen corresponding path program 1 times [2022-10-15 17:55:44,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:44,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246689805] [2022-10-15 17:55:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:55:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:44,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246689805] [2022-10-15 17:55:44,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246689805] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:44,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:55:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674878576] [2022-10-15 17:55:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:55:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:44,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:55:44,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:55:44,887 INFO L87 Difference]: Start difference. First operand 135 states and 166 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:44,971 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2022-10-15 17:55:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:55:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-10-15 17:55:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:44,973 INFO L225 Difference]: With dead ends: 137 [2022-10-15 17:55:44,973 INFO L226 Difference]: Without dead ends: 137 [2022-10-15 17:55:44,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:55:44,974 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 37 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:44,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 114 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-10-15 17:55:44,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2022-10-15 17:55:44,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 125 states have internal predecessors, (154), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:55:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 164 transitions. [2022-10-15 17:55:44,980 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 164 transitions. Word has length 28 [2022-10-15 17:55:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:44,980 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 164 transitions. [2022-10-15 17:55:44,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 164 transitions. [2022-10-15 17:55:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:55:44,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:44,982 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, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:44,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-15 17:55:44,982 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:44,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:44,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1849018954, now seen corresponding path program 1 times [2022-10-15 17:55:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:44,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244931228] [2022-10-15 17:55:44,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:44,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:55:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:45,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:45,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244931228] [2022-10-15 17:55:45,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244931228] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:45,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:45,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 17:55:45,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71810176] [2022-10-15 17:55:45,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:45,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 17:55:45,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:45,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 17:55:45,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:55:45,155 INFO L87 Difference]: Start difference. First operand 133 states and 164 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:45,280 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2022-10-15 17:55:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:55:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-10-15 17:55:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:45,282 INFO L225 Difference]: With dead ends: 155 [2022-10-15 17:55:45,282 INFO L226 Difference]: Without dead ends: 155 [2022-10-15 17:55:45,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:55:45,283 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 150 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 166 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-10-15 17:55:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2022-10-15 17:55:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 129 states have internal predecessors, (159), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2022-10-15 17:55:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 169 transitions. [2022-10-15 17:55:45,293 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 169 transitions. Word has length 28 [2022-10-15 17:55:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:45,294 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 169 transitions. [2022-10-15 17:55:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2022-10-15 17:55:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:55:45,294 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:45,294 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-15 17:55:45,295 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:45,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -517656795, now seen corresponding path program 2 times [2022-10-15 17:55:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:45,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718041937] [2022-10-15 17:55:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:46,590 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:55:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:46,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718041937] [2022-10-15 17:55:46,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718041937] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:46,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805320369] [2022-10-15 17:55:46,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:55:46,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:46,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:46,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:46,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:55:46,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:55:46,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:55:46,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 81 conjunts are in the unsatisfiable core [2022-10-15 17:55:46,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:46,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:55:46,771 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:55:46,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-10-15 17:55:46,798 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 17:55:46,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 17:55:46,866 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:55:46,947 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-15 17:55:46,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 17:55:46,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 17:55:47,406 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 26 treesize of output 26 [2022-10-15 17:55:47,713 INFO L356 Elim1Store]: treesize reduction 4, result has 81.8 percent of original size [2022-10-15 17:55:47,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 28 [2022-10-15 17:55:47,835 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:55:47,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:48,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_375 Int) (|v_ULTIMATE.start_main_#t~malloc22#1.base_9| Int) (v_ArrVal_373 Int) (|v_ULTIMATE.start_main_#t~malloc23#1.base_9| Int) (v_ArrVal_374 (Array Int Int)) (v_ArrVal_376 (Array Int Int)) (|v_ULTIMATE.start_build_fullname_~directory#1.offset_17| Int)) (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc22#1.base_9| v_ArrVal_374))) (or (<= (+ |v_ULTIMATE.start_build_fullname_~directory#1.offset_17| 3) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc22#1.base_9| v_ArrVal_373) |v_ULTIMATE.start_main_#t~malloc23#1.base_9| v_ArrVal_375) |c_ULTIMATE.start_main_~dir~0#1.base|)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc23#1.base_9| v_ArrVal_376) |c_ULTIMATE.start_main_~dir~0#1.base|) (+ |v_ULTIMATE.start_build_fullname_~directory#1.offset_17| 1)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_9|) 0)) (< |c_ULTIMATE.start_main_~dir~0#1.offset| |v_ULTIMATE.start_build_fullname_~directory#1.offset_17|) (= (select (select .cse0 |c_ULTIMATE.start_main_~dir~0#1.base|) |v_ULTIMATE.start_build_fullname_~directory#1.offset_17|) 0) (not (<= 0 |v_ULTIMATE.start_build_fullname_~directory#1.offset_17|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_9| 1) |v_ULTIMATE.start_main_#t~malloc23#1.base_9|) 0))))) is different from false [2022-10-15 17:55:48,966 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:48,967 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 48 treesize of output 37 [2022-10-15 17:55:48,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:48,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:48,995 INFO L356 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-10-15 17:55:48,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 25 [2022-10-15 17:55:49,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:49,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:55:49,007 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 49 treesize of output 41 [2022-10-15 17:55:49,020 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-10-15 17:55:49,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 22 [2022-10-15 17:55:49,031 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:55:49,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805320369] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:49,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:49,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 41 [2022-10-15 17:55:49,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244009452] [2022-10-15 17:55:49,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:49,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-10-15 17:55:49,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:49,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-10-15 17:55:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1518, Unknown=5, NotChecked=78, Total=1722 [2022-10-15 17:55:49,034 INFO L87 Difference]: Start difference. First operand 137 states and 169 transitions. Second operand has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 39 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,223 INFO L93 Difference]: Finished difference Result 150 states and 185 transitions. [2022-10-15 17:55:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 17:55:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 39 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:55:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,225 INFO L225 Difference]: With dead ends: 150 [2022-10-15 17:55:50,225 INFO L226 Difference]: Without dead ends: 150 [2022-10-15 17:55:50,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=216, Invalid=2539, Unknown=5, NotChecked=102, Total=2862 [2022-10-15 17:55:50,227 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 920 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 165 Unchecked, 0.1s Time] [2022-10-15 17:55:50,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-15 17:55:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-10-15 17:55:50,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.300751879699248) internal successors, (173), 141 states have internal predecessors, (173), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-10-15 17:55:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 185 transitions. [2022-10-15 17:55:50,234 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 185 transitions. Word has length 28 [2022-10-15 17:55:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,234 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 185 transitions. [2022-10-15 17:55:50,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 39 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 185 transitions. [2022-10-15 17:55:50,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:55:50,235 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,235 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, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:50,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-15 17:55:50,449 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 179722988, now seen corresponding path program 1 times [2022-10-15 17:55:50,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285383634] [2022-10-15 17:55:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 17:55:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:50,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285383634] [2022-10-15 17:55:50,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285383634] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:55:50,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:55:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 17:55:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031487282] [2022-10-15 17:55:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:55:50,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:55:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:50,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:55:50,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:50,742 INFO L87 Difference]: Start difference. First operand 150 states and 185 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:50,838 INFO L93 Difference]: Finished difference Result 151 states and 186 transitions. [2022-10-15 17:55:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:55:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-10-15 17:55:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:50,840 INFO L225 Difference]: With dead ends: 151 [2022-10-15 17:55:50,840 INFO L226 Difference]: Without dead ends: 139 [2022-10-15 17:55:50,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:55:50,841 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:50,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 233 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:55:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-10-15 17:55:50,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2022-10-15 17:55:50,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 115 states have (on average 1.2434782608695651) internal successors, (143), 120 states have internal predecessors, (143), 6 states have call successors, (6), 6 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2022-10-15 17:55:50,847 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 28 [2022-10-15 17:55:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:50,847 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2022-10-15 17:55:50,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:55:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2022-10-15 17:55:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 17:55:50,848 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:50,848 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:50,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-10-15 17:55:50,848 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:50,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1510986038, now seen corresponding path program 2 times [2022-10-15 17:55:50,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:50,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954609325] [2022-10-15 17:55:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:50,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:51,802 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:55:51,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:51,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954609325] [2022-10-15 17:55:51,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954609325] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:51,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211698121] [2022-10-15 17:55:51,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:55:51,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:51,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:51,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 17:55:51,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:55:51,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:55:51,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 69 conjunts are in the unsatisfiable core [2022-10-15 17:55:51,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:51,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:51,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:51,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 17:55:51,983 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:55:51,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 17:55:51,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-15 17:55:52,036 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:55:52,165 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:55:52,253 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:52,254 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 21 treesize of output 17 [2022-10-15 17:55:52,320 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:55:52,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:55:53,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:53,251 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 23 treesize of output 24 [2022-10-15 17:55:53,261 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:55:53,262 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 37 treesize of output 34 [2022-10-15 17:55:53,270 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 11 treesize of output 7 [2022-10-15 17:55:57,470 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:55:57,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211698121] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:55:57,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:55:57,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-10-15 17:55:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577427718] [2022-10-15 17:55:57,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:55:57,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-10-15 17:55:57,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:55:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-10-15 17:55:57,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1198, Unknown=29, NotChecked=0, Total=1332 [2022-10-15 17:55:57,473 INFO L87 Difference]: Start difference. First operand 128 states and 151 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:55:58,989 INFO L93 Difference]: Finished difference Result 135 states and 155 transitions. [2022-10-15 17:55:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-10-15 17:55:58,990 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 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:55:58,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:55:58,992 INFO L225 Difference]: With dead ends: 135 [2022-10-15 17:55:58,993 INFO L226 Difference]: Without dead ends: 135 [2022-10-15 17:55:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=302, Invalid=2425, Unknown=29, NotChecked=0, Total=2756 [2022-10-15 17:55:58,999 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 196 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 17:55:59,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 512 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 524 Invalid, 0 Unknown, 242 Unchecked, 0.4s Time] [2022-10-15 17:55:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-10-15 17:55:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2022-10-15 17:55:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 108 states have internal predecessors, (128), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:55:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-10-15 17:55:59,008 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 28 [2022-10-15 17:55:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:55:59,008 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-10-15 17:55:59,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 34 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:55:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-10-15 17:55:59,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 17:55:59,009 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:55:59,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:55:59,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 17:55:59,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:59,224 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting strcpyErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:55:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:55:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -404073020, now seen corresponding path program 1 times [2022-10-15 17:55:59,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:55:59,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887712007] [2022-10-15 17:55:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:55:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:59,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:55:59,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887712007] [2022-10-15 17:55:59,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887712007] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:55:59,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301734252] [2022-10-15 17:55:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:55:59,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:55:59,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:55:59,551 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:55:59,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 17:55:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:55:59,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-15 17:55:59,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:55:59,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:55:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:55:59,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:56:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:56:00,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301734252] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:56:00,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:56:00,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-10-15 17:56:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243417936] [2022-10-15 17:56:00,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:56:00,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 17:56:00,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:56:00,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 17:56:00,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:56:00,140 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 27 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:56:00,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:56:00,794 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-10-15 17:56:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 17:56:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-10-15 17:56:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:56:00,796 INFO L225 Difference]: With dead ends: 141 [2022-10-15 17:56:00,796 INFO L226 Difference]: Without dead ends: 141 [2022-10-15 17:56:00,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2022-10-15 17:56:00,798 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 181 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:56:00,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 397 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:56:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-15 17:56:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2022-10-15 17:56:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 108 states have internal predecessors, (128), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 17:56:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-10-15 17:56:00,803 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 29 [2022-10-15 17:56:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:56:00,803 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-10-15 17:56:00,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.217391304347826) internal successors, (74), 24 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:56:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-10-15 17:56:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 17:56:00,804 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:56:00,804 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:56:00,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 17:56:01,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-10-15 17:56:01,018 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:56:01,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:56:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1167203808, now seen corresponding path program 2 times [2022-10-15 17:56:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:56:01,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997803489] [2022-10-15 17:56:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:56:01,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:56:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:56:02,398 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:56:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:56:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997803489] [2022-10-15 17:56:02,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997803489] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:56:02,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207709510] [2022-10-15 17:56:02,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:56:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:56:02,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:56:02,404 INFO L229 MonitoredProcess]: Starting monitored process 10 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:56:02,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 17:56:02,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:56:02,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:56:02,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 66 conjunts are in the unsatisfiable core [2022-10-15 17:56:02,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:56:02,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:56:02,554 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:56:02,616 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:56:02,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-10-15 17:56:02,648 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 17:56:02,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 17:56:02,723 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:56:02,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 17:56:02,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 17:56:02,821 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-15 17:56:02,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 17:56:03,181 INFO L356 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-10-15 17:56:03,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2022-10-15 17:56:03,729 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:56:03,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:56:04,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 Int) (|v_ULTIMATE.start_main_#t~malloc23#1.base_12| Int) (v_ArrVal_501 (Array Int Int)) (|v_ULTIMATE.start_build_fullname_~directory#1.offset_20| Int) (|v_ULTIMATE.start_main_#t~malloc22#1.base_12| Int) (v_ArrVal_502 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc22#1.base_12| v_ArrVal_501) |c_ULTIMATE.start_main_~dir~0#1.base|))) (or (not (= (select .cse0 |v_ULTIMATE.start_build_fullname_~directory#1.offset_20|) 46)) (= (select .cse0 (+ |v_ULTIMATE.start_build_fullname_~directory#1.offset_20| 1)) 0) (< (+ |v_ULTIMATE.start_build_fullname_~directory#1.offset_20| 2) (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc22#1.base_12| v_ArrVal_500) |v_ULTIMATE.start_main_#t~malloc23#1.base_12| v_ArrVal_502) |c_ULTIMATE.start_main_~dir~0#1.base|)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_12| 1) |v_ULTIMATE.start_main_#t~malloc23#1.base_12|) 0)) (< |c_ULTIMATE.start_main_~dir~0#1.offset| |v_ULTIMATE.start_build_fullname_~directory#1.offset_20|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_12|) 0)) (< |v_ULTIMATE.start_build_fullname_~directory#1.offset_20| 0)))) is different from false [2022-10-15 17:56:04,877 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-10-15 17:56:04,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 22 [2022-10-15 17:56:04,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:56:04,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2022-10-15 17:56:04,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:56:04,907 INFO L356 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-10-15 17:56:04,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 26 [2022-10-15 17:56:05,185 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:56:05,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207709510] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:56:05,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:56:05,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 19] total 50 [2022-10-15 17:56:05,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816638120] [2022-10-15 17:56:05,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:56:05,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-10-15 17:56:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:56:05,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-10-15 17:56:05,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2287, Unknown=1, NotChecked=96, Total=2550 [2022-10-15 17:56:05,188 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 51 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:56:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:56:08,082 INFO L93 Difference]: Finished difference Result 170 states and 199 transitions. [2022-10-15 17:56:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-10-15 17:56:08,084 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-10-15 17:56:08,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:56:08,085 INFO L225 Difference]: With dead ends: 170 [2022-10-15 17:56:08,085 INFO L226 Difference]: Without dead ends: 170 [2022-10-15 17:56:08,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=355, Invalid=4340, Unknown=1, NotChecked=134, Total=4830 [2022-10-15 17:56:08,087 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 133 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-10-15 17:56:08,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1428 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 953 Invalid, 0 Unknown, 362 Unchecked, 0.7s Time] [2022-10-15 17:56:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-10-15 17:56:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 142. [2022-10-15 17:56:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 128 states have (on average 1.2578125) internal successors, (161), 134 states have internal predecessors, (161), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 17:56:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2022-10-15 17:56:08,093 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 30 [2022-10-15 17:56:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:56:08,093 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2022-10-15 17:56:08,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.6875) internal successors, (81), 48 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:56:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2022-10-15 17:56:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 17:56:08,094 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:56:08,094 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:56:08,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-10-15 17:56:08,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:56:08,311 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting strcpyErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-10-15 17:56:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:56:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1901000760, now seen corresponding path program 1 times [2022-10-15 17:56:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:56:08,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566067287] [2022-10-15 17:56:08,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:56:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:56:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:56:09,717 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:56:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:56:09,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566067287] [2022-10-15 17:56:09,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566067287] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:56:09,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696111732] [2022-10-15 17:56:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:56:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:56:09,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:56:09,722 INFO L229 MonitoredProcess]: Starting monitored process 11 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:56:09,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-15 17:56:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:56:09,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 80 conjunts are in the unsatisfiable core [2022-10-15 17:56:09,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:56:09,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 17:56:09,861 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:56:09,915 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 17:56:09,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 17:56:09,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-10-15 17:56:09,959 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:56:09,978 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:56:09,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-10-15 17:56:09,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 17:56:09,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 17:56:10,229 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:56:10,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:56:10,331 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 21 treesize of output 17 [2022-10-15 17:56:10,412 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:56:10,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:56:11,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc23#1.base_13| Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_537 Int) (|ULTIMATE.start_build_fullname_~directory#1.offset| Int)) (let ((.cse0 (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_537) |c_ULTIMATE.start_main_~dir~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc23#1.base_13|) 0)) (not (<= 0 |ULTIMATE.start_build_fullname_~directory#1.offset|)) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_538) |c_ULTIMATE.start_main_~dir~0#1.base|) (+ |ULTIMATE.start_build_fullname_~directory#1.offset| 1)) 0) (<= (+ 3 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0) (not (<= (+ 2 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0))))) is different from false [2022-10-15 17:56:11,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc23#1.base_13| Int) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|ULTIMATE.start_build_fullname_~directory#1.offset| Int) (v_ArrVal_537 Int)) (let ((.cse0 (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_537) |c_ULTIMATE.start_main_~dir~0#1.base|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc23#1.base_13|) 0)) (not (<= 0 |ULTIMATE.start_build_fullname_~directory#1.offset|)) (<= (+ 3 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0) (not (<= (+ 2 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~file~0#1.base| v_ArrVal_536) |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_538) |c_ULTIMATE.start_main_~dir~0#1.base|) (+ |ULTIMATE.start_build_fullname_~directory#1.offset| 1)) 0)))) is different from false [2022-10-15 17:56:11,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc23#1.base_13| Int) (v_ArrVal_536 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc22#1.base_13| Int) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_537 Int) (|ULTIMATE.start_build_fullname_~directory#1.offset| Int) (v_ArrVal_535 Int) (v_ArrVal_534 Int)) (let ((.cse0 (select (store (store |c_#length| |v_ULTIMATE.start_main_#t~malloc22#1.base_13| v_ArrVal_535) |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_537) |c_ULTIMATE.start_main_~dir~0#1.base|))) (or (not (<= (+ 2 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0)) (not (<= 0 |ULTIMATE.start_build_fullname_~directory#1.offset|)) (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_#t~malloc22#1.base_13| v_ArrVal_536) |v_ULTIMATE.start_main_#t~malloc23#1.base_13| v_ArrVal_538) |c_ULTIMATE.start_main_~dir~0#1.base|) (+ |ULTIMATE.start_build_fullname_~directory#1.offset| 1)) 0) (<= (+ 3 |ULTIMATE.start_build_fullname_~directory#1.offset|) .cse0) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_13| v_ArrVal_534) |v_ULTIMATE.start_main_#t~malloc23#1.base_13|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc22#1.base_13|) 0))))) is different from false [2022-10-15 17:56:11,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:56:11,264 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 26 treesize of output 27 [2022-10-15 17:56:11,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:56:11,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 17:56:11,278 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-10-15 17:56:11,278 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 21 treesize of output 15 [2022-10-15 17:56:11,300 INFO L356 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-10-15 17:56:11,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 37