/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-30 22:37:39,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-30 22:37:39,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-30 22:37:39,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-30 22:37:39,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-30 22:37:39,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-30 22:37:39,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-30 22:37:39,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-30 22:37:39,307 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-30 22:37:39,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-30 22:37:39,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-30 22:37:39,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-30 22:37:39,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-30 22:37:39,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-30 22:37:39,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-30 22:37:39,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-30 22:37:39,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-30 22:37:39,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-30 22:37:39,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-30 22:37:39,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-30 22:37:39,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-30 22:37:39,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-30 22:37:39,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-30 22:37:39,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-30 22:37:39,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-30 22:37:39,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-30 22:37:39,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-30 22:37:39,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-30 22:37:39,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-30 22:37:39,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-30 22:37:39,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-30 22:37:39,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-30 22:37:39,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-30 22:37:39,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-30 22:37:39,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-30 22:37:39,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-30 22:37:39,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-30 22:37:39,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-30 22:37:39,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-30 22:37:39,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-30 22:37:39,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-30 22:37:39,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-01-30 22:37:39,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-30 22:37:39,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-30 22:37:39,375 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-30 22:37:39,375 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-30 22:37:39,376 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-30 22:37:39,376 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-30 22:37:39,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * Use SBE=true [2022-01-30 22:37:39,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-30 22:37:39,377 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-30 22:37:39,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-30 22:37:39,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-30 22:37:39,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:37:39,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-30 22:37:39,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-30 22:37:39,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-30 22:37:39,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-30 22:37:39,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-30 22:37:39,382 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-30 22:37:39,382 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-30 22:37:39,383 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-30 22:37:39,383 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-30 22:37:39,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-30 22:37:39,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-30 22:37:39,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-30 22:37:39,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-30 22:37:39,609 INFO L275 PluginConnector]: CDTParser initialized [2022-01-30 22:37:39,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-30 22:37:39,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7ff5b4d/2b90f743f3b341c590fb2dfa9119a110/FLAG49346ac0f [2022-01-30 22:37:40,067 INFO L306 CDTParser]: Found 1 translation units. [2022-01-30 22:37:40,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-30 22:37:40,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7ff5b4d/2b90f743f3b341c590fb2dfa9119a110/FLAG49346ac0f [2022-01-30 22:37:40,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b7ff5b4d/2b90f743f3b341c590fb2dfa9119a110 [2022-01-30 22:37:40,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-30 22:37:40,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-30 22:37:40,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-30 22:37:40,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-30 22:37:40,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-30 22:37:40,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3533befe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40, skipping insertion in model container [2022-01-30 22:37:40,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-30 22:37:40,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-30 22:37:40,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-30 22:37:40,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:37:40,653 INFO L203 MainTranslator]: Completed pre-run [2022-01-30 22:37:40,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-30 22:37:40,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-30 22:37:40,696 INFO L208 MainTranslator]: Completed translation [2022-01-30 22:37:40,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40 WrapperNode [2022-01-30 22:37:40,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-30 22:37:40,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-30 22:37:40,699 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-30 22:37:40,699 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-30 22:37:40,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-30 22:37:40,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-30 22:37:40,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-30 22:37:40,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-30 22:37:40,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (1/1) ... [2022-01-30 22:37:40,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-30 22:37:40,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:37:40,762 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-01-30 22:37:40,783 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-01-30 22:37:40,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-30 22:37:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-30 22:37:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-30 22:37:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-30 22:37:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-30 22:37:40,807 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-30 22:37:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-30 22:37:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-30 22:37:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-30 22:37:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-30 22:37:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-30 22:37:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-30 22:37:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-30 22:37:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-30 22:37:40,870 INFO L234 CfgBuilder]: Building ICFG [2022-01-30 22:37:40,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-30 22:37:41,112 INFO L275 CfgBuilder]: Performing block encoding [2022-01-30 22:37:41,117 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-30 22:37:41,117 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-30 22:37:41,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:37:41 BoogieIcfgContainer [2022-01-30 22:37:41,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-30 22:37:41,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-30 22:37:41,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-30 22:37:41,123 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-30 22:37:41,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 10:37:40" (1/3) ... [2022-01-30 22:37:41,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce06e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:37:41, skipping insertion in model container [2022-01-30 22:37:41,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 10:37:40" (2/3) ... [2022-01-30 22:37:41,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ce06e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 10:37:41, skipping insertion in model container [2022-01-30 22:37:41,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 10:37:41" (3/3) ... [2022-01-30 22:37:41,125 INFO L111 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2022-01-30 22:37:41,129 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-30 22:37:41,129 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-30 22:37:41,165 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-30 22:37:41,171 INFO L339 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-30 22:37:41,172 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-30 22:37:41,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-30 22:37:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-30 22:37:41,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:37:41,194 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:37:41,195 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:37:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:37:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1562750912, now seen corresponding path program 1 times [2022-01-30 22:37:41,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:37:41,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346015987] [2022-01-30 22:37:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:41,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:37:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:37:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:37:41,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:37:41,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346015987] [2022-01-30 22:37:41,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346015987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:37:41,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:37:41,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-30 22:37:41,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830433815] [2022-01-30 22:37:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:37:41,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-30 22:37:41,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:37:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-30 22:37:41,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:37:41,518 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:37:41,604 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-01-30 22:37:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-30 22:37:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-01-30 22:37:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:37:41,614 INFO L225 Difference]: With dead ends: 61 [2022-01-30 22:37:41,614 INFO L226 Difference]: Without dead ends: 31 [2022-01-30 22:37:41,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-30 22:37:41,621 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:37:41,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:37:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-30 22:37:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-30 22:37:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:37:41,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-30 22:37:41,657 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2022-01-30 22:37:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:37:41,657 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-30 22:37:41,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-30 22:37:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-30 22:37:41,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:37:41,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:37:41,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-30 22:37:41,660 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:37:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:37:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1882541358, now seen corresponding path program 1 times [2022-01-30 22:37:41,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:37:41,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143580201] [2022-01-30 22:37:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:41,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:37:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:37:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-30 22:37:41,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:37:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143580201] [2022-01-30 22:37:41,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143580201] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-30 22:37:41,781 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-30 22:37:41,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-30 22:37:41,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077913443] [2022-01-30 22:37:41,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-30 22:37:41,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-30 22:37:41,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:37:41,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-30 22:37:41,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-30 22:37:41,783 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:37:41,890 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-01-30 22:37:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 22:37:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-01-30 22:37:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:37:41,896 INFO L225 Difference]: With dead ends: 58 [2022-01-30 22:37:41,896 INFO L226 Difference]: Without dead ends: 41 [2022-01-30 22:37:41,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-30 22:37:41,898 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:37:41,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:37:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-30 22:37:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2022-01-30 22:37:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:37:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-30 22:37:41,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2022-01-30 22:37:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:37:41,915 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-30 22:37:41,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-30 22:37:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-30 22:37:41,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:37:41,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:37:41,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-30 22:37:41,916 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:37:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:37:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 163198508, now seen corresponding path program 1 times [2022-01-30 22:37:41,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:37:41,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065631025] [2022-01-30 22:37:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:41,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:37:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:42,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:37:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:37:42,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:37:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065631025] [2022-01-30 22:37:42,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065631025] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:37:42,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105464232] [2022-01-30 22:37:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:42,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:37:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:37:42,060 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-01-30 22:37:42,088 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-01-30 22:37:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:42,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-30 22:37:42,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:37:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:37:42,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:37:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-30 22:37:42,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105464232] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:37:42,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:37:42,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-01-30 22:37:42,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390257821] [2022-01-30 22:37:42,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:37:42,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-30 22:37:42,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:37:42,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-30 22:37:42,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:37:42,427 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:42,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:37:42,533 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-01-30 22:37:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-30 22:37:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-01-30 22:37:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:37:42,536 INFO L225 Difference]: With dead ends: 59 [2022-01-30 22:37:42,536 INFO L226 Difference]: Without dead ends: 36 [2022-01-30 22:37:42,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-30 22:37:42,540 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:37:42,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 44 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:37:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-30 22:37:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-01-30 22:37:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:37:42,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-30 22:37:42,563 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-01-30 22:37:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:37:42,563 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-30 22:37:42,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-30 22:37:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-30 22:37:42,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:37:42,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:37:42,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-30 22:37:42,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:37:42,766 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:37:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:37:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash 10205386, now seen corresponding path program 2 times [2022-01-30 22:37:42,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:37:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384926492] [2022-01-30 22:37:42,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:42,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:37:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:42,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:37:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:37:42,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:37:42,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384926492] [2022-01-30 22:37:42,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384926492] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:37:42,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014793122] [2022-01-30 22:37:42,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-30 22:37:42,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:37:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:37:42,882 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-01-30 22:37:42,884 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-01-30 22:37:42,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-30 22:37:42,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:37:42,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-30 22:37:42,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:37:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:37:43,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:37:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-30 22:37:43,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014793122] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-30 22:37:43,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-30 22:37:43,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-01-30 22:37:43,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651919114] [2022-01-30 22:37:43,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-30 22:37:43,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-30 22:37:43,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-30 22:37:43,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-30 22:37:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-30 22:37:43,168 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-30 22:37:43,319 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-01-30 22:37:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-30 22:37:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-01-30 22:37:43,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-30 22:37:43,322 INFO L225 Difference]: With dead ends: 72 [2022-01-30 22:37:43,323 INFO L226 Difference]: Without dead ends: 53 [2022-01-30 22:37:43,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-30 22:37:43,325 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-30 22:37:43,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-30 22:37:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-30 22:37:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-01-30 22:37:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-30 22:37:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-01-30 22:37:43,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2022-01-30 22:37:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-30 22:37:43,339 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-01-30 22:37:43,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-30 22:37:43,339 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-01-30 22:37:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-30 22:37:43,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-30 22:37:43,340 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-30 22:37:43,362 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-01-30 22:37:43,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-30 22:37:43,560 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-30 22:37:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-30 22:37:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1523015132, now seen corresponding path program 3 times [2022-01-30 22:37:43,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-30 22:37:43,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299050401] [2022-01-30 22:37:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-30 22:37:43,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-30 22:37:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-30 22:37:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-30 22:37:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:37:44,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-30 22:37:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299050401] [2022-01-30 22:37:44,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299050401] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-30 22:37:44,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446082080] [2022-01-30 22:37:44,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-30 22:37:44,714 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-30 22:37:44,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-30 22:37:44,715 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-01-30 22:37:44,735 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-01-30 22:37:44,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-30 22:37:44,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-30 22:37:44,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-30 22:37:44,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-30 22:37:44,917 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-01-30 22:37:44,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 437 treesize of output 433 [2022-01-30 22:37:45,158 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-01-30 22:37:45,163 INFO L387 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 6 treesize of output 5 [2022-01-30 22:37:45,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2022-01-30 22:37:45,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-01-30 22:37:45,454 INFO L353 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-01-30 22:37:45,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 55 [2022-01-30 22:37:45,459 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-30 22:37:45,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:37:45,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-01-30 22:37:45,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-30 22:37:45,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:37:45,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2022-01-30 22:37:45,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-30 22:37:45,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:37:45,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2022-01-30 22:37:45,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-30 22:37:45,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2022-01-30 22:37:46,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-01-30 22:37:46,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-01-30 22:37:46,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-30 22:37:46,197 INFO L353 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-01-30 22:37:46,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 55 [2022-01-30 22:37:46,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-01-30 22:37:46,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-30 22:37:46,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2022-01-30 22:37:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-30 22:37:46,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-30 22:37:46,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (< (+ main_~i~0 1) c_~SIZE~0) (forall ((v_ArrVal_368 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse1 (* main_~i~0 4))) (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset .cse1) (select (select |c_#memory_int| c_main_~b~0.base) (+ c_main_~b~0.offset .cse1))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset) (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset))))))) is different from false [2022-01-30 22:37:46,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| c_main_~a~0.base (let ((.cse3 (* c_main_~i~0 4))) (store (select |c_#memory_int| c_main_~a~0.base) (+ .cse3 c_main_~a~0.offset) (select (select |c_#memory_int| c_main_~b~0.base) (+ .cse3 c_main_~b~0.offset))))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))))) is different from false [2022-01-30 22:37:46,733 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_56 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (select (select |c_#memory_int| c_main_~b~0.base) c_main_~b~0.offset))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))))) is different from false [2022-01-30 22:37:46,800 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_362 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* c_main_~i~0 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse4))) (store .cse3 c_main_~a~0.base (store (select .cse3 c_main_~a~0.base) c_main_~a~0.offset (select .cse4 c_main_~b~0.offset))))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))))) is different from false [2022-01-30 22:37:46,900 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int)) (or (not (<= (+ c_main_~i~0 1) v_main_~i~0_59)) (forall ((v_ArrVal_362 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (or (let ((.cse0 (store (let ((.cse1 (store (let ((.cse4 (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse3 (store (store |c_#memory_int| c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse4))) (store .cse3 c_main_~a~0.base (store (select .cse3 c_main_~a~0.base) c_main_~a~0.offset (select .cse4 c_main_~b~0.offset))))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))) (< (+ v_main_~i~0_56 1) c_~SIZE~0))))) is different from false [2022-01-30 22:37:46,992 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int) (v_ArrVal_362 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse5 (store (store |c_#memory_int| c_main_~a~0.base v_ArrVal_355) c_main_~b~0.base (let ((.cse6 (* c_main_~i~0 4))) (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_356) c_main_~b~0.base) (+ .cse6 c_main_~b~0.offset) (select (select |c_#memory_int| c_main_~a~0.base) (+ .cse6 c_main_~a~0.offset))))))) (let ((.cse4 (store (select (store .cse5 c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse3 (store (store .cse5 c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse4))) (store .cse3 c_main_~a~0.base (store (select .cse3 c_main_~a~0.base) c_main_~a~0.offset (select .cse4 c_main_~b~0.offset)))))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))) (not (<= (+ c_main_~i~0 1) v_main_~i~0_59)))) is different from false [2022-01-30 22:37:47,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int) (v_ArrVal_362 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (let ((.cse0 (store (let ((.cse1 (store (let ((.cse5 (store (store |c_#memory_int| c_main_~a~0.base v_ArrVal_355) c_main_~b~0.base (store (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_356) c_main_~b~0.base) c_main_~b~0.offset (select (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset))))) (let ((.cse4 (store (select (store .cse5 c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse3 (store (store .cse5 c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse4))) (store .cse3 c_main_~a~0.base (store (select .cse3 c_main_~a~0.base) c_main_~a~0.offset (select .cse4 c_main_~b~0.offset)))))) c_main_~b~0.base v_ArrVal_365))) (store .cse1 c_main_~a~0.base (let ((.cse2 (* v_main_~i~0_56 4))) (store (select .cse1 c_main_~a~0.base) (+ c_main_~a~0.offset .cse2) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse2)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) (* 4 c_~SIZE~0) c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset))) (not (<= 1 v_main_~i~0_59)))) is different from false [2022-01-30 22:37:47,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((main_~i~0 Int)) (or (forall ((v_main_~i~0_59 Int) (v_ArrVal_362 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (not (<= 1 v_main_~i~0_59)) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ c_main_~a~0.offset (* main_~i~0 4)) (select (select |c_#memory_int| c_main_~a_copy~0.base) (+ (* main_~i~0 (- 4)) (- 4) .cse1 c_main_~a_copy~0.offset)))) c_main_~b~0.base v_ArrVal_351))) (store (store .cse7 c_main_~a~0.base v_ArrVal_355) c_main_~b~0.base (store (select (store .cse7 c_main_~a~0.base v_ArrVal_356) c_main_~b~0.base) c_main_~b~0.offset (select (select .cse7 c_main_~a~0.base) c_main_~a~0.offset)))))) (let ((.cse5 (store (select (store .cse6 c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse4 (store (store .cse6 c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse5))) (store .cse4 c_main_~a~0.base (store (select .cse4 c_main_~a~0.base) c_main_~a~0.offset (select .cse5 c_main_~b~0.offset)))))) c_main_~b~0.base v_ArrVal_365))) (store .cse2 c_main_~a~0.base (let ((.cse3 (* v_main_~i~0_56 4))) (store (select .cse2 c_main_~a~0.base) (+ c_main_~a~0.offset .cse3) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse3)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) .cse1 c_main_~a_copy~0.offset)) (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset)))))) (< (+ main_~i~0 1) c_~SIZE~0))) is different from false [2022-01-30 22:37:48,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_355 (Array Int Int)) (v_main_~i~0_63 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_356 (Array Int Int)) (v_ArrVal_348 (Array Int Int)) (v_ArrVal_362 Int)) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (< (+ v_main_~i~0_63 1) c_~SIZE~0) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) (+ (* c_main_~i~0 4) c_main_~a~0.offset) (select (select |c_#memory_int| c_main_~a_copy~0.base) (+ (* c_main_~i~0 (- 4)) (- 4) .cse1 c_main_~a_copy~0.offset)))) c_main_~b~0.base v_ArrVal_348))) (store .cse8 c_main_~a~0.base (store (select .cse8 c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 4)) (select (select .cse8 c_main_~a_copy~0.base) (+ (* v_main_~i~0_63 (- 4)) (- 4) .cse1 c_main_~a_copy~0.offset))))) c_main_~b~0.base v_ArrVal_351))) (store (store .cse7 c_main_~a~0.base v_ArrVal_355) c_main_~b~0.base (store (select (store .cse7 c_main_~a~0.base v_ArrVal_356) c_main_~b~0.base) c_main_~b~0.offset (select (select .cse7 c_main_~a~0.base) c_main_~a~0.offset)))))) (let ((.cse5 (store (select (store .cse6 c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse4 (store (store .cse6 c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse5))) (store .cse4 c_main_~a~0.base (store (select .cse4 c_main_~a~0.base) c_main_~a~0.offset (select .cse5 c_main_~b~0.offset)))))) c_main_~b~0.base v_ArrVal_365))) (store .cse2 c_main_~a~0.base (let ((.cse3 (* v_main_~i~0_56 4))) (store (select .cse2 c_main_~a~0.base) (+ c_main_~a~0.offset .cse3) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse3)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset) (select (select .cse0 c_main_~a_copy~0.base) (+ (- 4) .cse1 c_main_~a_copy~0.offset))))) (not (<= 1 v_main_~i~0_59)))) is different from false [2022-01-30 22:37:48,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~i~0_59 Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_351 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_main_~i~0_56 Int) (v_ArrVal_355 (Array Int Int)) (v_main_~i~0_63 Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_356 (Array Int Int)) (v_ArrVal_348 (Array Int Int)) (v_ArrVal_362 Int)) (or (< (+ v_main_~i~0_56 1) c_~SIZE~0) (< (+ v_main_~i~0_63 1) c_~SIZE~0) (not (<= 1 v_main_~i~0_59)) (let ((.cse9 (* 4 c_~SIZE~0))) (let ((.cse1 (+ (- 4) .cse9 c_main_~a_copy~0.offset))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse6 (let ((.cse7 (store (let ((.cse8 (store (store |c_#memory_int| c_main_~a~0.base (store (select |c_#memory_int| c_main_~a~0.base) c_main_~a~0.offset (select (select |c_#memory_int| c_main_~a_copy~0.base) .cse1))) c_main_~b~0.base v_ArrVal_348))) (store .cse8 c_main_~a~0.base (store (select .cse8 c_main_~a~0.base) (+ c_main_~a~0.offset (* v_main_~i~0_63 4)) (select (select .cse8 c_main_~a_copy~0.base) (+ (* v_main_~i~0_63 (- 4)) (- 4) .cse9 c_main_~a_copy~0.offset))))) c_main_~b~0.base v_ArrVal_351))) (store (store .cse7 c_main_~a~0.base v_ArrVal_355) c_main_~b~0.base (store (select (store .cse7 c_main_~a~0.base v_ArrVal_356) c_main_~b~0.base) c_main_~b~0.offset (select (select .cse7 c_main_~a~0.base) c_main_~a~0.offset)))))) (let ((.cse5 (store (select (store .cse6 c_main_~a~0.base v_ArrVal_361) c_main_~b~0.base) (+ (* v_main_~i~0_59 4) c_main_~b~0.offset) v_ArrVal_362))) (let ((.cse4 (store (store .cse6 c_main_~a~0.base v_ArrVal_360) c_main_~b~0.base .cse5))) (store .cse4 c_main_~a~0.base (store (select .cse4 c_main_~a~0.base) c_main_~a~0.offset (select .cse5 c_main_~b~0.offset)))))) c_main_~b~0.base v_ArrVal_365))) (store .cse2 c_main_~a~0.base (let ((.cse3 (* v_main_~i~0_56 4))) (store (select .cse2 c_main_~a~0.base) (+ c_main_~a~0.offset .cse3) (select v_ArrVal_365 (+ c_main_~b~0.offset .cse3)))))) c_main_~b~0.base v_ArrVal_368))) (= (select (select .cse0 c_main_~a~0.base) c_main_~a~0.offset) (select (select .cse0 c_main_~a_copy~0.base) .cse1))))))) is different from false [2022-01-30 22:37:50,274 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-30 22:37:50,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13982 treesize of output 7515