/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/list-ext2-properties/simple_search_value-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:59:06,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:59:06,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:59:06,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:59:06,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:59:06,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:59:06,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:59:06,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:59:06,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:59:06,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:59:06,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:59:06,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:59:06,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:59:06,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:59:06,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:59:06,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:59:06,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:59:06,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:59:06,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:59:06,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:59:06,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:59:06,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:59:06,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:59:06,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:59:06,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:59:06,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:59:06,561 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:59:06,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:59:06,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:59:06,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:59:06,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:59:06,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:59:06,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:59:06,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:59:06,571 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:59:06,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:59:06,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:59:06,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:59:06,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:59:06,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:59:06,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:59:06,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:59:06,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:59:06,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:59:06,612 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:59:06,612 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:59:06,613 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:59:06,613 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:59:06,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:59:06,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:59:06,614 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:59:06,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:59:06,615 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:59:06,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:59:06,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:59:06,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:59:06,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:59:06,616 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:59:06,616 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:59:06,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:59:06,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:59:06,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:59:06,617 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:59:06,617 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:59:06,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:59:06,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:59:06,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:59:06,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:59:06,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:59:06,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:59:06,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:59:06,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:59:06,620 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:59:07,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:59:07,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:59:07,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:59:07,076 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:59:07,077 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:59:07,081 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2022-10-15 16:59:07,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb27b48/d1718ddcf8c64073b1256856f842979f/FLAG39a454f15 [2022-10-15 16:59:08,137 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:59:08,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2022-10-15 16:59:08,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb27b48/d1718ddcf8c64073b1256856f842979f/FLAG39a454f15 [2022-10-15 16:59:08,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64cb27b48/d1718ddcf8c64073b1256856f842979f [2022-10-15 16:59:08,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:59:08,454 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:59:08,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:59:08,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:59:08,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:59:08,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba60aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:08, skipping insertion in model container [2022-10-15 16:59:08,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:59:08" (1/1) ... [2022-10-15 16:59:08,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:59:08,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:59:09,184 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/list-ext2-properties/simple_search_value-2.i[23220,23233] [2022-10-15 16:59:09,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:59:09,200 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:59:09,243 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/list-ext2-properties/simple_search_value-2.i[23220,23233] [2022-10-15 16:59:09,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:59:09,281 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:59:09,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09 WrapperNode [2022-10-15 16:59:09,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:59:09,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:59:09,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:59:09,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:59:09,294 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:59:09" (1/1) ... [2022-10-15 16:59:09,312 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:59:09" (1/1) ... [2022-10-15 16:59:09,343 INFO L138 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-10-15 16:59:09,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:59:09,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:59:09,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:59:09,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:59:09,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,376 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:59:09,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:59:09,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:59:09,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:59:09,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (1/1) ... [2022-10-15 16:59:09,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:59:09,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:09,431 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:59:09,466 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:59:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-10-15 16:59:09,526 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-10-15 16:59:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:59:09,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:59:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:59:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:59:09,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:59:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:59:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:59:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:59:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:59:09,656 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:59:09,660 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:59:09,747 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-10-15 16:59:10,329 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:59:10,340 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:59:10,340 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:59:10,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:59:10 BoogieIcfgContainer [2022-10-15 16:59:10,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:59:10,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:59:10,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:59:10,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:59:10,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:59:08" (1/3) ... [2022-10-15 16:59:10,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277fbcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:59:10, skipping insertion in model container [2022-10-15 16:59:10,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:59:09" (2/3) ... [2022-10-15 16:59:10,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277fbcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:59:10, skipping insertion in model container [2022-10-15 16:59:10,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:59:10" (3/3) ... [2022-10-15 16:59:10,359 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2022-10-15 16:59:10,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:59:10,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 16:59:10,525 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:59:10,541 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;@4d41fddf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:59:10,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 16:59:10,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 16:59:10,569 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:10,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 16:59:10,572 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517416, now seen corresponding path program 1 times [2022-10-15 16:59:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:10,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394414632] [2022-10-15 16:59:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:10,818 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:59:10,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:10,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394414632] [2022-10-15 16:59:10,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394414632] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:10,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:10,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:59:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105548014] [2022-10-15 16:59:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:10,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-15 16:59:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:10,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-15 16:59:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:59:10,880 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 49 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:10,906 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-10-15 16:59:10,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-15 16:59:10,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 16:59:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:10,918 INFO L225 Difference]: With dead ends: 51 [2022-10-15 16:59:10,919 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:59:10,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-15 16:59:10,927 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:10,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:59:10,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:59:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 16:59:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 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:59:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-10-15 16:59:10,980 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 6 [2022-10-15 16:59:10,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:10,980 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-10-15 16:59:10,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-10-15 16:59:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:59:10,982 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:10,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:10,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:59:10,983 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash 620871745, now seen corresponding path program 1 times [2022-10-15 16:59:10,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:10,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787043010] [2022-10-15 16:59:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:11,087 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:59:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:11,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787043010] [2022-10-15 16:59:11,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787043010] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:11,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:11,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:59:11,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344990203] [2022-10-15 16:59:11,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:11,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:59:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:59:11,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:59:11,093 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:11,118 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-10-15 16:59:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:59:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-15 16:59:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:11,122 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:59:11,122 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:59:11,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:59:11,125 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:11,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:59:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:59:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 16:59:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 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:59:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-10-15 16:59:11,137 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 8 [2022-10-15 16:59:11,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:11,138 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-10-15 16:59:11,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-10-15 16:59:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:59:11,140 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:11,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:11,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:59:11,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2022-10-15 16:59:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:11,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960875590] [2022-10-15 16:59:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:11,358 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:59:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:11,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960875590] [2022-10-15 16:59:11,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960875590] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:11,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:11,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:59:11,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083455026] [2022-10-15 16:59:11,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:11,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:11,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:11,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:11,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:11,365 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:11,515 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2022-10-15 16:59:11,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:11,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-15 16:59:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:11,517 INFO L225 Difference]: With dead ends: 58 [2022-10-15 16:59:11,518 INFO L226 Difference]: Without dead ends: 58 [2022-10-15 16:59:11,518 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:59:11,521 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:11,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-10-15 16:59:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2022-10-15 16:59:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 48 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:59:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-10-15 16:59:11,531 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 8 [2022-10-15 16:59:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:11,532 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-10-15 16:59:11,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-10-15 16:59:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:59:11,534 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:11,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:11,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:59:11,535 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2022-10-15 16:59:11,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:11,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627602680] [2022-10-15 16:59:11,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:11,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:11,795 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:59:11,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627602680] [2022-10-15 16:59:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627602680] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:11,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:11,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:59:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066701834] [2022-10-15 16:59:11,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:11,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:11,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:11,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:11,801 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:11,972 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-10-15 16:59:11,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:11,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-10-15 16:59:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:11,975 INFO L225 Difference]: With dead ends: 67 [2022-10-15 16:59:11,975 INFO L226 Difference]: Without dead ends: 67 [2022-10-15 16:59:11,976 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:59:11,979 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 89 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:11,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 37 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:11,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-10-15 16:59:11,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2022-10-15 16:59:11,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.488888888888889) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 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:59:11,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2022-10-15 16:59:11,990 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 8 [2022-10-15 16:59:11,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:11,990 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2022-10-15 16:59:11,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:59:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2022-10-15 16:59:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:59:11,992 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:11,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:11,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:59:11,993 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:11,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1237337249, now seen corresponding path program 1 times [2022-10-15 16:59:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:11,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420635826] [2022-10-15 16:59:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:12,248 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:59:12,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420635826] [2022-10-15 16:59:12,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420635826] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:12,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:12,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:59:12,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410404953] [2022-10-15 16:59:12,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:12,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:12,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:12,260 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:12,334 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-10-15 16:59:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:59:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 16:59:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:12,341 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:59:12,341 INFO L226 Difference]: Without dead ends: 56 [2022-10-15 16:59:12,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:12,352 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:12,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:59:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-10-15 16:59:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-10-15 16:59:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 54 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:59:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-10-15 16:59:12,378 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 13 [2022-10-15 16:59:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:12,378 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-10-15 16:59:12,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-10-15 16:59:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:59:12,380 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:12,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:12,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:59:12,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:12,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2022-10-15 16:59:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:12,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454340657] [2022-10-15 16:59:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:12,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454340657] [2022-10-15 16:59:12,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454340657] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:12,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:12,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710567785] [2022-10-15 16:59:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:12,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:59:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:59:12,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:12,682 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:12,852 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2022-10-15 16:59:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:59:12,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:59:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:12,854 INFO L225 Difference]: With dead ends: 53 [2022-10-15 16:59:12,855 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 16:59:12,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:59:12,859 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:12,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 78 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 16:59:12,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-10-15 16:59:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-10-15 16:59:12,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 17 [2022-10-15 16:59:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:12,891 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-10-15 16:59:12,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-10-15 16:59:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:59:12,893 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:12,894 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:12,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:59:12,895 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2022-10-15 16:59:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:12,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345188741] [2022-10-15 16:59:12,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:13,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345188741] [2022-10-15 16:59:13,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345188741] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:13,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:13,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:13,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132704918] [2022-10-15 16:59:13,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:13,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:59:13,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:13,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:59:13,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:13,286 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:13,573 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-10-15 16:59:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:59:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:59:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:13,576 INFO L225 Difference]: With dead ends: 49 [2022-10-15 16:59:13,576 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 16:59:13,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:59:13,586 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:13,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 87 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:13,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 16:59:13,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-10-15 16:59:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 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:59:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-10-15 16:59:13,606 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 17 [2022-10-15 16:59:13,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:13,607 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-10-15 16:59:13,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-10-15 16:59:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:59:13,610 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:13,610 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:59:13,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:59:13,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 843649957, now seen corresponding path program 1 times [2022-10-15 16:59:13,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:13,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671692646] [2022-10-15 16:59:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:13,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:13,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671692646] [2022-10-15 16:59:13,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671692646] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:13,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528476715] [2022-10-15 16:59:13,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:13,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:13,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:13,781 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:59:13,805 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:59:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:13,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:59:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:13,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:14,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528476715] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:14,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:14,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 16:59:14,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964015642] [2022-10-15 16:59:14,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:14,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:59:14,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:59:14,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:59:14,049 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:14,151 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-10-15 16:59:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 16:59:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:59:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:14,153 INFO L225 Difference]: With dead ends: 76 [2022-10-15 16:59:14,153 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 16:59:14,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:59:14,155 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 46 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:14,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 107 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 16:59:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-10-15 16:59:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 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:59:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-10-15 16:59:14,161 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 22 [2022-10-15 16:59:14,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:14,161 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-10-15 16:59:14,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:59:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-10-15 16:59:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-10-15 16:59:14,164 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:14,164 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:14,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:59:14,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:14,378 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:14,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -279353121, now seen corresponding path program 2 times [2022-10-15 16:59:14,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:14,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76125518] [2022-10-15 16:59:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-15 16:59:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:14,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76125518] [2022-10-15 16:59:14,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76125518] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:14,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:14,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:59:14,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646525295] [2022-10-15 16:59:14,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:14,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:59:14,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:59:14,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:59:14,583 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:14,642 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-10-15 16:59:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:59:14,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 49 [2022-10-15 16:59:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:14,644 INFO L225 Difference]: With dead ends: 70 [2022-10-15 16:59:14,645 INFO L226 Difference]: Without dead ends: 70 [2022-10-15 16:59:14,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:59:14,646 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 45 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:14,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 45 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:59:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-10-15 16:59:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-10-15 16:59:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 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:59:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-10-15 16:59:14,652 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 49 [2022-10-15 16:59:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:14,653 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-10-15 16:59:14,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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:59:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-10-15 16:59:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 16:59:14,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:14,656 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:14,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:59:14,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1388240914, now seen corresponding path program 1 times [2022-10-15 16:59:14,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:14,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957244518] [2022-10-15 16:59:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:14,847 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-10-15 16:59:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:14,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957244518] [2022-10-15 16:59:14,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957244518] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:59:14,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:59:14,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:59:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778599464] [2022-10-15 16:59:14,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:59:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:59:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:59:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:59:14,851 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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:59:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:14,930 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2022-10-15 16:59:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:59:14,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 55 [2022-10-15 16:59:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:14,933 INFO L225 Difference]: With dead ends: 78 [2022-10-15 16:59:14,933 INFO L226 Difference]: Without dead ends: 78 [2022-10-15 16:59:14,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:59:14,935 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:14,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-10-15 16:59:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-10-15 16:59:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 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:59:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-10-15 16:59:14,940 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 55 [2022-10-15 16:59:14,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:14,941 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-10-15 16:59:14,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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:59:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-10-15 16:59:14,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-15 16:59:14,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:14,943 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:14,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:59:14,944 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1386393872, now seen corresponding path program 1 times [2022-10-15 16:59:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:14,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998586134] [2022-10-15 16:59:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:59:15,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998586134] [2022-10-15 16:59:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998586134] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:15,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152338546] [2022-10-15 16:59:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:15,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:15,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:15,353 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:59:15,379 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:59:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:15,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-15 16:59:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:59:15,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 4 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:59:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152338546] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:59:15,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:59:15,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-10-15 16:59:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138910617] [2022-10-15 16:59:15,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:59:15,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:59:15,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:59:15,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:59:15,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:59:15,776 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:59:16,014 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2022-10-15 16:59:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-10-15 16:59:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 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 55 [2022-10-15 16:59:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:59:16,017 INFO L225 Difference]: With dead ends: 134 [2022-10-15 16:59:16,018 INFO L226 Difference]: Without dead ends: 134 [2022-10-15 16:59:16,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-10-15 16:59:16,020 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:59:16,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 181 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:59:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-10-15 16:59:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2022-10-15 16:59:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 121 states have (on average 1.1074380165289257) internal successors, (134), 126 states have internal predecessors, (134), 0 states have call successors, (0), 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:59:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 134 transitions. [2022-10-15 16:59:16,027 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 134 transitions. Word has length 55 [2022-10-15 16:59:16,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:59:16,028 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 134 transitions. [2022-10-15 16:59:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 14 states have internal predecessors, (102), 0 states have call successors, (0), 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:59:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 134 transitions. [2022-10-15 16:59:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-15 16:59:16,031 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:59:16,031 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:59:16,084 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:59:16,247 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,SelfDestructingSolverStorable10 [2022-10-15 16:59:16,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:59:16,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:59:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash -912311504, now seen corresponding path program 2 times [2022-10-15 16:59:16,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:59:16,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147182764] [2022-10-15 16:59:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:59:16,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:59:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:59:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 10 proven. 281 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-10-15 16:59:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:59:26,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147182764] [2022-10-15 16:59:26,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147182764] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:59:26,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064391878] [2022-10-15 16:59:26,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:59:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:59:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:59:26,147 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:59:26,169 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:59:26,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:59:26,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:59:26,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 202 conjunts are in the unsatisfiable core [2022-10-15 16:59:26,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:59:26,658 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:59:26,731 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:59:26,731 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:59:26,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:26,821 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:59:26,831 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:59:26,902 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 20 treesize of output 8 [2022-10-15 16:59:27,040 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:59:27,088 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:59:27,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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:59:27,191 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:59:27,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:27,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 13 [2022-10-15 16:59:27,450 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:59:27,499 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-10-15 16:59:27,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-10-15 16:59:27,623 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:59:27,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:59:27,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 17 [2022-10-15 16:59:28,082 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:59:28,163 INFO L356 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-10-15 16:59:28,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-10-15 16:59:28,363 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:59:28,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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:59:28,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2022-10-15 16:59:28,902 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:59:28,982 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-10-15 16:59:28,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2022-10-15 16:59:29,211 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:59:29,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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:59:29,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 61 treesize of output 25 [2022-10-15 16:59:29,946 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:59:30,097 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-15 16:59:30,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-10-15 16:59:30,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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:59:30,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:59:30,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 24 [2022-10-15 16:59:31,531 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:59:31,653 INFO L356 Elim1Store]: treesize reduction 90, result has 33.8 percent of original size [2022-10-15 16:59:31,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 69 [2022-10-15 16:59:32,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 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:59:32,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:59:32,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2022-10-15 16:59:33,319 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:59:33,455 INFO L356 Elim1Store]: treesize reduction 108, result has 33.7 percent of original size [2022-10-15 16:59:33,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 42 treesize of output 81 [2022-10-15 16:59:33,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 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:59:34,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-10-15 16:59:34,022 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:59:34,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 28 [2022-10-15 16:59:34,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 6 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:59:35,434 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 19 treesize of output 18 [2022-10-15 16:59:35,766 INFO L356 Elim1Store]: treesize reduction 84, result has 27.0 percent of original size [2022-10-15 16:59:35,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 54 [2022-10-15 16:59:36,320 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:59:36,328 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:59:36,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:36,433 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-10-15 16:59:36,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 30 [2022-10-15 16:59:36,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-10-15 16:59:36,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-10-15 16:59:37,906 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-10-15 16:59:37,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 40 [2022-10-15 16:59:39,716 INFO L356 Elim1Store]: treesize reduction 76, result has 27.6 percent of original size [2022-10-15 16:59:39,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 41 treesize of output 53 [2022-10-15 16:59:39,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:59:39,901 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-10-15 16:59:39,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-10-15 16:59:39,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-10-15 16:59:40,066 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 24 treesize of output 12 [2022-10-15 16:59:40,517 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-10-15 16:59:40,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 63 [2022-10-15 16:59:43,863 INFO L356 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2022-10-15 16:59:43,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 61 [2022-10-15 16:59:51,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-10-15 16:59:51,214 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-10-15 16:59:51,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 26 [2022-10-15 16:59:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 133 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:59:51,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:59:51,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:59:51,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:59:51,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= 2 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:59:51,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= 2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_753)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:59:52,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_752 Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_746 Int) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_746)))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ |c_ULTIMATE.start_main_~counter~0#1| 1)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-10-15 16:59:54,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< v_ArrVal_742 (+ 2 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= 2 (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_732) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_739))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)))) is different from false [2022-10-15 16:59:54,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (< v_ArrVal_742 (+ 2 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (= 2 (select (select (store (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0))))) is different from false [2022-10-15 16:59:55,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< v_ArrVal_742 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select (store (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0))))) is different from false [2022-10-15 16:59:55,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (select (store (let ((.cse1 (let ((.cse2 (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (< v_ArrVal_752 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< v_ArrVal_742 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0))))) is different from false [2022-10-15 16:59:55,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select (select (store (let ((.cse1 (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_729) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< v_ArrVal_742 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0))))) is different from false [2022-10-15 16:59:55,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (< v_ArrVal_752 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (= (select (select (store (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< v_ArrVal_742 (+ 3 |c_ULTIMATE.start_main_~counter~0#1|)))))) is different from false [2022-10-15 16:59:55,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_742 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select (select (store (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))) is different from false [2022-10-15 16:59:55,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_742 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= 2 (select (select (store (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))) is different from false [2022-10-15 16:59:55,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (store (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_742 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (= 2 (select (select (store (let ((.cse1 (let ((.cse2 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))) is different from false [2022-10-15 16:59:56,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (< v_ArrVal_742 (+ |c_ULTIMATE.start_main_~counter~0#1| 4)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select (store (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|))))))) is different from false [2022-10-15 16:59:56,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse3 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse4 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select (select (store (let ((.cse0 (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select (store (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|))))))) is different from false [2022-10-15 16:59:56,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select (store (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (= 2 (select (select (store (let ((.cse3 (let ((.cse4 (store (store (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|))))))) is different from false [2022-10-15 16:59:56,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse2 (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select (store (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= 2 (select (select (store (let ((.cse3 (let ((.cse4 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_718) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|))))))) is different from false [2022-10-15 16:59:56,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (< v_ArrVal_752 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select (store (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_742 (+ 5 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (not (= (select (select (store (let ((.cse4 (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))))) is different from false [2022-10-15 16:59:57,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (store (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_752 (+ 7 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (not (= (select (select (store (let ((.cse4 (let ((.cse5 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_718) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))))) is different from false [2022-10-15 16:59:57,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (store (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (< v_ArrVal_752 (+ 7 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (not (= (select (select (store (let ((.cse4 (let ((.cse5 (store (store (store (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_718) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 2)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))))) is different from false [2022-10-15 16:59:57,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_746 Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse0 (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select (store (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|) 0)) (not (= 2 (select (select (store (let ((.cse4 (let ((.cse5 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_714) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_718) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (< v_ArrVal_752 (+ 7 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))))))) is different from false [2022-10-15 16:59:57,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_726 Int) (|v_ULTIMATE.start_main_~t~0#1.base_14| Int) (v_ArrVal_736 Int) (|v_ULTIMATE.start_main_~t~0#1.base_20| Int) (v_ArrVal_746 Int) (|v_ULTIMATE.start_main_~t~0#1.base_21| Int) (v_ArrVal_742 Int) (v_ArrVal_753 Int) (v_ArrVal_732 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_723 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_17| Int) (v_ArrVal_714 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_16| Int) (v_ArrVal_758 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_739 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_729 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21| 1))) (let ((.cse3 (store .cse4 |v_ULTIMATE.start_main_~t~0#1.base_20| 1))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19| 1))) (let ((.cse6 (store .cse5 |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_726))) (let ((.cse2 (store .cse6 |v_ULTIMATE.start_main_~t~0#1.base_17| 1))) (or (not (= 2 (select (select (store (let ((.cse0 (let ((.cse1 (store (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_714) |v_ULTIMATE.start_main_~t~0#1.base_21| v_ArrVal_718) |v_ULTIMATE.start_main_~t~0#1.base_20| v_ArrVal_723) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_729) |v_ULTIMATE.start_main_~t~0#1.base_18| v_ArrVal_732) |v_ULTIMATE.start_main_~t~0#1.base_17| v_ArrVal_739))) (store .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16| (store (store (select .cse1 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0 v_ArrVal_742) 4 v_ArrVal_746))))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_15|) 0 v_ArrVal_752) 4 v_ArrVal_753))) |v_ULTIMATE.start_main_~t~0#1.base_14| v_ArrVal_758) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (not (= 0 (select (store (store .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16| v_ArrVal_736) |v_ULTIMATE.start_main_~t~0#1.base_15| 1) |v_ULTIMATE.start_main_~t~0#1.base_14|))) (not (= (select .cse3 |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_21|) 0)) (not (= (select .cse4 |v_ULTIMATE.start_main_~t~0#1.base_20|) 0)) (not (= (select .cse5 |v_ULTIMATE.start_main_~t~0#1.base_18|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (= (select .cse6 |v_ULTIMATE.start_main_~t~0#1.base_17|) 0)) (< v_ArrVal_752 (+ 7 |c_ULTIMATE.start_main_~counter~0#1|)) (< v_ArrVal_742 (+ 6 |c_ULTIMATE.start_main_~counter~0#1|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~t~0#1.base_16|) 0))))))))) is different from false