/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/heap-data/shared_mem2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:47:02,159 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:47:02,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:47:02,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:47:02,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:47:02,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:47:02,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:47:02,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:47:02,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:47:02,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:47:02,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:47:02,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:47:02,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:47:02,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:47:02,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:47:02,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:47:02,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:47:02,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:47:02,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:47:02,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:47:02,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:47:02,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:47:02,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:47:02,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:47:02,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:47:02,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:47:02,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:47:02,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:47:02,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:47:02,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:47:02,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:47:02,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:47:02,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:47:02,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:47:02,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:47:02,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:47:02,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:47:02,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:47:02,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:47:02,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:47:02,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:47:02,322 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:47:02,383 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:47:02,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:47:02,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:47:02,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:47:02,387 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:47:02,387 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:47:02,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:47:02,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:47:02,391 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:47:02,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:47:02,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:47:02,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:47:02,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:47:02,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:47:02,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:47:02,394 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:47:02,394 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:47:02,394 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:47:02,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:47:02,395 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:47:02,395 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:47:02,395 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:47:02,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:47:02,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:47:02,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:47:02,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:02,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:47:02,397 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:47:02,397 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:47:02,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:47:02,398 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:47:02,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:47:02,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:47:02,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:47:02,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:47:02,844 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:47:02,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem2.i [2022-10-15 16:47:02,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae4ac555/91d4027f590945f090a63c8a809b6fac/FLAGdd36dc421 [2022-10-15 16:47:03,743 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:47:03,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem2.i [2022-10-15 16:47:03,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae4ac555/91d4027f590945f090a63c8a809b6fac/FLAGdd36dc421 [2022-10-15 16:47:03,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae4ac555/91d4027f590945f090a63c8a809b6fac [2022-10-15 16:47:03,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:47:03,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:47:03,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:03,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:47:03,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:47:03,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e4ad6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:03, skipping insertion in model container [2022-10-15 16:47:03,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:47:03" (1/1) ... [2022-10-15 16:47:03,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:47:04,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:47:04,660 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/heap-data/shared_mem2.i[23827,23840] [2022-10-15 16:47:04,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:04,687 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:47:04,763 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/heap-data/shared_mem2.i[23827,23840] [2022-10-15 16:47:04,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:47:04,805 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:47:04,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04 WrapperNode [2022-10-15 16:47:04,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:47:04,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:04,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:47:04,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:47:04,819 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:47:04" (1/1) ... [2022-10-15 16:47:04,837 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:47:04" (1/1) ... [2022-10-15 16:47:04,877 INFO L138 Inliner]: procedures = 121, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-10-15 16:47:04,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:47:04,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:47:04,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:47:04,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:47:04,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,913 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:47:04,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:47:04,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:47:04,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:47:04,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (1/1) ... [2022-10-15 16:47:04,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:47:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:05,019 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:47:05,037 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:47:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:47:05,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:47:05,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:47:05,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:47:05,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:47:05,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:47:05,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:47:05,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:47:05,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:47:05,312 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:47:05,331 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:47:05,757 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:47:05,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:47:05,766 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:47:05,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:05 BoogieIcfgContainer [2022-10-15 16:47:05,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:47:05,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:47:05,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:47:05,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:47:05,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:47:03" (1/3) ... [2022-10-15 16:47:05,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:05, skipping insertion in model container [2022-10-15 16:47:05,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:47:04" (2/3) ... [2022-10-15 16:47:05,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31aa688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:47:05, skipping insertion in model container [2022-10-15 16:47:05,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:47:05" (3/3) ... [2022-10-15 16:47:05,783 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2022-10-15 16:47:05,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:47:05,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2022-10-15 16:47:05,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:47:05,883 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;@70c80fc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:47:05,883 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2022-10-15 16:47:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 34 states have (on average 2.323529411764706) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 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:47:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:47:05,899 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:05,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:47:05,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:05,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-15 16:47:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:05,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042377058] [2022-10-15 16:47:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,357 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:47:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042377058] [2022-10-15 16:47:06,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042377058] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117529320] [2022-10-15 16:47:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,439 INFO L87 Difference]: Start difference. First operand has 73 states, 34 states have (on average 2.323529411764706) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:06,644 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-10-15 16:47:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:06,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:06,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:06,665 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:47:06,666 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 16:47:06,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,677 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:06,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 33 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:06,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 16:47:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-10-15 16:47:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-10-15 16:47:06,752 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 3 [2022-10-15 16:47:06,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:06,753 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-10-15 16:47:06,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-10-15 16:47:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-15 16:47:06,755 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:06,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-15 16:47:06,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:47:06,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:06,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:06,758 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-15 16:47:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:06,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457195819] [2022-10-15 16:47:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:06,904 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:47:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:06,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457195819] [2022-10-15 16:47:06,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457195819] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:06,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:06,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:06,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890011973] [2022-10-15 16:47:06,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:06,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:06,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:06,909 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:07,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,050 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-10-15 16:47:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,058 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:47:07,059 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:47:07,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,068 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:47:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 16:47:07,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-10-15 16:47:07,092 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 3 [2022-10-15 16:47:07,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,094 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-10-15 16:47:07,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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:47:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-10-15 16:47:07,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:07,097 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:07,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:47:07,098 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:07,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,100 INFO L85 PathProgramCache]: Analyzing trace with hash 28691810, now seen corresponding path program 1 times [2022-10-15 16:47:07,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028696011] [2022-10-15 16:47:07,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,222 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:47:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028696011] [2022-10-15 16:47:07,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028696011] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:07,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654978016] [2022-10-15 16:47:07,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,227 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,316 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-10-15 16:47:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:07,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,319 INFO L225 Difference]: With dead ends: 62 [2022-10-15 16:47:07,319 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:47:07,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,321 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:47:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-15 16:47:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 61 states have internal predecessors, (65), 0 states have call successors, (0), 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:47:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-10-15 16:47:07,330 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 5 [2022-10-15 16:47:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,331 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-10-15 16:47:07,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-10-15 16:47:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:47:07,332 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:47:07,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:47:07,333 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:07,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-10-15 16:47:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856508800] [2022-10-15 16:47:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,500 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:47:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856508800] [2022-10-15 16:47:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856508800] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670661910] [2022-10-15 16:47:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:07,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,506 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,590 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-10-15 16:47:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:47:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,592 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:47:07,593 INFO L226 Difference]: Without dead ends: 59 [2022-10-15 16:47:07,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,595 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:07,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-10-15 16:47:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-10-15 16:47:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.878787878787879) internal successors, (62), 58 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-10-15 16:47:07,604 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 5 [2022-10-15 16:47:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:07,604 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-10-15 16:47:07,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-10-15 16:47:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:47:07,605 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:07,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:47:07,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1845775668, now seen corresponding path program 1 times [2022-10-15 16:47:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:07,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144480410] [2022-10-15 16:47:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:07,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:07,872 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:47:07,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:07,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144480410] [2022-10-15 16:47:07,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144480410] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:07,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:07,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971075005] [2022-10-15 16:47:07,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:07,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:07,878 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:07,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:07,995 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-10-15 16:47:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:47:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:07,998 INFO L225 Difference]: With dead ends: 95 [2022-10-15 16:47:07,998 INFO L226 Difference]: Without dead ends: 95 [2022-10-15 16:47:07,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:08,006 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 50 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 98 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-10-15 16:47:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2022-10-15 16:47:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 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:47:08,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-10-15 16:47:08,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 12 [2022-10-15 16:47:08,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,037 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-10-15 16:47:08,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-10-15 16:47:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:47:08,038 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:47:08,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:08,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1845775667, now seen corresponding path program 1 times [2022-10-15 16:47:08,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071287207] [2022-10-15 16:47:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,226 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:47:08,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071287207] [2022-10-15 16:47:08,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071287207] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:47:08,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812169027] [2022-10-15 16:47:08,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:47:08,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:47:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:08,231 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,340 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-10-15 16:47:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:47:08,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:47:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,343 INFO L225 Difference]: With dead ends: 92 [2022-10-15 16:47:08,343 INFO L226 Difference]: Without dead ends: 92 [2022-10-15 16:47:08,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:47:08,347 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-15 16:47:08,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 53. [2022-10-15 16:47:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.696969696969697) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 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:47:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-10-15 16:47:08,363 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2022-10-15 16:47:08,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,364 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-10-15 16:47:08,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:08,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-10-15 16:47:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:47:08,365 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:47:08,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:08,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash -32335210, now seen corresponding path program 1 times [2022-10-15 16:47:08,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851275536] [2022-10-15 16:47:08,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,492 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:47:08,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851275536] [2022-10-15 16:47:08,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851275536] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156436001] [2022-10-15 16:47:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:08,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,497 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:47:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:08,599 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-10-15 16:47:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:08,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-10-15 16:47:08,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:08,601 INFO L225 Difference]: With dead ends: 58 [2022-10-15 16:47:08,601 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 16:47:08,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:08,607 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:08,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 25 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 16:47:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-10-15 16:47:08,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 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:47:08,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-10-15 16:47:08,631 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2022-10-15 16:47:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:08,632 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-10-15 16:47:08,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:47:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-10-15 16:47:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:47:08,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:08,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:08,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:47:08,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash -32335209, now seen corresponding path program 1 times [2022-10-15 16:47:08,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:08,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631363132] [2022-10-15 16:47:08,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:08,912 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:47:08,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:08,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631363132] [2022-10-15 16:47:08,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631363132] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:08,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:08,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:47:08,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138788491] [2022-10-15 16:47:08,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:08,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:47:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:08,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:47:08,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:47:08,916 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:47:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:09,055 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-10-15 16:47:09,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:47:09,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-10-15 16:47:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:09,058 INFO L225 Difference]: With dead ends: 72 [2022-10-15 16:47:09,058 INFO L226 Difference]: Without dead ends: 72 [2022-10-15 16:47:09,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:09,059 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:09,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 34 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-10-15 16:47:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2022-10-15 16:47:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 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:47:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2022-10-15 16:47:09,065 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 14 [2022-10-15 16:47:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,065 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2022-10-15 16:47:09,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:47:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-10-15 16:47:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:47:09,067 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:09,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:47:09,067 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1002391476, now seen corresponding path program 1 times [2022-10-15 16:47:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620955577] [2022-10-15 16:47:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:09,424 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:47:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:09,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620955577] [2022-10-15 16:47:09,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620955577] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:09,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:09,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:47:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295110173] [2022-10-15 16:47:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:09,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:47:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:47:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:09,429 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:09,698 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-10-15 16:47:09,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-15 16:47:09,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:47:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:09,701 INFO L225 Difference]: With dead ends: 117 [2022-10-15 16:47:09,701 INFO L226 Difference]: Without dead ends: 117 [2022-10-15 16:47:09,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:47:09,702 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 187 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:09,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 144 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-10-15 16:47:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 67. [2022-10-15 16:47:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-10-15 16:47:09,708 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 15 [2022-10-15 16:47:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:09,708 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-10-15 16:47:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-10-15 16:47:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:47:09,710 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:09,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:09,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:47:09,710 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1002391475, now seen corresponding path program 1 times [2022-10-15 16:47:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:09,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888239603] [2022-10-15 16:47:09,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:10,447 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:47:10,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888239603] [2022-10-15 16:47:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888239603] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:10,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:10,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:47:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477377554] [2022-10-15 16:47:10,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:47:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:10,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:47:10,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:10,451 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:10,725 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-10-15 16:47:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:47:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:47:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:10,727 INFO L225 Difference]: With dead ends: 116 [2022-10-15 16:47:10,728 INFO L226 Difference]: Without dead ends: 116 [2022-10-15 16:47:10,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:47:10,729 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 258 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:10,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 144 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:47:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-15 16:47:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 67. [2022-10-15 16:47:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-10-15 16:47:10,734 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 15 [2022-10-15 16:47:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:10,735 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-10-15 16:47:10,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-10-15 16:47:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:47:10,736 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:10,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:10,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:47:10,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1009389413, now seen corresponding path program 1 times [2022-10-15 16:47:10,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:10,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474358440] [2022-10-15 16:47:10,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:10,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:10,926 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:47:10,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:10,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474358440] [2022-10-15 16:47:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474358440] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:10,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:47:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435192866] [2022-10-15 16:47:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:47:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:47:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:47:10,929 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:11,026 INFO L93 Difference]: Finished difference Result 99 states and 118 transitions. [2022-10-15 16:47:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:47:11,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:47:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:11,027 INFO L225 Difference]: With dead ends: 99 [2022-10-15 16:47:11,028 INFO L226 Difference]: Without dead ends: 99 [2022-10-15 16:47:11,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:47:11,029 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 58 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:11,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 119 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-10-15 16:47:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2022-10-15 16:47:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 64 states have (on average 1.546875) internal successors, (99), 77 states have internal predecessors, (99), 0 states have call successors, (0), 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:47:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2022-10-15 16:47:11,034 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 16 [2022-10-15 16:47:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:11,035 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2022-10-15 16:47:11,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2022-10-15 16:47:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:47:11,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:11,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:47:11,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash -916117740, now seen corresponding path program 1 times [2022-10-15 16:47:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733540378] [2022-10-15 16:47:11,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,124 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:47:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:11,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733540378] [2022-10-15 16:47:11,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733540378] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:11,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:11,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:11,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628978911] [2022-10-15 16:47:11,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:11,127 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:11,230 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2022-10-15 16:47:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:47:11,231 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:47:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:11,232 INFO L225 Difference]: With dead ends: 80 [2022-10-15 16:47:11,232 INFO L226 Difference]: Without dead ends: 80 [2022-10-15 16:47:11,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:11,234 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:11,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 74 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-10-15 16:47:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2022-10-15 16:47:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.484375) internal successors, (95), 75 states have internal predecessors, (95), 0 states have call successors, (0), 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:47:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 95 transitions. [2022-10-15 16:47:11,248 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 95 transitions. Word has length 19 [2022-10-15 16:47:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:11,249 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 95 transitions. [2022-10-15 16:47:11,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 95 transitions. [2022-10-15 16:47:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:47:11,250 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:11,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:11,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:47:11,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:11,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:11,252 INFO L85 PathProgramCache]: Analyzing trace with hash -916117739, now seen corresponding path program 1 times [2022-10-15 16:47:11,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:11,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343743389] [2022-10-15 16:47:11,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:11,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,404 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:47:11,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:11,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343743389] [2022-10-15 16:47:11,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343743389] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:11,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:47:11,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:47:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309322476] [2022-10-15 16:47:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:11,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:47:11,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:11,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:47:11,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:47:11,408 INFO L87 Difference]: Start difference. First operand 76 states and 95 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:11,530 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-10-15 16:47:11,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:47:11,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:47:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:11,532 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:47:11,532 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:47:11,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:47:11,534 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:11,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:47:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:47:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-10-15 16:47:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.421875) internal successors, (91), 73 states have internal predecessors, (91), 0 states have call successors, (0), 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:47:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 91 transitions. [2022-10-15 16:47:11,539 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 91 transitions. Word has length 19 [2022-10-15 16:47:11,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:11,539 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 91 transitions. [2022-10-15 16:47:11,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-10-15 16:47:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:11,541 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:11,541 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:11,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 16:47:11,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:11,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:11,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1396680235, now seen corresponding path program 1 times [2022-10-15 16:47:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:11,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028459135] [2022-10-15 16:47:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:11,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:11,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028459135] [2022-10-15 16:47:11,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028459135] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:11,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686121171] [2022-10-15 16:47:11,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:11,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:11,753 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:47:11,774 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:47:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:11,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 16:47:11,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:11,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:12,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:12,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-10-15 16:47:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:12,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:12,518 INFO L356 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-10-15 16:47:12,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2022-10-15 16:47:12,645 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 14 treesize of output 12 [2022-10-15 16:47:12,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-10-15 16:47:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:12,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686121171] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:12,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:12,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2022-10-15 16:47:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124521349] [2022-10-15 16:47:12,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:12,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:47:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:47:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:47:12,672 INFO L87 Difference]: Start difference. First operand 74 states and 91 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:12,908 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2022-10-15 16:47:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:47:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:12,911 INFO L225 Difference]: With dead ends: 90 [2022-10-15 16:47:12,911 INFO L226 Difference]: Without dead ends: 90 [2022-10-15 16:47:12,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:47:12,913 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 58 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:12,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 200 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 132 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-10-15 16:47:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-15 16:47:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2022-10-15 16:47:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.411764705882353) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2022-10-15 16:47:12,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 22 [2022-10-15 16:47:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:12,919 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2022-10-15 16:47:12,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 15 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2022-10-15 16:47:12,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:12,920 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:12,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:12,965 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:47:13,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-10-15 16:47:13,136 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1396680234, now seen corresponding path program 1 times [2022-10-15 16:47:13,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9291099] [2022-10-15 16:47:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:13,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9291099] [2022-10-15 16:47:13,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9291099] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213338168] [2022-10-15 16:47:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:13,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:13,563 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:47:13,580 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:47:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:13,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2022-10-15 16:47:13,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:13,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:13,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:13,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:13,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:13,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:13,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:13,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-10-15 16:47:13,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:13,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:14,095 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 29 treesize of output 17 [2022-10-15 16:47:14,112 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 32 treesize of output 14 [2022-10-15 16:47:14,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:14,210 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 29 treesize of output 21 [2022-10-15 16:47:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:14,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:47:14,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213338168] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:47:14,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:47:14,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 17 [2022-10-15 16:47:14,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955101895] [2022-10-15 16:47:14,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:47:14,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:47:14,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:14,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:47:14,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:47:14,249 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:14,722 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-10-15 16:47:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:47:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:14,724 INFO L225 Difference]: With dead ends: 74 [2022-10-15 16:47:14,724 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 16:47:14,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2022-10-15 16:47:14,725 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 59 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:14,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 193 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2022-10-15 16:47:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 16:47:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2022-10-15 16:47:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 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:47:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-10-15 16:47:14,733 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 22 [2022-10-15 16:47:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-10-15 16:47:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-10-15 16:47:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:14,735 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:14,735 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:14,774 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:47:14,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-10-15 16:47:14,937 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1147965894, now seen corresponding path program 1 times [2022-10-15 16:47:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:14,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735302532] [2022-10-15 16:47:14,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:14,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:15,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:15,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:15,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735302532] [2022-10-15 16:47:15,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735302532] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:15,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765774671] [2022-10-15 16:47:15,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:15,552 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:47:15,588 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:47:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:15,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:47:15,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:15,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:15,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:15,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:15,811 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:15,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:15,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:15,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:15,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:15,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:15,962 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-15 16:47:15,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-15 16:47:16,027 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 21 treesize of output 9 [2022-10-15 16:47:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:16,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:16,048 INFO L356 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-10-15 16:47:16,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2022-10-15 16:47:16,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_526 Int)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_524))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8) v_ArrVal_526))) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) is different from false [2022-10-15 16:47:16,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_13| Int) (v_ArrVal_524 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_21| Int) (v_ArrVal_526 Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_21|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_13|) 0)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_13| v_ArrVal_524) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_21|) v_ArrVal_526) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-10-15 16:47:16,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~n~0#1.base_13| Int) (v_ArrVal_524 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_21| Int) (v_ArrVal_526 Int)) (or (not (<= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~list~0#1.offset_21|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_13|) 0)) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8) |c_ULTIMATE.start_main_~head~0#1.base|)) |v_ULTIMATE.start_main_~n~0#1.base_13| v_ArrVal_524) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_21|) v_ArrVal_526) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))))) is different from false [2022-10-15 16:47:16,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:16,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-15 16:47:16,280 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 58 treesize of output 50 [2022-10-15 16:47:16,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:16,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 16:47:16,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:16,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-10-15 16:47:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:16,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765774671] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:16,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:16,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2022-10-15 16:47:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283656731] [2022-10-15 16:47:16,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 16:47:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 16:47:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=453, Unknown=4, NotChecked=138, Total=702 [2022-10-15 16:47:16,324 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:17,767 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-10-15 16:47:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 16:47:17,767 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:17,768 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:47:17,769 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 16:47:17,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=292, Invalid=837, Unknown=5, NotChecked=198, Total=1332 [2022-10-15 16:47:17,771 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 328 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 377 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:17,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 289 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 488 Invalid, 0 Unknown, 377 Unchecked, 0.4s Time] [2022-10-15 16:47:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 16:47:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 65. [2022-10-15 16:47:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 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:47:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-10-15 16:47:17,776 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2022-10-15 16:47:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:17,776 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-10-15 16:47:17,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-10-15 16:47:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:47:17,777 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:17,778 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:17,825 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:47:17,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:17,991 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1147965895, now seen corresponding path program 1 times [2022-10-15 16:47:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990991354] [2022-10-15 16:47:17,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:17,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:19,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:19,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990991354] [2022-10-15 16:47:19,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990991354] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:19,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162753836] [2022-10-15 16:47:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:19,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:19,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:19,097 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:47:19,105 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:47:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:19,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 43 conjunts are in the unsatisfiable core [2022-10-15 16:47:19,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:19,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:19,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:19,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:19,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:19,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:19,429 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:19,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:19,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:19,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:47:19,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:47:19,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:19,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:47:19,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-10-15 16:47:19,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:19,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-10-15 16:47:19,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:47:19,631 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-10-15 16:47:19,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-15 16:47:19,763 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 29 treesize of output 17 [2022-10-15 16:47:19,767 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 32 treesize of output 14 [2022-10-15 16:47:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:19,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:19,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:19,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-10-15 16:47:20,036 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_653 Int) (v_ArrVal_648 (Array Int Int))) (= |c_ULTIMATE.start_main_~m~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_648))) (store .cse0 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_653))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_651 Int) (v_ArrVal_649 (Array Int Int))) (<= 0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_649))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_651))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (forall ((v_ArrVal_651 Int) (v_ArrVal_649 (Array Int Int))) (< (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_649))) (store .cse4 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1 v_ArrVal_651))) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_main_~m~0#1.offset| 1))))) is different from false [2022-10-15 16:47:31,012 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-15 16:47:41,696 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-15 16:47:41,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:41,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-15 16:47:41,777 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 58 treesize of output 50 [2022-10-15 16:47:41,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:41,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-10-15 16:47:41,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:41,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-10-15 16:47:41,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:41,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-10-15 16:47:41,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:41,816 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 25 treesize of output 21 [2022-10-15 16:47:41,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:47:41,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-10-15 16:47:41,836 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-10-15 16:47:41,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 1 [2022-10-15 16:47:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:45,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162753836] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:45,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:45,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2022-10-15 16:47:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254086163] [2022-10-15 16:47:45,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:45,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 16:47:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:45,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 16:47:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=706, Unknown=10, NotChecked=56, Total=930 [2022-10-15 16:47:45,921 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 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:47:47,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:47,187 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-10-15 16:47:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-10-15 16:47:47,187 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:47:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:47,188 INFO L225 Difference]: With dead ends: 107 [2022-10-15 16:47:47,189 INFO L226 Difference]: Without dead ends: 107 [2022-10-15 16:47:47,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=441, Invalid=1357, Unknown=12, NotChecked=82, Total=1892 [2022-10-15 16:47:47,190 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 566 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:47,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 321 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 483 Invalid, 0 Unknown, 217 Unchecked, 0.5s Time] [2022-10-15 16:47:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-10-15 16:47:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 65. [2022-10-15 16:47:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.309090909090909) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 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:47:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-10-15 16:47:47,197 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 22 [2022-10-15 16:47:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:47,197 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-10-15 16:47:47,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9666666666666666) internal successors, (59), 31 states have internal predecessors, (59), 0 states have call successors, (0), 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:47:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-10-15 16:47:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 16:47:47,201 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:47,201 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:47,238 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:47:47,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 16:47:47,402 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:47,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1227179617, now seen corresponding path program 1 times [2022-10-15 16:47:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:47,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208738340] [2022-10-15 16:47:47,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:47,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208738340] [2022-10-15 16:47:47,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208738340] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:47,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639836174] [2022-10-15 16:47:47,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:47,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:47,775 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:47:47,783 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:47:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:47,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-15 16:47:47,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:47,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:47,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 16:47:47,932 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:47:47,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:47:47,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:47,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,072 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-15 16:47:48,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:47:48,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:47:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:48,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:48,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse0 100) (= 100 .cse0)))) is different from false [2022-10-15 16:47:48,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_772 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (= .cse0 100) (< .cse0 100)))) is different from false [2022-10-15 16:47:48,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_773 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int) (v_ArrVal_772 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_772) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (= .cse0 100) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_16|) 0)) (< .cse0 100)))) is different from false [2022-10-15 16:47:48,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (v_ArrVal_773 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int) (v_ArrVal_772 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_768) |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_772) |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (< .cse0 100) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~n~0#1.base_16|) 0)) (= .cse0 100)))) is different from false [2022-10-15 16:47:48,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_768 (Array Int Int)) (|v_ULTIMATE.start_main_~head~0#1.base_19| Int) (v_ArrVal_773 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.base_16| Int) (v_ArrVal_772 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_main_~head~0#1.base_19| v_ArrVal_768) |v_ULTIMATE.start_main_~n~0#1.base_16| v_ArrVal_772) |v_ULTIMATE.start_main_~head~0#1.base_19| v_ArrVal_773) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~head~0#1.base_19|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~head~0#1.base_19| 1) |v_ULTIMATE.start_main_~n~0#1.base_16|) 0)) (< .cse0 100) (= .cse0 100)))) is different from false [2022-10-15 16:47:48,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:48,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 41 [2022-10-15 16:47:48,495 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 475 treesize of output 455 [2022-10-15 16:47:48,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 419 [2022-10-15 16:47:48,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 203 [2022-10-15 16:47:48,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 411 treesize of output 395 [2022-10-15 16:47:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:49,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639836174] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:49,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:49,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 28 [2022-10-15 16:47:49,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381755347] [2022-10-15 16:47:49,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:49,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-10-15 16:47:49,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-10-15 16:47:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=403, Unknown=6, NotChecked=230, Total=756 [2022-10-15 16:47:49,221 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:49,799 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-10-15 16:47:49,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 16:47:49,800 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-10-15 16:47:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:49,801 INFO L225 Difference]: With dead ends: 110 [2022-10-15 16:47:49,801 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:47:49,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=842, Unknown=6, NotChecked=340, Total=1482 [2022-10-15 16:47:49,803 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 213 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:49,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 345 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 247 Invalid, 0 Unknown, 444 Unchecked, 0.2s Time] [2022-10-15 16:47:49,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:47:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-10-15 16:47:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 87 states have internal predecessors, (105), 0 states have call successors, (0), 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:47:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2022-10-15 16:47:49,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 23 [2022-10-15 16:47:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:49,808 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2022-10-15 16:47:49,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 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:47:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-10-15 16:47:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 16:47:49,808 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:49,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:49,862 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:47:50,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 16:47:50,028 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:50,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:50,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1732579083, now seen corresponding path program 1 times [2022-10-15 16:47:50,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:50,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904202346] [2022-10-15 16:47:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:50,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:50,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:50,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904202346] [2022-10-15 16:47:50,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904202346] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:50,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649117253] [2022-10-15 16:47:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:50,463 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:47:50,464 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:47:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:50,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-10-15 16:47:50,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:50,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:50,591 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:50,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:50,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:50,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-10-15 16:47:50,786 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:50,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-10-15 16:47:50,805 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:50,805 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 29 treesize of output 11 [2022-10-15 16:47:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:50,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:50,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) v_ArrVal_847) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) 1)) is different from false [2022-10-15 16:47:50,914 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-10-15 16:47:50,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-10-15 16:47:50,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) v_ArrVal_847) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) |c_ULTIMATE.start_main_~list~0#1.base|)) is different from false [2022-10-15 16:47:50,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_847) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) is different from false [2022-10-15 16:47:50,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store .cse0 .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (select .cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) v_ArrVal_847)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))) is different from false [2022-10-15 16:47:50,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:50,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-10-15 16:47:50,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:50,963 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 46 treesize of output 28 [2022-10-15 16:47:50,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-10-15 16:47:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-15 16:47:50,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649117253] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:50,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:50,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 23 [2022-10-15 16:47:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704271629] [2022-10-15 16:47:50,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:50,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-10-15 16:47:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:50,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-10-15 16:47:50,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=313, Unknown=10, NotChecked=156, Total=552 [2022-10-15 16:47:50,993 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:51,702 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2022-10-15 16:47:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:47:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-10-15 16:47:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:51,704 INFO L225 Difference]: With dead ends: 105 [2022-10-15 16:47:51,704 INFO L226 Difference]: Without dead ends: 105 [2022-10-15 16:47:51,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=236, Invalid=700, Unknown=10, NotChecked=244, Total=1190 [2022-10-15 16:47:51,705 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 248 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:51,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 150 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 318 Invalid, 0 Unknown, 290 Unchecked, 0.3s Time] [2022-10-15 16:47:51,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-10-15 16:47:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2022-10-15 16:47:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 97 states have internal predecessors, (117), 0 states have call successors, (0), 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:47:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2022-10-15 16:47:51,710 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 27 [2022-10-15 16:47:51,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:51,710 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2022-10-15 16:47:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:47:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-10-15 16:47:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-10-15 16:47:51,711 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:51,711 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:51,747 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:47:51,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:51,924 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:51,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:51,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1732579082, now seen corresponding path program 1 times [2022-10-15 16:47:51,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:51,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134488579] [2022-10-15 16:47:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:51,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:52,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134488579] [2022-10-15 16:47:52,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134488579] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:52,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174338009] [2022-10-15 16:47:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:52,784 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:47:52,786 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:47:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:52,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 16:47:52,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:52,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:52,907 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:52,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:52,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:52,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:52,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-10-15 16:47:53,158 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:53,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-10-15 16:47:53,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-10-15 16:47:53,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-10-15 16:47:53,203 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 19 treesize of output 7 [2022-10-15 16:47:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:53,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:53,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:53,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2022-10-15 16:47:53,395 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_924 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_924 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_924) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) (+ 5 |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_ArrVal_923 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))))) is different from false [2022-10-15 16:47:53,429 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_924 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_924) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) (+ 5 |c_ULTIMATE.start_main_~list~0#1.offset|))) (forall ((v_ArrVal_924 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_924) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_923 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))))) is different from false [2022-10-15 16:47:53,500 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_924 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_924) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) (+ 5 |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_924 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_924) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_923 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) is different from false [2022-10-15 16:47:53,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:53,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-10-15 16:47:53,541 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 52 treesize of output 40 [2022-10-15 16:47:53,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-10-15 16:47:53,554 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-10-15 16:47:53,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1 [2022-10-15 16:47:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-10-15 16:47:53,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174338009] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:53,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:53,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 26 [2022-10-15 16:47:53,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053196185] [2022-10-15 16:47:53,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:53,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 16:47:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 16:47:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=480, Unknown=3, NotChecked=138, Total=702 [2022-10-15 16:47:53,648 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 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:47:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:54,646 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2022-10-15 16:47:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:47:54,647 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 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 27 [2022-10-15 16:47:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:54,648 INFO L225 Difference]: With dead ends: 147 [2022-10-15 16:47:54,648 INFO L226 Difference]: Without dead ends: 147 [2022-10-15 16:47:54,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1027, Unknown=4, NotChecked=210, Total=1482 [2022-10-15 16:47:54,650 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 305 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:54,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 230 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 415 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2022-10-15 16:47:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-10-15 16:47:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 100. [2022-10-15 16:47:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 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:47:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-10-15 16:47:54,655 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 27 [2022-10-15 16:47:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:54,655 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-10-15 16:47:54,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 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:47:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-10-15 16:47:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:47:54,656 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:54,657 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:54,696 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:47:54,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:54,873 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2124623309, now seen corresponding path program 1 times [2022-10-15 16:47:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:54,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766783445] [2022-10-15 16:47:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:54,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766783445] [2022-10-15 16:47:55,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766783445] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:55,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976039695] [2022-10-15 16:47:55,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:55,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:55,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:55,754 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:47:55,775 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:47:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:55,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2022-10-15 16:47:55,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:55,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:55,882 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:55,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:55,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:55,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:55,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-10-15 16:47:56,165 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:56,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-10-15 16:47:56,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-10-15 16:47:56,202 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 19 treesize of output 7 [2022-10-15 16:47:56,316 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-10-15 16:47:56,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 22 [2022-10-15 16:47:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:56,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:56,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1000))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1001) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)))) 1)) is different from false [2022-10-15 16:47:56,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= (select |c_#valid| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1000))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1001) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4)))) 1)) is different from false [2022-10-15 16:47:56,477 INFO L356 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2022-10-15 16:47:56,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2022-10-15 16:47:56,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1000))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1001) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))))) is different from false [2022-10-15 16:47:56,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1000))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1001) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 4))) .cse2))) is different from false [2022-10-15 16:47:56,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1000 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1000))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1001) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 4))) .cse2))) is different from false [2022-10-15 16:47:56,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:56,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 85 [2022-10-15 16:47:56,530 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 160 treesize of output 148 [2022-10-15 16:47:56,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-10-15 16:47:56,653 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 38 treesize of output 28 [2022-10-15 16:47:56,662 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:56,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2022-10-15 16:47:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-10-15 16:47:56,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976039695] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:47:56,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:47:56,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 32 [2022-10-15 16:47:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960454193] [2022-10-15 16:47:56,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:47:56,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-15 16:47:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:47:56,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-15 16:47:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=647, Unknown=6, NotChecked=280, Total=1056 [2022-10-15 16:47:56,698 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 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:47:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:47:57,553 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-10-15 16:47:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 16:47:57,553 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-10-15 16:47:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:47:57,555 INFO L225 Difference]: With dead ends: 112 [2022-10-15 16:47:57,555 INFO L226 Difference]: Without dead ends: 112 [2022-10-15 16:47:57,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=266, Invalid=1154, Unknown=6, NotChecked=380, Total=1806 [2022-10-15 16:47:57,558 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:47:57,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 360 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 266 Invalid, 0 Unknown, 311 Unchecked, 0.2s Time] [2022-10-15 16:47:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-10-15 16:47:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-10-15 16:47:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 99 states have internal predecessors, (120), 0 states have call successors, (0), 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:47:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-10-15 16:47:57,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 28 [2022-10-15 16:47:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:47:57,564 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-10-15 16:47:57,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 33 states have internal predecessors, (79), 0 states have call successors, (0), 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:47:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-10-15 16:47:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-10-15 16:47:57,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:47:57,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:47:57,591 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:47:57,770 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,SelfDestructingSolverStorable20 [2022-10-15 16:47:57,771 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2022-10-15 16:47:57,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:47:57,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2124623310, now seen corresponding path program 1 times [2022-10-15 16:47:57,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:47:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059788988] [2022-10-15 16:47:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:47:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:58,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:47:58,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059788988] [2022-10-15 16:47:58,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059788988] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:47:58,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424110676] [2022-10-15 16:47:58,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:47:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:47:58,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:47:58,910 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:47:58,932 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:47:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:47:59,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 44 conjunts are in the unsatisfiable core [2022-10-15 16:47:59,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:47:59,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:47:59,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:47:59,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:47:59,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:59,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-10-15 16:47:59,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:47:59,427 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-10-15 16:47:59,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2022-10-15 16:47:59,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-10-15 16:47:59,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2022-10-15 16:47:59,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:59,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 17 [2022-10-15 16:47:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:47:59,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:47:59,804 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1077)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1078))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (<= 0 (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1077))) (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4))))))) is different from false [2022-10-15 16:47:59,834 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)))) (and (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1077)) (.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1078))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 4) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (forall ((v_ArrVal_1078 (Array Int Int)) (v_ArrVal_1077 (Array Int Int))) (<= 0 (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1077))) (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1078) |c_ULTIMATE.start_main_~list~0#1.base|) .cse4)) (+ (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4) 4))))))) is different from false [2022-10-15 16:47:59,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:47:59,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 159 [2022-10-15 16:48:00,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:48:00,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 260 treesize of output 218 [2022-10-15 16:48:00,640 INFO L356 Elim1Store]: treesize reduction 300, result has 50.5 percent of original size [2022-10-15 16:48:00,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 740 treesize of output 853 [2022-10-15 16:48:00,682 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:48:00,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 657 treesize of output 659 [2022-10-15 16:48:00,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 517 [2022-10-15 16:48:00,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:48:00,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 637 treesize of output 639