./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/mods.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc --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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:16:43,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:16:43,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:16:43,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:16:43,698 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:16:43,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:16:43,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:16:43,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:16:43,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:16:43,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:16:43,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:16:43,723 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:16:43,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:16:43,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:16:43,729 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:16:43,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:16:43,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:16:43,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:16:43,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:16:43,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:16:43,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:16:43,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:16:43,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:16:43,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:16:43,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:16:43,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:16:43,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:16:43,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:16:43,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:16:43,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:16:43,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:16:43,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:16:43,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:16:43,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:16:43,759 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:16:43,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:16:43,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:16:43,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:16:43,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:16:43,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:16:43,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:16:43,763 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:16:43,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:16:43,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:16:43,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:16:43,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:16:43,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:16:43,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:16:43,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:16:43,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:16:43,788 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:16:43,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:16:43,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:16:43,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:16:43,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:16:43,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:16:43,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:16:43,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:16:43,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:16:43,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:16:43,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:16:43,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:16:43,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:16:43,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:16:43,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:16:43,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:16:43,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:16:43,792 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:16:43,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:16:43,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:16:43,793 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_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/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_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2022-11-02 20:16:44,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:16:44,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:16:44,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:16:44,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:16:44,131 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:16:44,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/array-fpi/mods.c [2022-11-02 20:16:44,205 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/data/e129e361d/abf98c925bb14cb39990ef4664bb0ba6/FLAGd6e15a787 [2022-11-02 20:16:44,840 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:16:44,842 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/sv-benchmarks/c/array-fpi/mods.c [2022-11-02 20:16:44,851 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/data/e129e361d/abf98c925bb14cb39990ef4664bb0ba6/FLAGd6e15a787 [2022-11-02 20:16:45,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/data/e129e361d/abf98c925bb14cb39990ef4664bb0ba6 [2022-11-02 20:16:45,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:16:45,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:16:45,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:45,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:16:45,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:16:45,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4693de1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45, skipping insertion in model container [2022-11-02 20:16:45,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:16:45,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:16:45,462 WARN L230 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_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-02 20:16:45,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:45,507 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:16:45,521 WARN L230 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_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/sv-benchmarks/c/array-fpi/mods.c[587,600] [2022-11-02 20:16:45,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:16:45,547 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:16:45,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45 WrapperNode [2022-11-02 20:16:45,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:16:45,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:16:45,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:16:45,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:16:45,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,579 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,603 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-11-02 20:16:45,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:16:45,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:16:45,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:16:45,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:16:45,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,637 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:16:45,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:16:45,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:16:45,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:16:45,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (1/1) ... [2022-11-02 20:16:45,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:16:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:45,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:16:45,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:16:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:16:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:16:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:16:45,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:16:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:16:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:16:45,845 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:16:45,848 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:16:46,153 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:16:46,160 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:16:46,161 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:16:46,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:16:46 BoogieIcfgContainer [2022-11-02 20:16:46,163 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:16:46,166 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:16:46,166 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:16:46,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:16:46,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:16:45" (1/3) ... [2022-11-02 20:16:46,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4c306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:16:46, skipping insertion in model container [2022-11-02 20:16:46,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:16:45" (2/3) ... [2022-11-02 20:16:46,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e4c306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:16:46, skipping insertion in model container [2022-11-02 20:16:46,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:16:46" (3/3) ... [2022-11-02 20:16:46,175 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2022-11-02 20:16:46,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:16:46,226 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:16:46,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:16:46,337 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@711a6f2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:16:46,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:16:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) [2022-11-02 20:16:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:16:46,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:46,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:46,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:46,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-11-02 20:16:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:46,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732072803] [2022-11-02 20:16:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:46,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:46,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732072803] [2022-11-02 20:16:46,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732072803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:46,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:46,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:16:46,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628132039] [2022-11-02 20:16:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:46,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:16:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:16:46,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:16:46,705 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:46,729 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-11-02 20:16:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:16:46,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:16:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:46,743 INFO L225 Difference]: With dead ends: 50 [2022-11-02 20:16:46,744 INFO L226 Difference]: Without dead ends: 23 [2022-11-02 20:16:46,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:16:46,757 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:46,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:16:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-02 20:16:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-02 20:16:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-02 20:16:46,815 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-11-02 20:16:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:46,815 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-02 20:16:46,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-02 20:16:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:16:46,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:46,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:46,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:16:46,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:46,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-11-02 20:16:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:46,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072428311] [2022-11-02 20:16:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:47,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:47,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:16:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072428311] [2022-11-02 20:16:47,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072428311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:16:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:16:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:16:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061862485] [2022-11-02 20:16:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:16:47,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:16:47,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:16:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:16:47,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:16:47,077 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:16:47,174 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-02 20:16:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:16:47,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 20:16:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:16:47,180 INFO L225 Difference]: With dead ends: 53 [2022-11-02 20:16:47,180 INFO L226 Difference]: Without dead ends: 37 [2022-11-02 20:16:47,180 INFO L412 NwaCegarLoop]: 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 [2022-11-02 20:16:47,182 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:16:47,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:16:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-02 20:16:47,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-02 20:16:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2022-11-02 20:16:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-02 20:16:47,192 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-11-02 20:16:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:16:47,192 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-02 20:16:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:16:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-02 20:16:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:16:47,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:16:47,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:16:47,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:16:47,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:16:47,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:16:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-11-02 20:16:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:16:47,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798597499] [2022-11-02 20:16:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:16:47,254 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:16:47,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1447890917] [2022-11-02 20:16:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:16:47,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:16:47,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:16:47,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:16:47,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:16:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:16:47,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:16:47,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:16:47,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:16:47,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:16:47,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:16:47,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-11-02 20:16:47,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-02 20:16:48,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 51 [2022-11-02 20:16:48,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2022-11-02 20:16:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:16:48,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:17:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:42,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:42,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798597499] [2022-11-02 20:17:42,321 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:17:42,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447890917] [2022-11-02 20:17:42,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447890917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:17:42,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:17:42,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-11-02 20:17:42,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963757782] [2022-11-02 20:17:42,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:17:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:17:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:42,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:17:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=328, Unknown=19, NotChecked=0, Total=420 [2022-11-02 20:17:42,331 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:49,012 WARN L234 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:17:51,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:17:53,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:17:55,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-02 20:17:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:55,773 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-11-02 20:17:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:17:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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 [2022-11-02 20:17:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:55,775 INFO L225 Difference]: With dead ends: 49 [2022-11-02 20:17:55,775 INFO L226 Difference]: Without dead ends: 47 [2022-11-02 20:17:55,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=96, Invalid=437, Unknown=19, NotChecked=0, Total=552 [2022-11-02 20:17:55,777 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:55,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 131 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 172 Invalid, 3 Unknown, 76 Unchecked, 6.5s Time] [2022-11-02 20:17:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-02 20:17:55,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-11-02 20:17:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-11-02 20:17:55,788 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2022-11-02 20:17:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:55,789 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-11-02 20:17:55,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-11-02 20:17:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:17:55,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:55,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:55,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:17:56,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:56,019 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-11-02 20:17:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:56,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013603077] [2022-11-02 20:17:56,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:56,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:56,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:17:56,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587481149] [2022-11-02 20:17:56,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:17:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:56,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:56,051 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:17:56,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:17:56,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:17:56,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:17:56,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:17:56,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:17:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:17:56,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:17:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:17:56,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013603077] [2022-11-02 20:17:56,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:17:56,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587481149] [2022-11-02 20:17:56,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587481149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:17:56,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:17:56,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-02 20:17:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775117390] [2022-11-02 20:17:56,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:17:56,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:17:56,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:56,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:17:56,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:17:56,309 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:56,560 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-11-02 20:17:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:17:56,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 [2022-11-02 20:17:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:56,563 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:17:56,563 INFO L226 Difference]: Without dead ends: 61 [2022-11-02 20:17:56,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:17:56,564 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:56,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 55 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:17:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-02 20:17:56,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-11-02 20:17:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-11-02 20:17:56,579 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2022-11-02 20:17:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:56,579 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-11-02 20:17:56,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-11-02 20:17:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:17:56,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:56,580 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:56,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:17:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:56,781 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash -756951010, now seen corresponding path program 3 times [2022-11-02 20:17:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789036070] [2022-11-02 20:17:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:56,812 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:17:56,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227418243] [2022-11-02 20:17:56,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:17:56,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:56,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:56,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:17:56,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:17:56,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:17:56,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:17:56,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:17:56,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:17:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:17:57,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:17:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:17:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:17:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789036070] [2022-11-02 20:17:57,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:17:57,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227418243] [2022-11-02 20:17:57,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227418243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:17:57,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:17:57,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-11-02 20:17:57,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278479567] [2022-11-02 20:17:57,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:17:57,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:17:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:17:57,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:17:57,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:17:57,103 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:17:57,299 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-11-02 20:17:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:17:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:17:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:17:57,300 INFO L225 Difference]: With dead ends: 59 [2022-11-02 20:17:57,301 INFO L226 Difference]: Without dead ends: 50 [2022-11-02 20:17:57,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:17:57,302 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:17:57,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 38 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:17:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-02 20:17:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-11-02 20:17:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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) [2022-11-02 20:17:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-02 20:17:57,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-11-02 20:17:57,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:17:57,310 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-02 20:17:57,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:17:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-02 20:17:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:17:57,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:17:57,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:17:57,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:17:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:57,519 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:17:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:17:57,519 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-11-02 20:17:57,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:17:57,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014345436] [2022-11-02 20:17:57,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:17:57,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:17:57,541 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:17:57,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496492204] [2022-11-02 20:17:57,542 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:17:57,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:17:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:17:57,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:17:57,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:17:57,709 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:17:57,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:17:57,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-02 20:17:57,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:17:57,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:17:57,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:17:57,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:17:57,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-11-02 20:17:58,162 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-02 20:17:58,162 INFO L390 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 56 [2022-11-02 20:17:58,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:58,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:58,358 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-02 20:17:58,359 INFO L390 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 63 [2022-11-02 20:17:58,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:17:58,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:17:58,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:58,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:58,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:17:58,916 INFO L356 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-11-02 20:17:58,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 72 treesize of output 81 [2022-11-02 20:17:59,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:59,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:17:59,187 INFO L356 Elim1Store]: treesize reduction 63, result has 23.2 percent of original size [2022-11-02 20:17:59,187 INFO L390 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 4 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 57 [2022-11-02 20:17:59,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:17:59,457 INFO L356 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-02 20:17:59,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 80 [2022-11-02 20:17:59,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:17:59,599 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:17:59,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2022-11-02 20:17:59,768 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:17:59,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 33 [2022-11-02 20:17:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:17:59,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:18:02,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_193 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-11-02 20:18:03,772 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (select .cse5 .cse6)) (.cse11 (+ .cse9 1))) (let ((.cse2 (< .cse11 0)) (.cse7 (mod .cse10 .cse11))) (let ((.cse1 (= .cse7 0)) (.cse0 (< .cse10 0)) (.cse4 (not .cse2)) (.cse8 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and .cse0 (not .cse1)) (let ((.cse3 (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (= (select (store (store .cse5 .cse6 .cse7) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)))))) (and (or .cse2 .cse3) (or .cse4 .cse3)))) (or .cse1 (not .cse0) (and (or (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)) (= (select (store (store .cse5 .cse6 (+ .cse9 .cse7 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) .cse4) (or (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (= (select (store (store .cse5 .cse6 (+ (- 1) .cse7 (* (- 1) .cse9))) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)))) .cse2)))))))) is different from false [2022-11-02 20:18:08,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_188 Int)) (= (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188))) (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0)))) is different from false [2022-11-02 20:19:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:19:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014345436] [2022-11-02 20:19:01,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:19:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496492204] [2022-11-02 20:19:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496492204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:01,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:19:01,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-11-02 20:19:01,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60282104] [2022-11-02 20:19:01,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:01,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:19:01,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:19:01,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1424, Unknown=18, NotChecked=240, Total=1892 [2022-11-02 20:19:01,748 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:04,611 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= (+ (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1) .cse1) (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_188 Int)) (= (let ((.cse2 (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188))) (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0)))) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_63| Int)) (and (<= 1 (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 8)))) (<= 1 |v_ULTIMATE.start_main_~i~0#1_63|) (<= |v_ULTIMATE.start_main_~i~0#1_63| 1))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ .cse1 1) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:19:06,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (<= 2 .cse0) (forall ((|v_ULTIMATE.start_main_~i~0#1_73| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_73|)) (forall ((v_ArrVal_188 Int)) (= (let ((.cse1 (store .cse2 (+ (* |v_ULTIMATE.start_main_~i~0#1_73| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_188))) (mod (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) 0)))) (= |c_ULTIMATE.start_main_~#sum~0#1.offset| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ .cse0 1) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:19:08,981 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)) (forall ((v_ArrVal_193 Int)) (= (select (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) 0))) (and (<= 2 .cse1) (= (select .cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse2 (+ .cse1 1))) (mod .cse2 .cse2)))))) (= (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) is different from false [2022-11-02 20:19:10,992 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (select .cse5 .cse6)) (.cse9 (+ .cse10 1))) (let ((.cse2 (< .cse9 0)) (.cse7 (mod .cse11 .cse9))) (let ((.cse1 (= .cse7 0)) (.cse0 (< .cse11 0)) (.cse4 (not .cse2)) (.cse8 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and .cse0 (not .cse1)) (let ((.cse3 (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (= (select (store (store .cse5 .cse6 .cse7) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)))))) (and (or .cse2 .cse3) (or .cse4 .cse3)))) (= (mod (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse9) 0) (or .cse1 (not .cse0) (and (or (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)) (= (select (store (store .cse5 .cse6 (+ .cse10 .cse7 1)) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) .cse4) (or (forall ((v_ArrVal_193 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (= (select (store (store .cse5 .cse6 (+ (- 1) .cse7 (* (- 1) .cse10))) (+ (* |v_ULTIMATE.start_main_~i~0#1_70| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= .cse8 |v_ULTIMATE.start_main_~i~0#1_70|)))) .cse2)))))))) is different from false [2022-11-02 20:19:11,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:11,015 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-11-02 20:19:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:19:11,016 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 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 32 [2022-11-02 20:19:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:11,018 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:19:11,019 INFO L226 Difference]: Without dead ends: 65 [2022-11-02 20:19:11,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=260, Invalid=1726, Unknown=22, NotChecked=644, Total=2652 [2022-11-02 20:19:11,021 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:11,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 199 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 347 Unchecked, 0.1s Time] [2022-11-02 20:19:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-02 20:19:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-11-02 20:19:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-11-02 20:19:11,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2022-11-02 20:19:11,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:11,042 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-11-02 20:19:11,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-11-02 20:19:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:19:11,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:11,048 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:11,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:19:11,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:19:11,262 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2147373800, now seen corresponding path program 5 times [2022-11-02 20:19:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:11,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824202273] [2022-11-02 20:19:11,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:11,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:11,284 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:19:11,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026694672] [2022-11-02 20:19:11,284 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:19:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:11,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:11,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:19:11,528 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-11-02 20:19:11,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:19:11,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:19:11,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:19:11,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:19:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824202273] [2022-11-02 20:19:11,743 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:19:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026694672] [2022-11-02 20:19:11,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026694672] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:11,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:19:11,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-02 20:19:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209314769] [2022-11-02 20:19:11,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:11,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:19:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:19:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:19:11,745 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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) [2022-11-02 20:19:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:12,074 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2022-11-02 20:19:12,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:19:12,075 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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 34 [2022-11-02 20:19:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:12,076 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:19:12,076 INFO L226 Difference]: Without dead ends: 105 [2022-11-02 20:19:12,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:19:12,077 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 148 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:12,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 70 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-02 20:19:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2022-11-02 20:19:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.131578947368421) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-11-02 20:19:12,095 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 34 [2022-11-02 20:19:12,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:12,096 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-11-02 20:19:12,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 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) [2022-11-02 20:19:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-11-02 20:19:12,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:19:12,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:12,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:12,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:12,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:12,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:19:12,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2022-11-02 20:19:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:12,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413248964] [2022-11-02 20:19:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:12,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:19:12,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803620537] [2022-11-02 20:19:12,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:12,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:12,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:12,336 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:12,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_54ec2a3b-228e-454a-8b4d-8b238f1a86e2/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:19:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:12,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-02 20:19:12,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:12,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:12,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-11-02 20:19:12,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:19:12,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:12,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:19:12,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:12,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:12,689 INFO L390 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 49 treesize of output 39 [2022-11-02 20:19:12,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:12,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2022-11-02 20:19:12,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:12,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:12,922 INFO L390 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 59 treesize of output 41 [2022-11-02 20:19:13,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:13,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 35 [2022-11-02 20:19:13,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:13,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:13,167 INFO L390 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 215 treesize of output 105 [2022-11-02 20:19:13,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:13,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 82 [2022-11-02 20:19:14,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 36 [2022-11-02 20:19:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:14,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:23,736 WARN L234 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:19:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:54,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413248964] [2022-11-02 20:19:54,841 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:19:54,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803620537] [2022-11-02 20:19:54,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803620537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:54,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:19:54,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2022-11-02 20:19:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91391461] [2022-11-02 20:19:54,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:54,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:19:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:19:54,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1387, Unknown=0, NotChecked=0, Total=1722 [2022-11-02 20:19:54,844 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 42 states, 42 states have (on average 1.5714285714285714) internal successors, (66), 42 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:04,230 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse26 .cse27))) (let ((.cse31 (+ .cse8 .cse9))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (+ .cse8 1)) (.cse35 (+ .cse8 .cse39)) (.cse37 (select .cse26 .cse6)) (.cse23 (store .cse26 .cse27 1)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))) (let ((.cse22 (store .cse23 .cse24 1))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))))) (let ((.cse16 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse17 .cse18 .cse19 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse6)))) (let ((.cse12 (store .cse15 .cse6 .cse10))) (let ((.cse13 (mod .cse14 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse13 0))))))))))))))) (let ((.cse25 (store .cse26 .cse27 (mod .cse9 .cse28)))) (or (= (select .cse25 .cse6) 0) (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse30 (store .cse26 .cse27 .cse31))) (let ((.cse29 (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse29 0)) (= (mod (select .cse30 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse36 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (let ((.cse32 (+ .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse33 (store .cse36 .cse6 .cse32))) (let ((.cse34 (mod .cse35 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse32 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse34 0))))))) (let ((.cse38 (mod .cse39 .cse28))) (or (not (= .cse38 0)) (= (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse47 (select .cse26 .cse24))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse47))))) (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ .cse8 .cse47 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse42 (store .cse45 .cse6 .cse40))) (let ((.cse43 (mod .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse43 0))))))))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse56 .cse39))))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (+ .cse8 .cse56 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (let ((.cse50 (+ (select .cse55 .cse6) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse52 (store .cse54 .cse6 .cse50))) (let ((.cse49 (mod .cse53 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse49 0)) (= (mod .cse50 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse39)) (= .cse37 0)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse58 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66))))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (+ .cse64 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse65 .cse66))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61))) (let ((.cse57 (+ (select .cse63 .cse6) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse59 (store .cse62 .cse6 .cse57))) (let ((.cse60 (mod .cse61 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse57 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse60 0)))))))))))))) (let ((.cse81 (store .cse26 .cse24 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse71 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76 .cse77 .cse78))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse6)))) (let ((.cse72 (store .cse74 .cse6 .cse70))) (let ((.cse69 (mod .cse73 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse69 0)) (= (mod .cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse89 (select .cse7 .cse24))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse89))))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (+ .cse8 .cse9 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse89))) (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| .cse86))) (let ((.cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse6)))) (let ((.cse85 (store .cse87 .cse6 .cse83))) (let ((.cse82 (mod .cse86 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse85) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse82 0)) (= (mod .cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))))))))) is different from false [2022-11-02 20:20:06,240 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse90 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse26 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (+ .cse90 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse48 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse26 .cse27))) (let ((.cse31 (+ .cse8 .cse9))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse31))) (.cse6 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse39 (select .cse26 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (+ .cse8 1)) (.cse35 (+ .cse8 .cse39)) (.cse37 (select .cse26 .cse6)) (.cse23 (store .cse26 .cse27 1)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse24 (+ .cse90 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (let ((.cse4 (+ .cse8 .cse9 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse4))) (let ((.cse1 (+ (select .cse7 .cse6) (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse5) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse3 (store .cse5 .cse6 .cse1))) (let ((.cse0 (mod .cse4 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse0 0)) (= (mod .cse1 (+ (select (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))) (let ((.cse22 (store .cse23 .cse24 1))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse18 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse11 (store .cse20 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse19))))) (let ((.cse16 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse14 (+ .cse17 .cse18 .cse19 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store .cse16 |c_ULTIMATE.start_main_~a~0#1.offset| .cse14))) (let ((.cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse16 .cse6)))) (let ((.cse12 (store .cse15 .cse6 .cse10))) (let ((.cse13 (mod .cse14 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~a~0#1.offset| .cse13)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse13 0))))))))))))))) (let ((.cse25 (store .cse26 .cse27 (mod .cse9 .cse28)))) (or (= (select .cse25 .cse6) 0) (not (= (select .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (let ((.cse30 (store .cse26 .cse27 .cse31))) (let ((.cse29 (mod (select .cse30 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse30) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse29 0)) (= (mod (select .cse30 .cse6) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse30 |c_ULTIMATE.start_main_~a~0#1.offset| .cse29)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))) (let ((.cse36 (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse35))) (let ((.cse32 (+ .cse37 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse36) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse33 (store .cse36 .cse6 .cse32))) (let ((.cse34 (mod .cse35 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= 0 (mod .cse32 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 |c_ULTIMATE.start_main_~a~0#1.offset| .cse34)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (not (= .cse34 0))))))) (let ((.cse38 (mod .cse39 .cse28))) (or (not (= .cse38 0)) (= (mod .cse37 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse26 |c_ULTIMATE.start_main_~a~0#1.offset| .cse38)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))) (let ((.cse47 (select .cse26 .cse24))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse47))))) (let ((.cse46 (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (+ .cse8 .cse47 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| .cse44))) (let ((.cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse46 .cse6)))) (let ((.cse42 (store .cse45 .cse6 .cse40))) (let ((.cse43 (mod .cse44 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| .cse42) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse40 (+ (select (select (store .cse41 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse42 |c_ULTIMATE.start_main_~a~0#1.offset| .cse43)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse43 0))))))))))) (let ((.cse56 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse35)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse56 .cse39))))) (let ((.cse55 (select .cse51 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse53 (+ .cse8 .cse56 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse39))) (let ((.cse54 (store .cse55 |c_ULTIMATE.start_main_~a~0#1.offset| .cse53))) (let ((.cse50 (+ (select .cse55 .cse6) (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse54) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse52 (store .cse54 .cse6 .cse50))) (let ((.cse49 (mod .cse53 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| .cse52) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse49 0)) (= (mod .cse50 (+ (select (select (store .cse51 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse52 |c_ULTIMATE.start_main_~a~0#1.offset| .cse49)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) (or (not (= 0 .cse39)) (= .cse37 0)) (let ((.cse67 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse23))) (let ((.cse68 (select .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse64 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse66 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (select (select (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse66))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse58 (store .cse67 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse64 .cse65 .cse66))))) (let ((.cse63 (select .cse58 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse61 (+ .cse64 (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse65 .cse66))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| .cse61))) (let ((.cse57 (+ (select .cse63 .cse6) (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse62) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))) (let ((.cse59 (store .cse62 .cse6 .cse57))) (let ((.cse60 (mod .cse61 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| .cse59) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (= (mod .cse57 (+ (select (select (store .cse58 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| .cse60)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (= .cse60 0)))))))))))))) (let ((.cse81 (store .cse26 .cse24 1))) (let ((.cse79 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse81))) (let ((.cse80 (select .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse81 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (let ((.cse71 (store .cse79 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse80 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))))) (let ((.cse75 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse73 (+ (select .cse75 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse76 .cse77 .cse78))) (let ((.cse74 (store .cse75 |c_ULTIMATE.start_main_~a~0#1.offset| .cse73))) (let ((.cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse74) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse75 .cse6)))) (let ((.cse72 (store .cse74 .cse6 .cse70))) (let ((.cse69 (mod .cse73 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| .cse72) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse69 0)) (= (mod .cse70 (+ (select (select (store .cse71 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse72 |c_ULTIMATE.start_main_~a~0#1.offset| .cse69)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))))))) (let ((.cse89 (select .cse7 .cse24))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9 .cse89))))) (let ((.cse88 (select .cse84 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse86 (+ .cse8 .cse9 (select .cse88 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse89))) (let ((.cse87 (store .cse88 |c_ULTIMATE.start_main_~a~0#1.offset| .cse86))) (let ((.cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse87) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse88 .cse6)))) (let ((.cse85 (store .cse87 .cse6 .cse83))) (let ((.cse82 (mod .cse86 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| .cse85) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (or (not (= .cse82 0)) (= (mod .cse83 (+ (select (select (store .cse84 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse85 |c_ULTIMATE.start_main_~a~0#1.offset| .cse82)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))))))))))) is different from true [2022-11-02 20:20:54,680 WARN L234 SmtUtils]: Spent 11.09s on a formula simplification. DAG size of input: 210 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:21:15,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []