./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ms3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/ms3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 17:53:00,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:53:00,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:53:00,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:53:00,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:53:00,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:53:00,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:53:00,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:53:00,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:53:00,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:53:00,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:53:00,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:53:00,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:53:00,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:53:00,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:53:00,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:53:00,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:53:00,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:53:00,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:53:00,387 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:53:00,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:53:00,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:53:00,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:53:00,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:53:00,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:53:00,415 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:53:00,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:53:00,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:53:00,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:53:00,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:53:00,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:53:00,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:53:00,426 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:53:00,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:53:00,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:53:00,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:53:00,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:53:00,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:53:00,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:53:00,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:53:00,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:53:00,437 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-13 17:53:00,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:53:00,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:53:00,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:53:00,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:53:00,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:53:00,510 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:53:00,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:53:00,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:53:00,512 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:53:00,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:53:00,514 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:53:00,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:53:00,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:53:00,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:53:00,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 17:53:00,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:53:00,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 17:53:00,516 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:53:00,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:53:00,517 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:53:00,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 17:53:00,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:53:00,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:53:00,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:53:00,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:53:00,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:53:00,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:53:00,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 17:53:00,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:53:00,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:53:00,523 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 17:53:00,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-13 17:53:00,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 17:53:00,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 17:53:00,524 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b493eaf5cbb9a8ad0f724257518d8f922b0657033a5eb7aa4f50992fe6ac33a4 [2021-11-13 17:53:00,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:53:00,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:53:00,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:53:00,957 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:53:00,958 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:53:00,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/array-fpi/ms3.c [2021-11-13 17:53:01,038 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/data/5c6d54aad/8f099ea0e6d34298b5309d74ddd7545b/FLAGafb3ccc62 [2021-11-13 17:53:01,713 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:53:01,714 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/sv-benchmarks/c/array-fpi/ms3.c [2021-11-13 17:53:01,723 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/data/5c6d54aad/8f099ea0e6d34298b5309d74ddd7545b/FLAGafb3ccc62 [2021-11-13 17:53:02,064 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/data/5c6d54aad/8f099ea0e6d34298b5309d74ddd7545b [2021-11-13 17:53:02,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:53:02,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 17:53:02,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:53:02,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:53:02,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:53:02,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1067bcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02, skipping insertion in model container [2021-11-13 17:53:02,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:53:02,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:53:02,347 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/sv-benchmarks/c/array-fpi/ms3.c[586,599] [2021-11-13 17:53:02,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:53:02,390 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:53:02,414 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/sv-benchmarks/c/array-fpi/ms3.c[586,599] [2021-11-13 17:53:02,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:53:02,452 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:53:02,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02 WrapperNode [2021-11-13 17:53:02,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:53:02,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:53:02,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:53:02,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:53:02,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,506 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:53:02,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:53:02,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:53:02,507 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:53:02,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:53:02,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:53:02,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:53:02,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:53:02,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (1/1) ... [2021-11-13 17:53:02,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:53:02,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:02,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 17:53:02,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 17:53:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:53:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:53:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:53:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-13 17:53:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:53:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:53:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:53:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:53:02,933 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:53:02,933 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 17:53:02,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:53:02 BoogieIcfgContainer [2021-11-13 17:53:02,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:53:02,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:53:02,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:53:02,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:53:02,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:53:02" (1/3) ... [2021-11-13 17:53:02,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60816dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:53:02, skipping insertion in model container [2021-11-13 17:53:02,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:53:02" (2/3) ... [2021-11-13 17:53:02,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60816dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:53:02, skipping insertion in model container [2021-11-13 17:53:02,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:53:02" (3/3) ... [2021-11-13 17:53:02,946 INFO L111 eAbstractionObserver]: Analyzing ICFG ms3.c [2021-11-13 17:53:02,953 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:53:02,954 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 17:53:03,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 17:53:03,026 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 [2021-11-13 17:53:03,026 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 17:53:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 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) [2021-11-13 17:53:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-13 17:53:03,053 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:03,054 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:03,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:03,062 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-11-13 17:53:03,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:03,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259445363] [2021-11-13 17:53:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:03,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:03,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:03,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259445363] [2021-11-13 17:53:03,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259445363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:53:03,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:53:03,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 17:53:03,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992796876] [2021-11-13 17:53:03,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:53:03,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 17:53:03,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:03,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 17:53:03,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 17:53:03,324 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-11-13 17:53:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:03,344 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-11-13 17:53:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:53:03,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-11-13 17:53:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:03,358 INFO L225 Difference]: With dead ends: 34 [2021-11-13 17:53:03,358 INFO L226 Difference]: Without dead ends: 15 [2021-11-13 17:53:03,378 INFO L932 BasicCegarLoop]: 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 [2021-11-13 17:53:03,383 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.70ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:03,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.70ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-13 17:53:03,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-13 17:53:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-13 17:53:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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) [2021-11-13 17:53:03,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-13 17:53:03,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-11-13 17:53:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:03,443 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-13 17:53:03,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) [2021-11-13 17:53:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-13 17:53:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-13 17:53:03,444 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:03,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:03,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:53:03,445 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-11-13 17:53:03,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:03,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756453300] [2021-11-13 17:53:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:03,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:03,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:03,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756453300] [2021-11-13 17:53:03,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756453300] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:53:03,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:53:03,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:53:03,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570439472] [2021-11-13 17:53:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:53:03,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:53:03,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:03,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:53:03,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:53:03,590 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-11-13 17:53:03,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:03,689 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-11-13 17:53:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:53:03,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-11-13 17:53:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:03,693 INFO L225 Difference]: With dead ends: 28 [2021-11-13 17:53:03,693 INFO L226 Difference]: Without dead ends: 20 [2021-11-13 17:53:03,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:53:03,699 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.00ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.32ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:03,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 11 Invalid, 26 Unknown, 0 Unchecked, 3.00ms Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 80.32ms Time] [2021-11-13 17:53:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-13 17:53:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-13 17:53:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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) [2021-11-13 17:53:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-11-13 17:53:03,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 11 [2021-11-13 17:53:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:03,715 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-11-13 17:53:03,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-11-13 17:53:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-11-13 17:53:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-13 17:53:03,720 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:03,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:03,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:53:03,726 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-11-13 17:53:03,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:03,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477295667] [2021-11-13 17:53:03,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:03,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:53:04,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:04,023 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477295667] [2021-11-13 17:53:04,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477295667] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:53:04,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:53:04,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 17:53:04,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574886187] [2021-11-13 17:53:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:53:04,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 17:53:04,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 17:53:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-13 17:53:04,029 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:53:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:04,119 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-11-13 17:53:04,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 17:53:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-13 17:53:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:04,122 INFO L225 Difference]: With dead ends: 25 [2021-11-13 17:53:04,123 INFO L226 Difference]: Without dead ends: 21 [2021-11-13 17:53:04,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:53:04,133 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.44ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.67ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:04,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 25 Invalid, 32 Unknown, 0 Unchecked, 4.44ms Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 57.67ms Time] [2021-11-13 17:53:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-13 17:53:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-11-13 17:53:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:53:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-11-13 17:53:04,152 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2021-11-13 17:53:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:04,153 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-11-13 17:53:04,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:53:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-11-13 17:53:04,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-13 17:53:04,154 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:04,154 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:53:04,155 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -422196611, now seen corresponding path program 1 times [2021-11-13 17:53:04,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:04,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720997837] [2021-11-13 17:53:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:04,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:04,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:04,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720997837] [2021-11-13 17:53:04,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720997837] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:04,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62301529] [2021-11-13 17:53:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:04,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:04,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:04,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 17:53:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:04,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 17:53:04,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:04,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:04,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62301529] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:53:04,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:53:04,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-11-13 17:53:04,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121112050] [2021-11-13 17:53:04,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:04,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-13 17:53:04,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:04,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-13 17:53:04,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-11-13 17:53:04,798 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) [2021-11-13 17:53:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:04,949 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-11-13 17:53:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:53:04,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-13 17:53:04,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:04,953 INFO L225 Difference]: With dead ends: 39 [2021-11-13 17:53:04,954 INFO L226 Difference]: Without dead ends: 25 [2021-11-13 17:53:04,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:53:04,966 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.39ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.81ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:04,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 22 Invalid, 82 Unknown, 0 Unchecked, 3.39ms Time], IncrementalHoareTripleChecker [21 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 88.81ms Time] [2021-11-13 17:53:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-13 17:53:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-11-13 17:53:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2021-11-13 17:53:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-11-13 17:53:04,973 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-11-13 17:53:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:04,973 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-11-13 17:53:04,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 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) [2021-11-13 17:53:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-11-13 17:53:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-13 17:53:04,975 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:04,975 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:05,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:05,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:05,181 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:05,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:05,182 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 2 times [2021-11-13 17:53:05,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:05,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36838329] [2021-11-13 17:53:05,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:05,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:05,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:05,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36838329] [2021-11-13 17:53:05,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36838329] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:05,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131109295] [2021-11-13 17:53:05,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:53:05,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:05,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:05,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:05,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 17:53:06,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:53:06,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:53:06,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-13 17:53:06,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:06,269 INFO L388 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 [2021-11-13 17:53:06,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:06,462 INFO L388 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 [2021-11-13 17:53:06,680 INFO L354 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2021-11-13 17:53:06,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 30 [2021-11-13 17:53:06,947 INFO L354 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2021-11-13 17:53:06,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 40 [2021-11-13 17:53:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:07,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:09,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4)) (* 2 c_~N~0))) is different from false [2021-11-13 17:53:10,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (* 2 c_~N~0))) is different from false [2021-11-13 17:53:10,104 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 17:53:10,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 79 [2021-11-13 17:53:10,143 INFO L388 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 16 treesize of output 8 [2021-11-13 17:53:10,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2021-11-13 17:53:10,260 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 17:53:10,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 81 [2021-11-13 17:53:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-11-13 17:53:10,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131109295] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:53:10,488 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:53:10,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2021-11-13 17:53:10,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708742029] [2021-11-13 17:53:10,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:10,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-11-13 17:53:10,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:10,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-13 17:53:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=599, Unknown=2, NotChecked=102, Total=812 [2021-11-13 17:53:10,491 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 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) [2021-11-13 17:53:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:12,581 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2021-11-13 17:53:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:53:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 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 21 [2021-11-13 17:53:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:12,585 INFO L225 Difference]: With dead ends: 38 [2021-11-13 17:53:12,585 INFO L226 Difference]: Without dead ends: 27 [2021-11-13 17:53:12,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=280, Invalid=1286, Unknown=2, NotChecked=154, Total=1722 [2021-11-13 17:53:12,587 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 274.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.70ms SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 348.78ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:12,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 66 Invalid, 384 Unknown, 0 Unchecked, 5.70ms Time], IncrementalHoareTripleChecker [55 Valid, 282 Invalid, 0 Unknown, 47 Unchecked, 348.78ms Time] [2021-11-13 17:53:12,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-13 17:53:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2021-11-13 17:53:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 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) [2021-11-13 17:53:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2021-11-13 17:53:12,603 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2021-11-13 17:53:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:12,605 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2021-11-13 17:53:12,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 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) [2021-11-13 17:53:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2021-11-13 17:53:12,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-13 17:53:12,607 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:12,608 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:12,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:12,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:12,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -301520475, now seen corresponding path program 3 times [2021-11-13 17:53:12,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:12,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955916689] [2021-11-13 17:53:12,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:12,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:12,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:12,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955916689] [2021-11-13 17:53:12,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955916689] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:12,956 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343234934] [2021-11-13 17:53:12,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:53:12,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:12,957 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:12,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 17:53:13,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-13 17:53:13,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:53:13,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:53:13,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:13,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:13,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343234934] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:53:13,273 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:53:13,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-11-13 17:53:13,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305505450] [2021-11-13 17:53:13,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:13,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-13 17:53:13,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 17:53:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-11-13 17:53:13,276 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2021-11-13 17:53:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:13,409 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2021-11-13 17:53:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-13 17:53:13,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 24 [2021-11-13 17:53:13,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:13,411 INFO L225 Difference]: With dead ends: 45 [2021-11-13 17:53:13,411 INFO L226 Difference]: Without dead ends: 30 [2021-11-13 17:53:13,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:53:13,412 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 73.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.43ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.20ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:13,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 29 Invalid, 99 Unknown, 0 Unchecked, 1.43ms Time], IncrementalHoareTripleChecker [25 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 88.20ms Time] [2021-11-13 17:53:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-13 17:53:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-11-13 17:53:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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) [2021-11-13 17:53:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-11-13 17:53:13,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2021-11-13 17:53:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:13,421 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-11-13 17:53:13,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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) [2021-11-13 17:53:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-11-13 17:53:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-13 17:53:13,422 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:13,423 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:13,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:13,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-13 17:53:13,649 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1384678109, now seen corresponding path program 4 times [2021-11-13 17:53:13,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:13,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410707840] [2021-11-13 17:53:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:13,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:14,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:14,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410707840] [2021-11-13 17:53:14,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410707840] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:14,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953278725] [2021-11-13 17:53:14,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-13 17:53:14,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:14,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:14,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 17:53:14,599 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-13 17:53:14,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:53:14,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-13 17:53:14,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:14,726 INFO L388 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 17 treesize of output 13 [2021-11-13 17:53:14,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:14,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-13 17:53:15,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:15,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:15,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-13 17:53:15,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:53:15,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:15,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:15,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2021-11-13 17:53:15,536 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-11-13 17:53:15,537 INFO L388 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 48 treesize of output 38 [2021-11-13 17:53:15,728 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-13 17:53:15,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 45 [2021-11-13 17:53:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:15,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:28,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse1 (= (mod .cse0 3) 0))) (and (or (<= 0 .cse0) .cse1 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))))) (* 2 ~N~0)))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) .cse7)))) (* 2 ~N~0))) (and (< .cse0 0) (not .cse1))))) (<= ~N~0 .cse0)))) is different from false [2021-11-13 17:53:28,282 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 17:53:28,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 408 treesize of output 408 [2021-11-13 17:53:28,357 INFO L388 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 16 treesize of output 8 [2021-11-13 17:53:28,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2021-11-13 17:53:28,628 INFO L354 Elim1Store]: treesize reduction 25, result has 39.0 percent of original size [2021-11-13 17:53:28,629 INFO L388 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 3341 treesize of output 3052 [2021-11-13 17:53:28,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-13 17:53:28,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:53:28,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-11-13 17:53:28,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100822364] [2021-11-13 17:53:28,693 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:28,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-13 17:53:28,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:28,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-13 17:53:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1155, Unknown=5, NotChecked=70, Total=1406 [2021-11-13 17:53:28,696 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) [2021-11-13 17:53:29,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:29,659 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2021-11-13 17:53:29,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-13 17:53:29,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 26 [2021-11-13 17:53:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:29,665 INFO L225 Difference]: With dead ends: 51 [2021-11-13 17:53:29,666 INFO L226 Difference]: Without dead ends: 47 [2021-11-13 17:53:29,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=296, Invalid=1959, Unknown=5, NotChecked=92, Total=2352 [2021-11-13 17:53:29,669 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 211.11ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.34ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 245.52ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:29,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 227 Unknown, 0 Unchecked, 2.34ms Time], IncrementalHoareTripleChecker [30 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 245.52ms Time] [2021-11-13 17:53:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-11-13 17:53:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2021-11-13 17:53:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 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) [2021-11-13 17:53:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2021-11-13 17:53:29,679 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 26 [2021-11-13 17:53:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:29,679 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2021-11-13 17:53:29,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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) [2021-11-13 17:53:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2021-11-13 17:53:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-13 17:53:29,681 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:29,681 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:29,720 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:29,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:29,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:29,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1377888545, now seen corresponding path program 5 times [2021-11-13 17:53:29,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:29,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18606976] [2021-11-13 17:53:29,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:29,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:30,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:30,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18606976] [2021-11-13 17:53:30,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18606976] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:30,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934001100] [2021-11-13 17:53:30,013 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-13 17:53:30,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:30,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:30,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 17:53:30,100 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-11-13 17:53:30,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:53:30,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-13 17:53:30,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:30,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:30,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934001100] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:53:30,450 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:53:30,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-11-13 17:53:30,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986289253] [2021-11-13 17:53:30,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:30,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-13 17:53:30,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:30,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-13 17:53:30,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:53:30,452 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2021-11-13 17:53:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:30,736 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2021-11-13 17:53:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:53:30,736 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-13 17:53:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:30,737 INFO L225 Difference]: With dead ends: 49 [2021-11-13 17:53:30,737 INFO L226 Difference]: Without dead ends: 45 [2021-11-13 17:53:30,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-11-13 17:53:30,739 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 42 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 148.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.18ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 183.22ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:30,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 34 Invalid, 265 Unknown, 0 Unchecked, 2.18ms Time], IncrementalHoareTripleChecker [19 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 183.22ms Time] [2021-11-13 17:53:30,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-13 17:53:30,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-11-13 17:53:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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) [2021-11-13 17:53:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2021-11-13 17:53:30,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2021-11-13 17:53:30,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:30,756 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2021-11-13 17:53:30,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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) [2021-11-13 17:53:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2021-11-13 17:53:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-13 17:53:30,759 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:30,759 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:30,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:30,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-11-13 17:53:30,978 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash -483356095, now seen corresponding path program 6 times [2021-11-13 17:53:30,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:30,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34126944] [2021-11-13 17:53:30,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:30,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:31,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:31,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34126944] [2021-11-13 17:53:31,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34126944] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:31,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437443462] [2021-11-13 17:53:31,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-13 17:53:31,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:31,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:31,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:31,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-13 17:53:31,179 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-11-13 17:53:31,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:53:31,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-13 17:53:31,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:31,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:31,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437443462] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:53:31,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:53:31,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-11-13 17:53:31,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001038928] [2021-11-13 17:53:31,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:53:31,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-13 17:53:31,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:53:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-13 17:53:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:53:31,497 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:53:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:53:31,655 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2021-11-13 17:53:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-13 17:53:31,656 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-13 17:53:31,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:53:31,657 INFO L225 Difference]: With dead ends: 53 [2021-11-13 17:53:31,657 INFO L226 Difference]: Without dead ends: 35 [2021-11-13 17:53:31,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-11-13 17:53:31,658 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.99ms SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 104.96ms IncrementalHoareTripleChecker+Time [2021-11-13 17:53:31,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 25 Invalid, 122 Unknown, 0 Unchecked, 1.99ms Time], IncrementalHoareTripleChecker [34 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 104.96ms Time] [2021-11-13 17:53:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-13 17:53:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-11-13 17:53:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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) [2021-11-13 17:53:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-11-13 17:53:31,666 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2021-11-13 17:53:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:53:31,667 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-11-13 17:53:31,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:53:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-11-13 17:53:31,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-13 17:53:31,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:53:31,668 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:53:31,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-13 17:53:31,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-13 17:53:31,869 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:53:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:53:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1023492733, now seen corresponding path program 7 times [2021-11-13 17:53:31,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:53:31,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231486393] [2021-11-13 17:53:31,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:53:31,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:53:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:33,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:53:33,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231486393] [2021-11-13 17:53:33,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231486393] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:53:33,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699936670] [2021-11-13 17:53:33,459 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-11-13 17:53:33,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:53:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:53:33,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:53:33,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-13 17:53:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:53:33,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-13 17:53:33,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:53:33,562 INFO L388 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 10 treesize of output 8 [2021-11-13 17:53:33,610 INFO L388 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 17 treesize of output 13 [2021-11-13 17:53:33,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:33,734 INFO L388 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 39 treesize of output 38 [2021-11-13 17:53:33,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:33,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:33,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:33,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 96 [2021-11-13 17:53:34,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 106 [2021-11-13 17:53:34,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:53:34,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:34,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 105 [2021-11-13 17:53:35,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:35,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:35,286 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:53:35,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:53:35,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100 [2021-11-13 17:53:36,302 INFO L354 Elim1Store]: treesize reduction 550, result has 9.1 percent of original size [2021-11-13 17:53:36,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 385 treesize of output 280 [2021-11-13 17:53:44,061 INFO L354 Elim1Store]: treesize reduction 150, result has 0.7 percent of original size [2021-11-13 17:53:44,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 247 [2021-11-13 17:53:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:53:44,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:53:47,284 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse3 4)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| .cse1)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse3)))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse3)) .cse1 .cse2)))) (* 2 c_~N~0))) is different from false [2021-11-13 17:54:15,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (or (let ((.cse12 (= (mod .cse0 3) 0))) (and (or (<= 0 .cse0) (let ((.cse6 (= (mod |c_ULTIMATE.start_main_~i~0#1| 3) 0))) (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse5 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))) (* 2 ~N~0))) (not .cse6)) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse11 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse11) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse11 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))) (* 2 ~N~0))) .cse6))) .cse12) (or (and (or (< |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse17) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse17 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ .cse13 .cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12))))))) (* 2 ~N~0)))) (or (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse22 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse22) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse22 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse19 (select .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse20 (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |ULTIMATE.start_main_~#sum~0#1.offset| .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (+ (select (select (store .cse18 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse19 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse20 .cse21))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)) .cse20 .cse21))))) (* 2 ~N~0))))) (and (< .cse0 0) (not .cse12))))) (<= ~N~0 .cse0)))) is different from false [2021-11-13 17:54:35,909 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 17:54:35,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2293 treesize of output 2293 [2021-11-13 17:54:36,053 INFO L388 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 16 treesize of output 8 [2021-11-13 17:54:36,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2021-11-13 17:54:37,402 INFO L354 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2021-11-13 17:54:37,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10278064 treesize of output 9545401 [2021-11-13 17:55:08,251 WARN L227 SmtUtils]: Spent 30.83s on a formula simplification that was a NOOP. DAG size: 3895 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-13 17:55:37,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-11-13 17:55:37,942 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:55:37,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2021-11-13 17:55:37,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042363725] [2021-11-13 17:55:37,942 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-13 17:55:37,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-13 17:55:37,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:55:37,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-13 17:55:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1740, Unknown=21, NotChecked=174, Total=2162 [2021-11-13 17:55:37,946 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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) [2021-11-13 17:55:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:55:40,745 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2021-11-13 17:55:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-13 17:55:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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 31 [2021-11-13 17:55:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:55:40,747 INFO L225 Difference]: With dead ends: 54 [2021-11-13 17:55:40,747 INFO L226 Difference]: Without dead ends: 35 [2021-11-13 17:55:40,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=355, Invalid=2938, Unknown=21, NotChecked=226, Total=3540 [2021-11-13 17:55:40,751 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 405.86ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.98ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 470.87ms IncrementalHoareTripleChecker+Time [2021-11-13 17:55:40,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 36 Invalid, 372 Unknown, 0 Unchecked, 2.98ms Time], IncrementalHoareTripleChecker [32 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 470.87ms Time] [2021-11-13 17:55:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-13 17:55:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-11-13 17:55:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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) [2021-11-13 17:55:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2021-11-13 17:55:40,759 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2021-11-13 17:55:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:55:40,759 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2021-11-13 17:55:40,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 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) [2021-11-13 17:55:40,760 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2021-11-13 17:55:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-13 17:55:40,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:55:40,761 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:55:40,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-13 17:55:40,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:55:40,981 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:55:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:55:40,982 INFO L85 PathProgramCache]: Analyzing trace with hash -403759035, now seen corresponding path program 8 times [2021-11-13 17:55:40,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:55:40,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374744486] [2021-11-13 17:55:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:55:40,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:55:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:55:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:55:41,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:55:41,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374744486] [2021-11-13 17:55:41,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374744486] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:55:41,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067274252] [2021-11-13 17:55:41,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:55:41,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:55:41,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:55:41,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:55:41,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-13 17:55:41,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:55:41,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:55:41,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 17:55:41,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:55:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:55:41,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:55:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:55:41,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067274252] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:55:41,634 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:55:41,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-11-13 17:55:41,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057039645] [2021-11-13 17:55:41,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:55:41,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-13 17:55:41,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:55:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-13 17:55:41,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-11-13 17:55:41,636 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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) [2021-11-13 17:55:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:55:41,939 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-11-13 17:55:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:55:41,940 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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 33 [2021-11-13 17:55:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:55:41,941 INFO L225 Difference]: With dead ends: 43 [2021-11-13 17:55:41,941 INFO L226 Difference]: Without dead ends: 39 [2021-11-13 17:55:41,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-11-13 17:55:41,943 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 139.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.52ms SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 172.52ms IncrementalHoareTripleChecker+Time [2021-11-13 17:55:41,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 28 Invalid, 210 Unknown, 0 Unchecked, 2.52ms Time], IncrementalHoareTripleChecker [30 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 172.52ms Time] [2021-11-13 17:55:41,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-13 17:55:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2021-11-13 17:55:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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) [2021-11-13 17:55:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-11-13 17:55:41,953 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2021-11-13 17:55:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:55:41,954 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-11-13 17:55:41,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 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) [2021-11-13 17:55:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-11-13 17:55:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-13 17:55:41,955 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:55:41,955 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:55:41,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-13 17:55:42,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:55:42,165 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:55:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:55:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash -880704545, now seen corresponding path program 9 times [2021-11-13 17:55:42,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:55:42,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798346904] [2021-11-13 17:55:42,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:55:42,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:55:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:55:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:55:43,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:55:43,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798346904] [2021-11-13 17:55:43,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798346904] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:55:43,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280551165] [2021-11-13 17:55:43,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:55:43,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:55:43,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:55:43,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:55:43,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-13 17:55:44,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-13 17:55:44,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:55:44,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-13 17:55:44,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:55:44,232 INFO L388 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 17 treesize of output 13 [2021-11-13 17:55:44,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-13 17:55:44,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,557 INFO L354 Elim1Store]: treesize reduction 120, result has 29.0 percent of original size [2021-11-13 17:55:44,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 110 [2021-11-13 17:55:44,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,653 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 17:55:44,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2021-11-13 17:55:44,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:44,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2021-11-13 17:55:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,286 INFO L354 Elim1Store]: treesize reduction 150, result has 24.6 percent of original size [2021-11-13 17:55:45,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 181 [2021-11-13 17:55:45,363 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:55:45,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2021-11-13 17:55:45,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,429 INFO L354 Elim1Store]: treesize reduction 24, result has 20.0 percent of original size [2021-11-13 17:55:45,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 44 [2021-11-13 17:55:45,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2021-11-13 17:55:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 51 [2021-11-13 17:55:45,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:55:45,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 49 [2021-11-13 17:55:55,953 WARN L227 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:09,038 WARN L227 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:19,608 WARN L227 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:19,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:19,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:20,021 INFO L354 Elim1Store]: treesize reduction 632, result has 0.2 percent of original size [2021-11-13 17:56:20,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 27 case distinctions, treesize of input 300 treesize of output 296 [2021-11-13 17:56:28,617 WARN L227 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:38,310 WARN L227 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:38,693 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:56:38,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:38,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:38,717 INFO L354 Elim1Store]: treesize reduction 644, result has 0.2 percent of original size [2021-11-13 17:56:38,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 321 treesize of output 303 [2021-11-13 17:56:47,288 WARN L227 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:58,390 WARN L227 SmtUtils]: Spent 10.48s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:56:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:58,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:58,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:56:58,787 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-13 17:56:58,805 INFO L354 Elim1Store]: treesize reduction 644, result has 0.2 percent of original size [2021-11-13 17:56:58,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 327 treesize of output 303 [2021-11-13 17:57:07,373 WARN L227 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:57:16,150 WARN L227 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:57:16,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:16,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:16,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:16,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:16,615 INFO L354 Elim1Store]: treesize reduction 760, result has 0.1 percent of original size [2021-11-13 17:57:16,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 4 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 33 case distinctions, treesize of input 353 treesize of output 320 [2021-11-13 17:57:29,212 WARN L227 SmtUtils]: Spent 12.12s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:57:37,897 WARN L227 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:57:46,514 WARN L227 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:57:46,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:46,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:46,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:46,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:46,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:57:46,834 INFO L354 Elim1Store]: treesize reduction 836, result has 9.8 percent of original size [2021-11-13 17:57:46,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 206 treesize of output 202 [2021-11-13 17:57:54,095 INFO L354 Elim1Store]: treesize reduction 380, result has 35.0 percent of original size [2021-11-13 17:57:54,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 274 treesize of output 352 [2021-11-13 17:57:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:57:56,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:58:26,428 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Shadow problem: [|ULTIMATE.start_main_~i~0#1|] [2021-11-13 17:58:26,429 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:58:26,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-11-13 17:58:26,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713197353] [2021-11-13 17:58:26,429 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-13 17:58:26,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-13 17:58:26,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-13 17:58:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=4103, Unknown=13, NotChecked=0, Total=4692 [2021-11-13 17:58:26,432 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2021-11-13 17:58:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:28,697 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2021-11-13 17:58:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-13 17:58:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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 36 [2021-11-13 17:58:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:28,699 INFO L225 Difference]: With dead ends: 44 [2021-11-13 17:58:28,699 INFO L226 Difference]: Without dead ends: 40 [2021-11-13 17:58:28,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2473 ImplicationChecksByTransitivity, 145.9s TimeCoverageRelationStatistics Valid=850, Invalid=6277, Unknown=13, NotChecked=0, Total=7140 [2021-11-13 17:58:28,703 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 352.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.69ms SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 410.05ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:28,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 54 Invalid, 347 Unknown, 0 Unchecked, 2.69ms Time], IncrementalHoareTripleChecker [54 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 410.05ms Time] [2021-11-13 17:58:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-13 17:58:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-11-13 17:58:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 39 states have internal predecessors, (41), 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) [2021-11-13 17:58:28,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-11-13 17:58:28,711 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2021-11-13 17:58:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:28,711 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-11-13 17:58:28,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 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) [2021-11-13 17:58:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-11-13 17:58:28,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-13 17:58:28,713 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:28,713 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:58:28,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-13 17:58:28,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:58:28,941 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1812577787, now seen corresponding path program 10 times [2021-11-13 17:58:28,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:28,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664079424] [2021-11-13 17:58:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:28,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:58:29,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:29,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664079424] [2021-11-13 17:58:29,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664079424] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:58:29,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141661569] [2021-11-13 17:58:29,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-13 17:58:29,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:58:29,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:58:29,133 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:58:29,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-13 17:58:29,192 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-13 17:58:29,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:58:29,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-13 17:58:29,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:58:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:58:29,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:58:29,613 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:58:29,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141661569] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:58:29,614 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:58:29,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2021-11-13 17:58:29,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984577547] [2021-11-13 17:58:29,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:58:29,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-13 17:58:29,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:58:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-13 17:58:29,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-11-13 17:58:29,618 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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) [2021-11-13 17:58:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 17:58:29,841 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2021-11-13 17:58:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-13 17:58:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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 39 [2021-11-13 17:58:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 17:58:29,842 INFO L225 Difference]: With dead ends: 69 [2021-11-13 17:58:29,842 INFO L226 Difference]: Without dead ends: 45 [2021-11-13 17:58:29,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2021-11-13 17:58:29,844 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.62ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 150.59ms IncrementalHoareTripleChecker+Time [2021-11-13 17:58:29,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 40 Invalid, 227 Unknown, 0 Unchecked, 1.62ms Time], IncrementalHoareTripleChecker [39 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 150.59ms Time] [2021-11-13 17:58:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-11-13 17:58:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-11-13 17:58:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 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) [2021-11-13 17:58:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2021-11-13 17:58:29,854 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2021-11-13 17:58:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 17:58:29,854 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2021-11-13 17:58:29,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 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) [2021-11-13 17:58:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2021-11-13 17:58:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-13 17:58:29,856 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 17:58:29,856 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 17:58:29,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-13 17:58:30,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:58:30,081 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:58:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:58:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1463861959, now seen corresponding path program 11 times [2021-11-13 17:58:30,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:58:30,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865214326] [2021-11-13 17:58:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:58:30,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:58:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:58:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:58:32,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:58:32,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865214326] [2021-11-13 17:58:32,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865214326] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:58:32,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332592674] [2021-11-13 17:58:32,413 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-13 17:58:32,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:58:32,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 17:58:32,414 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:58:32,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1b81a0ad-f698-4725-9867-3d1990741834/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-13 17:58:32,673 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-11-13 17:58:32,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:58:32,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 44 conjunts are in the unsatisfiable core [2021-11-13 17:58:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:58:32,701 INFO L388 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 10 treesize of output 8 [2021-11-13 17:58:32,746 INFO L388 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 17 treesize of output 13 [2021-11-13 17:58:32,759 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-13 17:58:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:32,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:32,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 92 [2021-11-13 17:58:32,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:32,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 20 [2021-11-13 17:58:33,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 123 [2021-11-13 17:58:33,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 44 [2021-11-13 17:58:33,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 154 [2021-11-13 17:58:33,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:33,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 46 [2021-11-13 17:58:33,925 INFO L354 Elim1Store]: treesize reduction 790, result has 15.3 percent of original size [2021-11-13 17:58:33,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 301 treesize of output 381 [2021-11-13 17:58:34,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:34,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 78 [2021-11-13 17:58:53,872 INFO L354 Elim1Store]: treesize reduction 424, result has 0.2 percent of original size [2021-11-13 17:58:53,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 379 treesize of output 390 [2021-11-13 17:58:56,827 INFO L354 Elim1Store]: treesize reduction 415, result has 0.2 percent of original size [2021-11-13 17:58:56,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 310 [2021-11-13 17:58:59,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:58:59,443 INFO L354 Elim1Store]: treesize reduction 439, result has 0.2 percent of original size [2021-11-13 17:58:59,444 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 287 treesize of output 296 [2021-11-13 17:59:02,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:02,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:02,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:02,642 INFO L354 Elim1Store]: treesize reduction 625, result has 0.2 percent of original size [2021-11-13 17:59:02,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 318 treesize of output 330 [2021-11-13 17:59:08,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:08,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:08,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-13 17:59:08,050 INFO L354 Elim1Store]: treesize reduction 625, result has 0.2 percent of original size [2021-11-13 17:59:08,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 25 case distinctions, treesize of input 318 treesize of output 330 [2021-11-13 17:59:20,096 INFO L354 Elim1Store]: treesize reduction 1570, result has 6.9 percent of original size [2021-11-13 17:59:20,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 6 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 409 treesize of output 396 [2021-11-13 17:59:30,914 INFO L354 Elim1Store]: treesize reduction 182, result has 1.6 percent of original size [2021-11-13 17:59:30,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 502 treesize of output 397 [2021-11-13 17:59:33,085 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:59:33,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:59:37,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse4 (- 1)) (* .cse2 (- 1)) (* .cse3 (- 1)) (* .cse1 (- 1)))))))) (- 2)) 6)) is different from false [2021-11-13 18:00:12,905 WARN L227 SmtUtils]: Spent 18.17s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 18:00:14,972 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse7 (= (mod .cse0 3) 0))) (and (or (<= 0 .cse0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse6 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse3 (- 1)) (* .cse4 (- 1)) (* .cse5 (- 1)) (* .cse6 (- 1))))))))) (- 2)) 6)) .cse7) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |ULTIMATE.start_main_~#sum~0#1.offset| .cse8)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse13 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse8 (- 1)) (* .cse9 (- 1)) (* (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse9 .cse8 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse13 (- 1)) (* .cse12 (- 1))))))))) (- 2)) 6)) (and (< .cse0 0) (not .cse7)))))) is different from false [2021-11-13 18:00:17,436 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse15 (= (mod .cse14 3) 0))) (and (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| .cse5)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse0 (- 1)) (* .cse1 (- 1)) (* (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse0 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse4 (- 1)) (* .cse5 (- 1))))))))) (- 2)) 6)) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (or (< |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse13 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse13 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| .cse10)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse7 (- 1)) (* (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse11 (- 1)) (* .cse10 (- 1)) (* .cse12 (- 1))))))))) (- 2)) 6)))) (and (< .cse14 0) (not .cse15))) (or (<= 0 .cse14) (let ((.cse16 (= (mod |c_ULTIMATE.start_main_~i~0#1| 3) 0))) (and (or .cse16 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse20 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse17 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse18 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse17 (- 1)) (* .cse18 (- 1)) (* .cse19 (- 1)) (* .cse20 (- 1)) (* (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse18 .cse20 .cse17))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse30 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse30) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse30 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))))))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse24 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse26 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |ULTIMATE.start_main_~#sum~0#1.offset| .cse24)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse29 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse25 (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse24 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse24 (- 1)) (* .cse25 (- 1)) (* .cse26 (- 1)) (* (select (select (store .cse27 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse28 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse24 .cse29 .cse25))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse29 (- 1))))))))) (- 2)) 6)) (not .cse16)))) .cse15)))) is different from false [2021-11-13 18:00:19,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse7 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse16 (= (mod .cse15 3) 0))) (and (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse6 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse6) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse4 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse5 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse0 (- 1)) (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse4 (- 1)) (* .cse3 (- 1)) (* .cse5 (- 1))))))))) (- 2)) 6)) (< .cse7 0)) (or (<= 0 .cse7) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse14 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse14) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)))))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse12 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse11 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse12 .cse13 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse8 (- 1)) (* (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12 .cse13 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse12 (- 1)) (* .cse11 (- 1)) (* .cse13 (- 1))))))))) (- 2)) 6)))) (and (< .cse15 0) (not .cse16))) (or (<= 0 .cse15) (let ((.cse24 (= (mod .cse7 3) 0))) (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse23 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse23 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse23) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))))))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse17 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse22 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse18 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse22 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse17 (- 1)) (* .cse18 (- 1)) (* .cse19 (- 1)) (* (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse17 .cse22 .cse19))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse22 (- 1))))))))) (- 2)) 6)) .cse24) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse31 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse31 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse31) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse26 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| .cse28)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse25 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse25 (- 1)) (* .cse26 (- 1)) (* .cse27 (- 1)) (* .cse28 (- 1)) (* (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse25 .cse27 .cse26 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)) (not .cse24)))) .cse16)))) is different from false [2021-11-13 18:02:03,217 WARN L227 SmtUtils]: Spent 55.53s on a formula simplification that was a NOOP. DAG size: 242 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 18:02:05,543 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse41 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= 0 .cse41)) (.cse15 (< .cse41 0)) (.cse17 (= (mod .cse16 3) 0))) (and (or (and (or .cse0 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse7 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse7) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse7) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))))))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| .cse3)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse4 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse1 (- 1)) (* .cse2 (- 1)) (* .cse3 (- 1)) (* .cse4 (- 1)) (* (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse14 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse14 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse14) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse14) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse13 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse10 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse12 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse11 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse11 .cse12 .cse13))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse11 (- 1)) (* .cse12 (- 1)) (* .cse10 (- 1)) (* .cse13 (- 1))))))))) (- 2)) 6)) .cse15)) (and (< .cse16 0) (not .cse17))) (or (<= 0 .cse16) (let ((.cse18 (= (mod |c_ULTIMATE.start_main_~i~0#1| 3) 0))) (and (or .cse0 .cse18 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse25 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse25) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse25) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))))))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse22 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse23 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |ULTIMATE.start_main_~#sum~0#1.offset| .cse22)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse21 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse24 (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* (select (select (store .cse19 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse20 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse24))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse22 (- 1)) (* .cse24 (- 1)) (* .cse21 (- 1)) (* .cse23 (- 1))))))))) (- 2)) 6))) (or (let ((.cse26 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (or (< .cse26 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse33) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse33) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse31 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse28 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| .cse31)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse32 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse28))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse31 .cse28 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse27 (- 1)) (* .cse28 (- 1)) (* (select (select (store .cse29 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse30 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse31 .cse28 .cse32))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse31 (- 1)) (* .cse32 (- 1))))))))) (- 2)) 6))) (or (<= 0 .cse26) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse40 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse40) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse40) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse38 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |ULTIMATE.start_main_~#sum~0#1.offset| .cse36)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse39 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse37 (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* (select (select (store .cse34 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse38 .cse39))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse36 (- 1)) (* .cse39 (- 1)) (* .cse37 (- 1)) (* .cse38 (- 1))))))))) (- 2)) 6))))) (and .cse15 (not .cse18))))) .cse17)))) is different from false [2021-11-13 18:02:10,563 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_ULTIMATE.start_main_~i~0#1| 3) 0)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (< |c_ULTIMATE.start_main_~i~0#1| 0) (not .cse0)) (and (or (<= 0 .cse1) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse9) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse8) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse8) .cse9))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse2 (- 1)) (* .cse3 (- 1)) (* (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse6 (- 1)) (* .cse7 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse17 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse17) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse16) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse16) .cse17))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| .cse10)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse14 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse10 (- 1)) (* (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse15 (- 1)) (* .cse13 (- 1)) (* .cse14 (- 1))))))))) (- 2)) 6)) (< .cse1 0)))) (or .cse0 (let ((.cse53 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse36 (= (mod .cse1 3) 0)) (.cse18 (<= 0 .cse53)) (.cse35 (< .cse53 0))) (and (or (and (or .cse18 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse26 (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse26) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse25 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse25) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse25) .cse26))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse24 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse24 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse19 (- 1)) (* .cse20 (- 1)) (* .cse21 (- 1)) (* (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21 .cse24 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse24 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse34 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33) (+ (- 3) .cse34)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse33) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse33) .cse34))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse29 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse28 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse27 (- 1)) (* .cse28 (- 1)) (* .cse29 (- 1)) (* .cse30 (- 1)) (* (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse27 .cse30 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)) .cse35)) .cse36) (or (not .cse36) (and (or .cse18 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse44 (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse44) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse43) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse43) .cse44))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse38 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse42 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse37 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse37 (- 1)) (* .cse38 (- 1)) (* .cse39 (- 1)) (* (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse42 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse52 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) (+ (- 3) .cse52)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse51) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse51) .cse52))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse49 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse45 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse45 (- 1)) (* .cse46 (- 1)) (* (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse45 .cse50 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse50 (- 1)) (* .cse49 (- 1))))))))) (- 2)) 6)) .cse35)))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2021-11-13 18:02:12,576 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_ULTIMATE.start_main_~i~0#1| 3) 0)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (< |c_ULTIMATE.start_main_~i~0#1| 0) (not .cse0)) (and (or (<= 0 .cse1) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8) .cse9) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse8) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse8) .cse9))))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse7 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| .cse2)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse2 (- 1)) (* .cse3 (- 1)) (* (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse6 .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse6 (- 1)) (* .cse7 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse16 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse17 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16) .cse17) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse16 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse16) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse16) .cse17))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse15 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| .cse10)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse13 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse14 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse10 (- 1)) (* (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse13 .cse14 .cse10 .cse15))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse15 (- 1)) (* .cse13 (- 1)) (* .cse14 (- 1))))))))) (- 2)) 6)) (< .cse1 0)))) (or .cse0 (let ((.cse53 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse36 (= (mod .cse1 3) 0)) (.cse18 (<= 0 .cse53)) (.cse35 (< .cse53 0))) (and (or (and (or .cse18 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse25 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse26 (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse25) .cse26) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse25 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse25) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse25) .cse26))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse19 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse20 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| .cse19)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse24 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse21 (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse24 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse19 (- 1)) (* .cse20 (- 1)) (* .cse21 (- 1)) (* (select (select (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse23 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse19 .cse21 .cse24 .cse20))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse24 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse34 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33) (+ (- 3) .cse34)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse33 4) (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse33) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse33) .cse34))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse27 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse29 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| .cse27)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse28 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse27 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse27 (- 1)) (* .cse28 (- 1)) (* .cse29 (- 1)) (* .cse30 (- 1)) (* (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse28 .cse27 .cse30 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)) .cse35)) .cse36) (or (not .cse36) (and (or .cse18 (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse43 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse44 (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43) .cse44) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse43 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse43) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse43) .cse44))))) (let ((.cse41 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse39 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse38 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| .cse39)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse42 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse37 (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse37 (- 1)) (* .cse38 (- 1)) (* .cse39 (- 1)) (* (select (select (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse41 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse37 .cse42 .cse39 .cse38))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse42 (- 1))))))))) (- 2)) 6))) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse51 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse52 (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51) (+ (- 3) .cse52)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse51 4) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse51) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse51) .cse52))))) (let ((.cse48 (select .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse49 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse46 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse45 (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse45 (- 1)) (* .cse46 (- 1)) (* (select (select (store .cse47 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse45 .cse50 .cse46))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse50 (- 1)) (* .cse49 (- 1))))))))) (- 2)) 6)) .cse35)))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)))) is different from true [2021-11-13 18:02:15,091 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse37 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (= (mod .cse0 3) 0))) (and (or (<= 0 .cse0) .cse1 (let ((.cse38 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (<= 0 .cse38)) (.cse19 (< .cse38 0)) (.cse20 (= (mod .cse37 3) 0))) (and (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8 4) .cse9) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse8) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse8) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse8) .cse9))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse2 (- 1)) (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse5 (- 1)) (* .cse7 (- 1)) (* .cse6 (- 1))))))))) (- 2)) 6)) .cse10) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse17 4) (+ (- 3) .cse18)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse17) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse17) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse17) .cse18))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| .cse11)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse11 (- 1)) (* .cse12 (- 1)) (* .cse13 (- 1)) (* .cse14 (- 1)) (* (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)) .cse19)) (not .cse20)) (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse27 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse28 (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27 4) .cse28) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse27) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse27) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse27) .cse28))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse21 (- 1)) (* .cse22 (- 1)) (* .cse23 (- 1)) (* (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse26 (- 1))))))))) (- 2)) 6)) .cse10) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse36 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse35 4) (+ (- 3) .cse36)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse35) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse35) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse35) .cse36))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse32 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse34 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse29 (- 1)) (* (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse33 (- 1)) (* .cse32 (- 1)) (* .cse34 (- 1))))))))) (- 2)) 6)) .cse19)) .cse20))))) (or (and (or (<= 0 .cse37) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse46 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse45 4) .cse46) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse45) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse45) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse45) .cse46))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse40 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| .cse42)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse41 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse39 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse40 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse39 (- 1)) (* .cse40 (- 1)) (* .cse41 (- 1)) (* .cse42 (- 1)) (* (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse40 .cse39 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6))) (or (< .cse37 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse53 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse54 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse53 4) .cse54) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse53) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse53) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse53) .cse54))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse47 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse47 (- 1)) (* .cse48 (- 1)) (* .cse49 (- 1)) (* .cse50 (- 1)) (* (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse47 .cse50 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)))) (and (< .cse0 0) (not .cse1)))))) is different from false [2021-11-13 18:02:17,104 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse37 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse1 (= (mod .cse0 3) 0))) (and (or (<= 0 .cse0) .cse1 (let ((.cse38 (+ |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse10 (<= 0 .cse38)) (.cse19 (< .cse38 0)) (.cse20 (= (mod .cse37 3) 0))) (and (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse9 (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse8 4) .cse9) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse8) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse8) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse8) .cse9))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse5 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| .cse7)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse2 (- 1)) (* (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse5 (- 1)) (* .cse7 (- 1)) (* .cse6 (- 1))))))))) (- 2)) 6)) .cse10) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse18 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse17 4) (+ (- 3) .cse18)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse17) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse17) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse17) .cse18))))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse12 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| .cse11)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse13 (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse14 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse11 (- 1)) (* .cse12 (- 1)) (* .cse13 (- 1)) (* .cse14 (- 1)) (* (select (select (store .cse15 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse16 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse13 .cse14 .cse12))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)) .cse19)) (not .cse20)) (or (and (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse27 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse28 (+ (- 3) (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3)))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse27 4) .cse28) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse27) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse27) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse27) .cse28))))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| .cse21)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse21 .cse22))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse21 (- 1)) (* .cse22 (- 1)) (* .cse23 (- 1)) (* (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse26 .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse26 (- 1))))))))) (- 2)) 6)) .cse10) (or (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse36 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse35 4) (+ (- 3) .cse36)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse35) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse35) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse35) .cse36))))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse32 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse34 (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29 .cse33))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse29 (- 1)) (* (select (select (store .cse30 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse31 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse32 .cse29 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1)) (* .cse33 (- 1)) (* .cse32 (- 1)) (* .cse34 (- 1))))))))) (- 2)) 6)) .cse19)) .cse20))))) (or (and (or (<= 0 .cse37) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse46 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse45 4) .cse46) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse45) (+ (- 3) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse45) (+ (- 3) (mod |c_ULTIMATE.start_main_~i~0#1| 3))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse45) .cse46))))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse40 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| .cse42)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse41 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse40 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse39 (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse40 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse39 (- 1)) (* .cse40 (- 1)) (* .cse41 (- 1)) (* .cse42 (- 1)) (* (select (select (store .cse43 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse44 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse40 .cse39 .cse42))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6))) (or (< .cse37 0) (forall ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (<= (div (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse53 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse54 (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 3))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse53 4) .cse54) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8 .cse53) (mod (+ 2 |c_ULTIMATE.start_main_~i~0#1|) 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12 .cse53) (mod |c_ULTIMATE.start_main_~i~0#1| 3)) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16 .cse53) .cse54))))) (let ((.cse52 (select .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse50 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| 0)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (let ((.cse47 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| .cse50)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)))) (let ((.cse48 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 12)))) (let ((.cse49 (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse47 .cse50 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 16)))) (+ (* .cse47 (- 1)) (* .cse48 (- 1)) (* .cse49 (- 1)) (* .cse50 (- 1)) (* (select (select (store .cse51 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse52 |ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse47 .cse50 .cse48))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 20)) (- 1))))))))) (- 2)) 6)))) (and (< .cse0 0) (not .cse1)))))) is different from true [2021-11-13 18:02:28,737 WARN L227 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-13 18:02:28,737 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-13 18:02:28,738 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23314 treesize of output 23314 [2021-11-13 18:02:29,383 INFO L388 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 16 treesize of output 8 [2021-11-13 18:02:29,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6