/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/ldv-regression/test22-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:57:49,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:57:49,042 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:57:49,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:57:49,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:57:49,090 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:57:49,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:57:49,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:57:49,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:57:49,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:57:49,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:57:49,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:57:49,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:57:49,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:57:49,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:57:49,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:57:49,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:57:49,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:57:49,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:57:49,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:57:49,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:57:49,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:57:49,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:57:49,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:57:49,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:57:49,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:57:49,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:57:49,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:57:49,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:57:49,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:57:49,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:57:49,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:57:49,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:57:49,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:57:49,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:57:49,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:57:49,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:57:49,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:57:49,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:57:49,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:57:49,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:57:49,143 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 16:57:49,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:57:49,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:57:49,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:57:49,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:57:49,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:57:49,207 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:57:49,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:57:49,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:57:49,208 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:57:49,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:57:49,209 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:57:49,209 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:57:49,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:57:49,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:57:49,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:57:49,210 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:57:49,210 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:57:49,210 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:57:49,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:57:49,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:57:49,211 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:57:49,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:57:49,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:57:49,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:57:49,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:57:49,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:49,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:57:49,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:57:49,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:57:49,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:57:49,213 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 16:57:49,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:57:49,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:57:49,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:57:49,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:57:49,629 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:57:49,631 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-2.c [2022-10-15 16:57:49,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825c6d1a/64786692656f4caf9120b32b7cc8efb5/FLAG66ec7867f [2022-10-15 16:57:50,385 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:57:50,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-2.c [2022-10-15 16:57:50,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825c6d1a/64786692656f4caf9120b32b7cc8efb5/FLAG66ec7867f [2022-10-15 16:57:50,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c825c6d1a/64786692656f4caf9120b32b7cc8efb5 [2022-10-15 16:57:50,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:57:50,740 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:57:50,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:50,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:57:50,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:57:50,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:50,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6150f209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50, skipping insertion in model container [2022-10-15 16:57:50,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:50,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:57:50,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:57:50,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-2.c[1029,1042] [2022-10-15 16:57:50,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:50,957 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:57:50,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-2.c[1029,1042] [2022-10-15 16:57:50,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:50,996 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:57:50,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50 WrapperNode [2022-10-15 16:57:50,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:50,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:50,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:57:50,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:57:51,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,044 INFO L138 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-10-15 16:57:51,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:51,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:57:51,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:57:51,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:57:51,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:57:51,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:57:51,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:57:51,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:57:51,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (1/1) ... [2022-10-15 16:57:51,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:51,125 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 16:57:51,142 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 16:57:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:57:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:57:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:57:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-10-15 16:57:51,194 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-10-15 16:57:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:57:51,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:57:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:57:51,278 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:57:51,281 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:57:51,655 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:57:51,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:57:51,675 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 16:57:51,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:51 BoogieIcfgContainer [2022-10-15 16:57:51,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:57:51,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:57:51,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:57:51,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:57:51,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:57:50" (1/3) ... [2022-10-15 16:57:51,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465e79b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:51, skipping insertion in model container [2022-10-15 16:57:51,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:50" (2/3) ... [2022-10-15 16:57:51,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465e79b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:51, skipping insertion in model container [2022-10-15 16:57:51,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:51" (3/3) ... [2022-10-15 16:57:51,709 INFO L112 eAbstractionObserver]: Analyzing ICFG test22-2.c [2022-10-15 16:57:51,740 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:57:51,740 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 16:57:51,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:57:51,860 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;@4807a2f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:57:51,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 16:57:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:51,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:57:51,886 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:51,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:57:51,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2022-10-15 16:57:51,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:51,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370824027] [2022-10-15 16:57:51,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:51,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:52,387 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 16:57:52,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370824027] [2022-10-15 16:57:52,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370824027] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:52,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:52,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089400562] [2022-10-15 16:57:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:52,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:52,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:52,459 INFO L87 Difference]: Start difference. First operand has 57 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 52 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 16:57:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:52,566 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2022-10-15 16:57:52,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:52,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:57:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:52,581 INFO L225 Difference]: With dead ends: 55 [2022-10-15 16:57:52,581 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 16:57:52,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:57:52,591 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:52,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 16:57:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-15 16:57:52,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-10-15 16:57:52,642 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-10-15 16:57:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:52,643 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-10-15 16:57:52,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 16:57:52,643 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-10-15 16:57:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:57:52,644 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:52,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:57:52,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:57:52,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2022-10-15 16:57:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:52,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513964419] [2022-10-15 16:57:52,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:52,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:52,803 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 16:57:52,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:52,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513964419] [2022-10-15 16:57:52,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513964419] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:52,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:52,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697343994] [2022-10-15 16:57:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:52,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:52,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:52,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:52,808 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 16:57:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:52,872 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-10-15 16:57:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-10-15 16:57:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:52,874 INFO L225 Difference]: With dead ends: 51 [2022-10-15 16:57:52,875 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 16:57:52,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:57:52,882 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:52,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 41 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:52,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 16:57:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-15 16:57:52,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-10-15 16:57:52,902 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 3 [2022-10-15 16:57:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:52,902 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-10-15 16:57:52,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 16:57:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-10-15 16:57:52,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:57:52,923 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:52,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:52,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:57:52,924 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:52,927 INFO L85 PathProgramCache]: Analyzing trace with hash 549787499, now seen corresponding path program 1 times [2022-10-15 16:57:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:52,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194786463] [2022-10-15 16:57:52,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,047 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 16:57:53,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:53,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194786463] [2022-10-15 16:57:53,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194786463] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:53,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:53,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:53,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542380053] [2022-10-15 16:57:53,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:53,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:53,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:53,051 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:53,086 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-10-15 16:57:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:53,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:53,089 INFO L225 Difference]: With dead ends: 49 [2022-10-15 16:57:53,089 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 16:57:53,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:57:53,091 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:53,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 37 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 16:57:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 16:57:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-10-15 16:57:53,101 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 7 [2022-10-15 16:57:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:53,102 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-10-15 16:57:53,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-10-15 16:57:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 16:57:53,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:53,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:53,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:57:53,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:53,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:53,104 INFO L85 PathProgramCache]: Analyzing trace with hash 549787500, now seen corresponding path program 1 times [2022-10-15 16:57:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:53,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777061925] [2022-10-15 16:57:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,214 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 16:57:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:53,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777061925] [2022-10-15 16:57:53,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777061925] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:53,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:53,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-15 16:57:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488151295] [2022-10-15 16:57:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:53,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:53,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:53,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:53,218 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:53,246 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-10-15 16:57:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:53,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:53,248 INFO L225 Difference]: With dead ends: 47 [2022-10-15 16:57:53,248 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 16:57:53,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 16:57:53,250 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:53,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 39 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 16:57:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 16:57:53,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.393939393939394) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-10-15 16:57:53,263 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 7 [2022-10-15 16:57:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:53,264 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-10-15 16:57:53,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 16:57:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-10-15 16:57:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:57:53,266 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:53,266 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:57:53,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:57:53,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:53,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1944502419, now seen corresponding path program 1 times [2022-10-15 16:57:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:53,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659399737] [2022-10-15 16:57:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:57:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:53,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:53,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659399737] [2022-10-15 16:57:53,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659399737] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:53,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983695312] [2022-10-15 16:57:53,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:53,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:53,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:53,589 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 16:57:53,593 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 16:57:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:53,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:57:53,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:57:53,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:54,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983695312] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:54,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:54,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-10-15 16:57:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281978318] [2022-10-15 16:57:54,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:54,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:57:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:54,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:57:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:57:54,196 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:57:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:54,736 INFO L93 Difference]: Finished difference Result 120 states and 140 transitions. [2022-10-15 16:57:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:57:54,737 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 31 [2022-10-15 16:57:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:54,741 INFO L225 Difference]: With dead ends: 120 [2022-10-15 16:57:54,742 INFO L226 Difference]: Without dead ends: 120 [2022-10-15 16:57:54,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-10-15 16:57:54,744 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 467 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:54,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 250 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:57:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-10-15 16:57:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 57. [2022-10-15 16:57:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 49 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-10-15 16:57:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-10-15 16:57:54,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 31 [2022-10-15 16:57:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:54,760 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-10-15 16:57:54,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:57:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-10-15 16:57:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:57:54,762 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:54,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:57:54,806 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 16:57:54,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:54,977 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:54,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1944502418, now seen corresponding path program 1 times [2022-10-15 16:57:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:54,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591340677] [2022-10-15 16:57:54,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:57:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591340677] [2022-10-15 16:57:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591340677] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693676677] [2022-10-15 16:57:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:55,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:55,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:55,451 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 16:57:55,454 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 16:57:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:55,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:57:55,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:56,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:56,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:57,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693676677] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:57,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:57,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 12] total 31 [2022-10-15 16:57:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133822046] [2022-10-15 16:57:57,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:57,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-10-15 16:57:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:57,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-10-15 16:57:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2022-10-15 16:57:57,127 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 32 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 26 states have internal predecessors, (69), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-10-15 16:57:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:58,082 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2022-10-15 16:57:58,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:57:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 26 states have internal predecessors, (69), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 31 [2022-10-15 16:57:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:58,085 INFO L225 Difference]: With dead ends: 142 [2022-10-15 16:57:58,085 INFO L226 Difference]: Without dead ends: 142 [2022-10-15 16:57:58,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2022-10-15 16:57:58,088 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 427 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:58,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 736 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 604 Invalid, 0 Unknown, 103 Unchecked, 0.5s Time] [2022-10-15 16:57:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-10-15 16:57:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 62. [2022-10-15 16:57:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 52 states have internal predecessors, (60), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-10-15 16:57:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2022-10-15 16:57:58,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 31 [2022-10-15 16:57:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:58,101 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-10-15 16:57:58,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 26 states have internal predecessors, (69), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-10-15 16:57:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-10-15 16:57:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:57:58,103 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:58,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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 16:57:58,149 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 16:57:58,319 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,SelfDestructingSolverStorable5 [2022-10-15 16:57:58,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:57:58,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:58,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1763658864, now seen corresponding path program 1 times [2022-10-15 16:57:58,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:58,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956541455] [2022-10-15 16:57:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:57:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:57:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:57:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:58,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956541455] [2022-10-15 16:57:58,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956541455] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:58,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429073903] [2022-10-15 16:57:58,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:58,518 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 16:57:58,524 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 16:57:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:58,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:57:58,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:58,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:59,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429073903] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:59,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:59,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-10-15 16:57:59,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129397680] [2022-10-15 16:57:59,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:57:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:57:59,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-10-15 16:57:59,204 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 30 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:57:59,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,775 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2022-10-15 16:57:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:57:59,776 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 31 [2022-10-15 16:57:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,778 INFO L225 Difference]: With dead ends: 94 [2022-10-15 16:57:59,778 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 16:57:59,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1435, Unknown=0, NotChecked=0, Total=1640 [2022-10-15 16:57:59,781 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 161 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1076 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:57:59,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 16:57:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2022-10-15 16:57:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 52 states have internal predecessors, (58), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-10-15 16:57:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-10-15 16:57:59,791 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 31 [2022-10-15 16:57:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,792 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-10-15 16:57:59,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 23 states have internal predecessors, (64), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:57:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-10-15 16:57:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:57:59,794 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,795 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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 16:57:59,839 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 16:58:00,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:00,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:00,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:00,010 INFO L85 PathProgramCache]: Analyzing trace with hash 74715121, now seen corresponding path program 1 times [2022-10-15 16:58:00,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:00,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995703392] [2022-10-15 16:58:00,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:00,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995703392] [2022-10-15 16:58:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995703392] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807227672] [2022-10-15 16:58:00,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:00,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:00,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:00,132 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 16:58:00,137 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 16:58:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:58:00,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:58:00,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:00,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807227672] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:00,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:00,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2022-10-15 16:58:00,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130479839] [2022-10-15 16:58:00,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:00,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 16:58:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 16:58:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-10-15 16:58:00,517 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:01,010 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2022-10-15 16:58:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:58:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Word has length 31 [2022-10-15 16:58:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:01,012 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:58:01,013 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:58:01,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2022-10-15 16:58:01,015 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 245 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:01,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 346 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:58:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:58:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 61. [2022-10-15 16:58:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 51 states have internal predecessors, (57), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-10-15 16:58:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-10-15 16:58:01,024 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2022-10-15 16:58:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:01,025 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2022-10-15 16:58:01,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1578947368421053) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-10-15 16:58:01,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-10-15 16:58:01,027 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:01,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 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 16:58:01,072 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 16:58:01,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:01,243 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:01,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 74715122, now seen corresponding path program 2 times [2022-10-15 16:58:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:01,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466735111] [2022-10-15 16:58:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:01,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466735111] [2022-10-15 16:58:01,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466735111] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:01,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994630865] [2022-10-15 16:58:01,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:01,506 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 16:58:01,510 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 16:58:01,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:58:01,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:01,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:58:01,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:01,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:02,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:58:02,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994630865] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:02,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:02,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 12] total 30 [2022-10-15 16:58:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099743354] [2022-10-15 16:58:02,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:02,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 16:58:02,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 16:58:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2022-10-15 16:58:02,935 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 31 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-10-15 16:58:03,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:03,935 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2022-10-15 16:58:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:58:03,936 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 31 [2022-10-15 16:58:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:03,939 INFO L225 Difference]: With dead ends: 121 [2022-10-15 16:58:03,946 INFO L226 Difference]: Without dead ends: 121 [2022-10-15 16:58:03,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=252, Invalid=1554, Unknown=0, NotChecked=0, Total=1806 [2022-10-15 16:58:03,951 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 305 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:03,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 839 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 727 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2022-10-15 16:58:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-10-15 16:58:03,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 55. [2022-10-15 16:58:03,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.275) internal successors, (51), 47 states have internal predecessors, (51), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-10-15 16:58:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-10-15 16:58:03,971 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 31 [2022-10-15 16:58:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:03,971 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-10-15 16:58:03,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.5) internal successors, (70), 25 states have internal predecessors, (70), 8 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-10-15 16:58:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-10-15 16:58:03,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 16:58:03,973 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:03,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:58:04,023 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 16:58:04,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:04,188 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:04,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -355830123, now seen corresponding path program 1 times [2022-10-15 16:58:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268968898] [2022-10-15 16:58:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:04,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:58:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:04,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268968898] [2022-10-15 16:58:04,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268968898] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:04,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:04,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:58:04,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79931762] [2022-10-15 16:58:04,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:04,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:58:04,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:04,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:58:04,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:58:04,278 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:04,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:04,296 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-10-15 16:58:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:58:04,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-10-15 16:58:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:04,297 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:58:04,297 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 16:58:04,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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 16:58:04,300 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:04,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 42 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 16:58:04,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 16:58:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 41 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-10-15 16:58:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-10-15 16:58:04,323 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 33 [2022-10-15 16:58:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:04,324 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-10-15 16:58:04,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-10-15 16:58:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:58:04,328 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:04,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:58:04,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:58:04,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:04,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:04,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1847335135, now seen corresponding path program 1 times [2022-10-15 16:58:04,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:04,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973530576] [2022-10-15 16:58:04,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:04,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:04,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973530576] [2022-10-15 16:58:04,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973530576] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:04,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:04,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:58:04,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142445987] [2022-10-15 16:58:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:58:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:58:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:04,511 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:58:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:04,641 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-10-15 16:58:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:58:04,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2022-10-15 16:58:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:04,645 INFO L225 Difference]: With dead ends: 92 [2022-10-15 16:58:04,645 INFO L226 Difference]: Without dead ends: 92 [2022-10-15 16:58:04,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:58:04,647 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 91 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:04,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 239 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-15 16:58:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 55. [2022-10-15 16:58:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-10-15 16:58:04,659 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 34 [2022-10-15 16:58:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:04,659 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-10-15 16:58:04,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 16:58:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-10-15 16:58:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:58:04,662 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:04,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:58:04,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:58:04,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:04,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1847335136, now seen corresponding path program 1 times [2022-10-15 16:58:04,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:04,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028861244] [2022-10-15 16:58:04,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:04,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:04,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028861244] [2022-10-15 16:58:04,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028861244] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:04,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:04,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:58:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954479845] [2022-10-15 16:58:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:04,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:04,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:04,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:04,896 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:05,046 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-10-15 16:58:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 16:58:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:05,048 INFO L225 Difference]: With dead ends: 76 [2022-10-15 16:58:05,048 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 16:58:05,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:05,049 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 67 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:05,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 119 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:05,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 16:58:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2022-10-15 16:58:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 52 states have internal predecessors, (56), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2022-10-15 16:58:05,055 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 34 [2022-10-15 16:58:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:05,055 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2022-10-15 16:58:05,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-10-15 16:58:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:58:05,057 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:05,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2022-10-15 16:58:05,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:58:05,057 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:05,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1454308125, now seen corresponding path program 1 times [2022-10-15 16:58:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:05,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424585216] [2022-10-15 16:58:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:05,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:05,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424585216] [2022-10-15 16:58:05,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424585216] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:05,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:05,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:58:05,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846115349] [2022-10-15 16:58:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:05,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:05,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:05,167 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:05,260 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-10-15 16:58:05,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:05,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 16:58:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:05,262 INFO L225 Difference]: With dead ends: 61 [2022-10-15 16:58:05,262 INFO L226 Difference]: Without dead ends: 61 [2022-10-15 16:58:05,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:05,263 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 50 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:05,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 131 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-10-15 16:58:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-10-15 16:58:05,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 52 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-10-15 16:58:05,268 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 34 [2022-10-15 16:58:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:05,268 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-10-15 16:58:05,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-10-15 16:58:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:58:05,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:05,270 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2022-10-15 16:58:05,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:58:05,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1454308126, now seen corresponding path program 1 times [2022-10-15 16:58:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:05,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330892874] [2022-10-15 16:58:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:05,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330892874] [2022-10-15 16:58:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330892874] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:05,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:05,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:58:05,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177084597] [2022-10-15 16:58:05,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:05,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:05,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:05,495 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:05,631 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2022-10-15 16:58:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 16:58:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:05,632 INFO L225 Difference]: With dead ends: 74 [2022-10-15 16:58:05,633 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 16:58:05,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:05,634 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 44 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:05,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 188 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 16:58:05,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2022-10-15 16:58:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.170731707317073) internal successors, (48), 46 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-10-15 16:58:05,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 34 [2022-10-15 16:58:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:05,639 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-10-15 16:58:05,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-10-15 16:58:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 16:58:05,640 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:05,640 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1] [2022-10-15 16:58:05,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:58:05,641 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:05,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1045121499, now seen corresponding path program 2 times [2022-10-15 16:58:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:05,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792541247] [2022-10-15 16:58:05,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:05,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792541247] [2022-10-15 16:58:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792541247] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:05,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:05,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:58:05,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43430389] [2022-10-15 16:58:05,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:05,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:05,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:05,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:05,762 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:05,844 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-10-15 16:58:05,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:58:05,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-10-15 16:58:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:05,845 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:58:05,845 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:58:05,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:05,846 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:05,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:58:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2022-10-15 16:58:05,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 39 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-10-15 16:58:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-10-15 16:58:05,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 34 [2022-10-15 16:58:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:05,851 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-10-15 16:58:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-10-15 16:58:05,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:58:05,852 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:05,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:58:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:58:05,853 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:05,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:05,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1467572164, now seen corresponding path program 1 times [2022-10-15 16:58:05,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:05,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801147554] [2022-10-15 16:58:05,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:05,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801147554] [2022-10-15 16:58:06,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801147554] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:06,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305365393] [2022-10-15 16:58:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:06,009 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 16:58:06,029 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 16:58:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:06,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:58:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:58:06,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:06,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305365393] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:06,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:06,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 20 [2022-10-15 16:58:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568973055] [2022-10-15 16:58:06,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:06,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:58:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:06,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:58:06,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:58:06,412 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 16:58:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:06,759 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-10-15 16:58:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:58:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 36 [2022-10-15 16:58:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:06,760 INFO L225 Difference]: With dead ends: 68 [2022-10-15 16:58:06,761 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 16:58:06,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-10-15 16:58:06,762 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 133 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:06,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 417 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:58:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 16:58:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-10-15 16:58:06,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-10-15 16:58:06,767 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 36 [2022-10-15 16:58:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:06,768 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-10-15 16:58:06,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 17 states have internal predecessors, (73), 7 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 16:58:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-10-15 16:58:06,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:58:06,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:06,769 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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 16:58:06,814 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 16:58:06,970 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,SelfDestructingSolverStorable15 [2022-10-15 16:58:06,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1467572165, now seen corresponding path program 1 times [2022-10-15 16:58:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:06,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662278946] [2022-10-15 16:58:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:07,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662278946] [2022-10-15 16:58:07,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662278946] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:07,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641074354] [2022-10-15 16:58:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:07,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:07,319 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 16:58:07,321 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 16:58:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:58:07,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:58:07,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641074354] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:08,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:08,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 27 [2022-10-15 16:58:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127851387] [2022-10-15 16:58:08,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:08,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 16:58:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 16:58:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:58:08,574 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 25 states have internal predecessors, (78), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:09,092 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-10-15 16:58:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:58:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 25 states have internal predecessors, (78), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 36 [2022-10-15 16:58:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:09,094 INFO L225 Difference]: With dead ends: 66 [2022-10-15 16:58:09,094 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 16:58:09,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2022-10-15 16:58:09,097 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 256 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 217 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:58:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 16:58:09,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-10-15 16:58:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-10-15 16:58:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-10-15 16:58:09,103 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 36 [2022-10-15 16:58:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:09,104 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-10-15 16:58:09,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.888888888888889) internal successors, (78), 25 states have internal predecessors, (78), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-10-15 16:58:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:58:09,105 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:09,105 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-10-15 16:58:09,153 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 16:58:09,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:09,307 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:09,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1333558658, now seen corresponding path program 1 times [2022-10-15 16:58:09,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:09,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500347414] [2022-10-15 16:58:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:09,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:58:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:09,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500347414] [2022-10-15 16:58:09,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500347414] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:09,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959022770] [2022-10-15 16:58:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:09,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:09,460 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 16:58:09,485 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 16:58:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:09,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:58:09,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:09,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:09,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:58:10,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959022770] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:10,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:10,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-10-15 16:58:10,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035181171] [2022-10-15 16:58:10,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:10,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 16:58:10,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:10,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 16:58:10,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-10-15 16:58:10,066 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 23 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:58:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:10,556 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-10-15 16:58:10,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:58:10,557 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 23 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 36 [2022-10-15 16:58:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:10,558 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:58:10,558 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 16:58:10,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 16:58:10,560 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 137 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:10,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1015 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:58:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 16:58:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-10-15 16:58:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-15 16:58:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-10-15 16:58:10,567 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 36 [2022-10-15 16:58:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:10,568 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-10-15 16:58:10,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 23 states have internal predecessors, (69), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 16:58:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-10-15 16:58:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:58:10,569 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:10,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-10-15 16:58:10,617 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 16:58:10,784 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,SelfDestructingSolverStorable17 [2022-10-15 16:58:10,785 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:10,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -660586048, now seen corresponding path program 2 times [2022-10-15 16:58:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:10,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427526471] [2022-10-15 16:58:10,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:10,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:10,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427526471] [2022-10-15 16:58:10,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427526471] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:10,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102362136] [2022-10-15 16:58:10,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:10,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:10,947 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 16:58:10,972 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 16:58:11,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:58:11,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:11,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 16:58:11,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:58:11,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:58:11,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102362136] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:11,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:58:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-10-15 16:58:11,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976204474] [2022-10-15 16:58:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:11,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:58:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:58:11,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:11,059 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:11,098 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-10-15 16:58:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:58:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-10-15 16:58:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:11,100 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:58:11,100 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:58:11,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-10-15 16:58:11,101 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:11,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 108 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:58:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:58:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-15 16:58:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 16:58:11,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 36 [2022-10-15 16:58:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:11,108 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 16:58:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 16:58:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 16:58:11,109 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:11,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2022-10-15 16:58:11,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:11,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:11,324 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -660586047, now seen corresponding path program 1 times [2022-10-15 16:58:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:11,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773668519] [2022-10-15 16:58:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:11,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:11,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773668519] [2022-10-15 16:58:11,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773668519] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:11,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17863399] [2022-10-15 16:58:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:11,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:11,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:11,557 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 16:58:11,587 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 16:58:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 24 conjunts are in the unsatisfiable core [2022-10-15 16:58:11,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:58:11,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:12,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17863399] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:12,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:12,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 26 [2022-10-15 16:58:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805118281] [2022-10-15 16:58:12,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:12,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 16:58:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:12,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 16:58:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-10-15 16:58:12,682 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:13,251 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-10-15 16:58:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:58:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 36 [2022-10-15 16:58:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:13,253 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:58:13,253 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:58:13,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 16:58:13,255 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 183 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:13,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 349 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 16:58:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:58:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2022-10-15 16:58:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 37 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-15 16:58:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-10-15 16:58:13,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 36 [2022-10-15 16:58:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:13,260 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-10-15 16:58:13,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 24 states have internal predecessors, (80), 6 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-10-15 16:58:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:58:13,261 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:13,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-10-15 16:58:13,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:13,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:13,476 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:13,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:13,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1970262716, now seen corresponding path program 1 times [2022-10-15 16:58:13,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:13,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360828091] [2022-10-15 16:58:13,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:13,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-15 16:58:13,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:13,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360828091] [2022-10-15 16:58:13,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360828091] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:13,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:13,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:58:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662280236] [2022-10-15 16:58:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:13,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:13,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:58:13,556 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:13,578 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-10-15 16:58:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:13,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-10-15 16:58:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:13,579 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:58:13,579 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:58:13,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 16:58:13,580 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:13,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:58:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-15 16:58:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-15 16:58:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-10-15 16:58:13,584 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 39 [2022-10-15 16:58:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:13,584 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-10-15 16:58:13,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:58:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-10-15 16:58:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:58:13,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:13,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1] [2022-10-15 16:58:13,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-15 16:58:13,586 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1970262717, now seen corresponding path program 1 times [2022-10-15 16:58:13,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:13,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071797737] [2022-10-15 16:58:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071797737] [2022-10-15 16:58:13,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071797737] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369222276] [2022-10-15 16:58:13,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:13,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:13,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:13,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:58:13,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-15 16:58:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 47 conjunts are in the unsatisfiable core [2022-10-15 16:58:13,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:14,585 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 17 treesize of output 9 [2022-10-15 16:58:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:58:14,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:14,720 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-10-15 16:58:14,721 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 13 treesize of output 13 [2022-10-15 16:58:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:58:15,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369222276] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:15,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:15,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19, 19] total 47 [2022-10-15 16:58:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903897902] [2022-10-15 16:58:15,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:15,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-10-15 16:58:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:15,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-10-15 16:58:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2010, Unknown=0, NotChecked=0, Total=2162 [2022-10-15 16:58:15,579 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 47 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 39 states have internal predecessors, (81), 7 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 16:58:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:16,610 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-10-15 16:58:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-10-15 16:58:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 39 states have internal predecessors, (81), 7 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2022-10-15 16:58:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:16,612 INFO L225 Difference]: With dead ends: 82 [2022-10-15 16:58:16,612 INFO L226 Difference]: Without dead ends: 82 [2022-10-15 16:58:16,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=349, Invalid=3073, Unknown=0, NotChecked=0, Total=3422 [2022-10-15 16:58:16,615 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 218 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:16,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 843 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 16:58:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-10-15 16:58:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-10-15 16:58:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-15 16:58:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-10-15 16:58:16,619 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 39 [2022-10-15 16:58:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:16,620 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-10-15 16:58:16,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 39 states have internal predecessors, (81), 7 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 16:58:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-10-15 16:58:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:58:16,621 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:16,621 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:16,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:16,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-10-15 16:58:16,822 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 690399039, now seen corresponding path program 1 times [2022-10-15 16:58:16,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:16,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448390116] [2022-10-15 16:58:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-15 16:58:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-10-15 16:58:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 16:58:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448390116] [2022-10-15 16:58:17,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448390116] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:17,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877040884] [2022-10-15 16:58:17,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:17,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:17,107 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:58:17,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-15 16:58:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:17,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:58:17,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:58:17,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:58:17,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877040884] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:17,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-10-15 16:58:17,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937787363] [2022-10-15 16:58:17,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:17,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:58:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:17,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:58:17,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:58:17,746 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 18 states have internal predecessors, (91), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:18,082 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-10-15 16:58:18,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:58:18,084 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 18 states have internal predecessors, (91), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 39 [2022-10-15 16:58:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:18,085 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:58:18,085 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:58:18,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-10-15 16:58:18,087 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:18,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 222 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:58:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-10-15 16:58:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-10-15 16:58:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 16:58:18,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 39 [2022-10-15 16:58:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:18,092 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 16:58:18,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 18 states have internal predecessors, (91), 6 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-10-15 16:58:18,092 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 16:58:18,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 16:58:18,093 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:18,093 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:18,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:18,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-10-15 16:58:18,306 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:58:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1526211239, now seen corresponding path program 1 times [2022-10-15 16:58:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:18,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175057398] [2022-10-15 16:58:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:18,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:18,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:58:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:18,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:58:18,383 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:58:18,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-10-15 16:58:18,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2022-10-15 16:58:18,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2022-10-15 16:58:18,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2022-10-15 16:58:18,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2022-10-15 16:58:18,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2022-10-15 16:58:18,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2022-10-15 16:58:18,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2022-10-15 16:58:18,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2022-10-15 16:58:18,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2022-10-15 16:58:18,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2022-10-15 16:58:18,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2022-10-15 16:58:18,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2022-10-15 16:58:18,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2022-10-15 16:58:18,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2022-10-15 16:58:18,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2022-10-15 16:58:18,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2022-10-15 16:58:18,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2022-10-15 16:58:18,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-15 16:58:18,395 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:18,399 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:58:18,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:58:18 BoogieIcfgContainer [2022-10-15 16:58:18,452 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:58:18,453 INFO L158 Benchmark]: Toolchain (without parser) took 27718.44ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 127.4MB in the beginning and 161.2MB in the end (delta: -33.8MB). Peak memory consumption was 135.2MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,453 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:58:18,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.36ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 116.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.47ms. Allocated memory is still 153.1MB. Free memory was 116.6MB in the beginning and 114.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,454 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 153.1MB. Free memory was 114.8MB in the beginning and 113.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,455 INFO L158 Benchmark]: RCFGBuilder took 603.36ms. Allocated memory is still 153.1MB. Free memory was 113.4MB in the beginning and 99.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,455 INFO L158 Benchmark]: TraceAbstraction took 26764.28ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 98.4MB in the beginning and 161.2MB in the end (delta: -62.8MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. [2022-10-15 16:58:18,457 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 153.1MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.36ms. Allocated memory is still 153.1MB. Free memory was 127.0MB in the beginning and 116.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.47ms. Allocated memory is still 153.1MB. Free memory was 116.6MB in the beginning and 114.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 153.1MB. Free memory was 114.8MB in the beginning and 113.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 603.36ms. Allocated memory is still 153.1MB. Free memory was 113.4MB in the beginning and 99.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 26764.28ms. Allocated memory was 153.1MB in the beginning and 320.9MB in the end (delta: 167.8MB). Free memory was 98.4MB in the beginning and 161.2MB in the end (delta: -62.8MB). Peak memory consumption was 105.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 50]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 50. Possible FailurePath: [L11] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L34] CALL init() [L15] d1.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=6, d1={4:0}, d2={5:0}] [L16] d1.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, d1={4:0}, d2={5:0}] [L18] d2.a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=17, d1={4:0}, d2={5:0}] [L19] d2.b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, d1={4:0}, d2={5:0}] [L34] RET init() [L35] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L24] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L24] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L35] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}] [L35] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L35] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L24] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={4:0}, d1={4:0}, d2={5:0}] [L24] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L35] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={4:0}, pd1={4:0}] [L35] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L35] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L24] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=0, __VERIFIER_nondet_bool() ? &d1 : &d2={5:0}, d1={4:0}, d2={5:0}] [L24] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L35] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, get_dummy()={5:0}, pd1={4:0}, pd2={4:0}] [L35] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(), *pd3 = get_dummy(); [L36] int i = __VERIFIER_nondet_int(); [L37] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [d1={4:0}, d2={5:0}, i=-3, pd1={4:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={4:0}, pd3={5:0}] [L37] EXPR (*pd2).a VAL [(*pd2).a=6, d1={4:0}, d2={5:0}, i=-3, pd1={4:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={4:0}, pd3={5:0}] [L37] pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 VAL [(*pd2).a=6, d1={4:0}, d2={5:0}, i=-3, pd1={4:0}, pd1 != 0 && pd1 == pd2 && (*pd2).a > 0=1, pd2={4:0}, pd3={5:0}] [L37] COND TRUE pd1 != 0 && pd1 == pd2 && (*pd2).a > 0 [L38] int *pa = &pd1->a; VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:0}, pd1={4:0}, pd2={4:0}, pd3={5:0}] [L39] EXPR pd3->a VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:0}, pd1={4:0}, pd2={4:0}, pd3={5:0}, pd3->a=17] [L39] i = pd3->a - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=6, d1={4:0}, d2={5:0}, i=7, pa={4:0}, pd1={4:0}, pd2={4:0}, pd3={5:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(pd2, i) [L29] EXPR s1->a VAL [\old(i)=7, d1={4:0}, d2={5:0}, i=7, s1={4:0}, s1={4:0}, s1->a=6] [L29] return s1->a == i; [L43] RET, EXPR check(pd2, i) [L43] COND TRUE !check(pd2, i) [L50] reach_error() VAL [d1={4:0}, d2={5:0}, i=7, pa={4:0}, pd1={4:0}, pd2={4:0}, pd3={5:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3236 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3206 mSDsluCounter, 7476 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 208 IncrementalHoareTripleChecker+Unchecked, 6507 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6133 IncrementalHoareTripleChecker+Invalid, 6827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 969 mSDtfsCounter, 6133 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1128 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2551 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=6, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 466 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 1131 NumberOfCodeBlocks, 1119 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1419 ConstructedInterpolants, 6 QuantifiedInterpolants, 10961 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2089 ConjunctsInSsa, 249 ConjunctsInUnsatCore, 46 InterpolantComputations, 12 PerfectInterpolantSequences, 267/504 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:58:18,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...