./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede152d5cd6ec701bb90258310974118410592fd ...................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i -s /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede152d5cd6ec701bb90258310974118410592fd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:22:24,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:22:24,734 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:22:24,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:22:24,742 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:22:24,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:22:24,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:22:24,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:22:24,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:22:24,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:22:24,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:22:24,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:22:24,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:22:24,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:22:24,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:22:24,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:22:24,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:22:24,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:22:24,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:22:24,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:22:24,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:22:24,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:22:24,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:22:24,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:22:24,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:22:24,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:22:24,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:22:24,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:22:24,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:22:24,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:22:24,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:22:24,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:22:24,761 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:22:24,761 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:22:24,762 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:22:24,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:22:24,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:22:24,762 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:22:24,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:22:24,763 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:22:24,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:22:24,764 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 15:22:24,773 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:22:24,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:22:24,774 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:22:24,774 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:22:24,774 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:22:24,775 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:22:24,775 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:22:24,775 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:22:24,775 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:22:24,775 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:22:24,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:22:24,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:22:24,777 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:22:24,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:22:24,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:22:24,777 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:22:24,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:22:24,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:22:24,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:22:24,778 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ede152d5cd6ec701bb90258310974118410592fd [2019-12-07 15:22:24,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:22:24,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:22:24,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:22:24,890 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:22:24,890 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:22:24,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-12-07 15:22:24,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/2bf8f1f8a/6c8026e91a9d4e1bb386875dfe067db5/FLAGed3e072b0 [2019-12-07 15:22:25,360 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:22:25,360 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-12-07 15:22:25,364 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/2bf8f1f8a/6c8026e91a9d4e1bb386875dfe067db5/FLAGed3e072b0 [2019-12-07 15:22:25,373 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/2bf8f1f8a/6c8026e91a9d4e1bb386875dfe067db5 [2019-12-07 15:22:25,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:22:25,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:22:25,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:22:25,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:22:25,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:22:25,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:22:25" (1/1) ... [2019-12-07 15:22:25,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f14c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:25, skipping insertion in model container [2019-12-07 15:22:25,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:22:25" (1/1) ... [2019-12-07 15:22:25,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:22:25,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:22:25,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:22:25,572 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-12-07 15:22:25,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1eb1fe96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:25, skipping insertion in model container [2019-12-07 15:22:25,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:22:25,573 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2019-12-07 15:22:25,575 INFO L168 Benchmark]: Toolchain (without parser) took 198.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:22:25,576 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:22:25,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:22:25,578 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 14]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 15:22:26,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:22:26,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:22:26,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:22:26,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:22:26,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:22:26,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:22:26,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:22:26,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:22:26,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:22:26,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:22:26,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:22:26,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:22:26,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:22:26,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:22:26,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:22:26,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:22:26,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:22:26,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:22:26,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:22:26,713 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:22:26,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:22:26,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:22:26,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:22:26,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:22:26,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:22:26,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:22:26,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:22:26,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:22:26,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:22:26,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:22:26,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:22:26,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:22:26,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:22:26,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:22:26,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:22:26,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:22:26,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:22:26,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:22:26,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:22:26,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:22:26,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 15:22:26,733 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:22:26,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:22:26,734 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:22:26,734 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:22:26,735 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:22:26,735 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:22:26,735 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:22:26,735 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:22:26,735 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:22:26,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:22:26,736 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:22:26,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:22:26,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:22:26,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 15:22:26,738 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 15:22:26,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:22:26,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:22:26,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:22:26,739 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> ede152d5cd6ec701bb90258310974118410592fd [2019-12-07 15:22:26,900 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:22:26,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:22:26,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:22:26,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:22:26,911 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:22:26,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/../../sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-12-07 15:22:26,948 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/ac31fea23/6e861cfdb04a49a3a82319e24aa162f5/FLAGd3bcdcd01 [2019-12-07 15:22:27,392 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:22:27,393 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/sv-benchmarks/c/array-lopstr16/flag_loopdep.i [2019-12-07 15:22:27,396 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/ac31fea23/6e861cfdb04a49a3a82319e24aa162f5/FLAGd3bcdcd01 [2019-12-07 15:22:27,406 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/data/ac31fea23/6e861cfdb04a49a3a82319e24aa162f5 [2019-12-07 15:22:27,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:22:27,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:22:27,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:22:27,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:22:27,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:22:27,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692431c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27, skipping insertion in model container [2019-12-07 15:22:27,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:22:27,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:22:27,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:22:27,555 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 15:22:27,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:22:27,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:22:27,563 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:22:27,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:22:27,617 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:22:27,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27 WrapperNode [2019-12-07 15:22:27,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:22:27,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:22:27,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:22:27,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:22:27,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:22:27,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:22:27,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:22:27,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:22:27,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... [2019-12-07 15:22:27,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:22:27,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:22:27,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:22:27,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:22:27,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:22:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:22:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:22:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:22:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:22:27,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:22:27,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:22:27,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:22:27,852 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:22:27,852 INFO L287 CfgBuilder]: Removed 11 assume(true) statements. [2019-12-07 15:22:27,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:22:27 BoogieIcfgContainer [2019-12-07 15:22:27,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:22:27,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:22:27,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:22:27,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:22:27,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:22:27" (1/3) ... [2019-12-07 15:22:27,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cdcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:22:27, skipping insertion in model container [2019-12-07 15:22:27,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:22:27" (2/3) ... [2019-12-07 15:22:27,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69cdcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:22:27, skipping insertion in model container [2019-12-07 15:22:27,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:22:27" (3/3) ... [2019-12-07 15:22:27,858 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2019-12-07 15:22:27,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:22:27,868 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 15:22:27,876 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 15:22:27,890 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:22:27,890 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:22:27,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:22:27,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:22:27,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:22:27,891 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:22:27,891 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:22:27,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:22:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-12-07 15:22:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:22:27,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:27,904 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:27,904 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:27,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:27,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2060710478, now seen corresponding path program 1 times [2019-12-07 15:22:27,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:27,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434594673] [2019-12-07 15:22:27,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:27,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 15:22:27,962 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:27,972 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:27,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434594673] [2019-12-07 15:22:27,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:22:27,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 15:22:27,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535001109] [2019-12-07 15:22:27,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 15:22:27,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 15:22:27,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:22:27,989 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-12-07 15:22:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:28,000 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2019-12-07 15:22:28,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 15:22:28,001 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-12-07 15:22:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:28,007 INFO L225 Difference]: With dead ends: 36 [2019-12-07 15:22:28,007 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 15:22:28,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 15:22:28,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 15:22:28,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 15:22:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 15:22:28,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-12-07 15:22:28,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2019-12-07 15:22:28,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:28,031 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-12-07 15:22:28,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 15:22:28,031 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2019-12-07 15:22:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 15:22:28,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:28,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:28,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 15:22:28,233 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1919336157, now seen corresponding path program 1 times [2019-12-07 15:22:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087489397] [2019-12-07 15:22:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:28,294 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:22:28,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,326 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:28,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087489397] [2019-12-07 15:22:28,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:22:28,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 15:22:28,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794254972] [2019-12-07 15:22:28,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:22:28,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:22:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:22:28,346 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 4 states. [2019-12-07 15:22:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:28,383 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-12-07 15:22:28,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:22:28,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 15:22:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:28,384 INFO L225 Difference]: With dead ends: 31 [2019-12-07 15:22:28,385 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 15:22:28,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:22:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 15:22:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 15:22:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 15:22:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-12-07 15:22:28,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 10 [2019-12-07 15:22:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:28,390 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-12-07 15:22:28,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:22:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-12-07 15:22:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:22:28,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:28,391 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:28,592 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 15:22:28,592 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:28,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1315497119, now seen corresponding path program 1 times [2019-12-07 15:22:28,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:28,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246293508] [2019-12-07 15:22:28,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:28,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:22:28,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,733 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246293508] [2019-12-07 15:22:28,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1874574128] [2019-12-07 15:22:28,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:28,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:22:28,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,924 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:22:28,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3791021] [2019-12-07 15:22:28,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:28,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:22:28,980 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:22:28,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 15:22:29,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 4 imperfect interpolant sequences. [2019-12-07 15:22:29,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5, 5, 5] total 10 [2019-12-07 15:22:29,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347763003] [2019-12-07 15:22:29,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:22:29,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:22:29,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:22:29,006 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-12-07 15:22:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:29,039 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-12-07 15:22:29,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:22:29,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:22:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:29,040 INFO L225 Difference]: With dead ends: 39 [2019-12-07 15:22:29,040 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 15:22:29,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:22:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 15:22:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-07 15:22:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 15:22:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-12-07 15:22:29,044 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2019-12-07 15:22:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:29,044 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2019-12-07 15:22:29,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:22:29,045 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2019-12-07 15:22:29,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:22:29,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:29,045 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:29,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:29,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2030845279, now seen corresponding path program 1 times [2019-12-07 15:22:29,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:29,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333158420] [2019-12-07 15:22:29,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:29,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:22:29,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:29,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:29,715 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333158420] [2019-12-07 15:22:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1918895057] [2019-12-07 15:22:29,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:29,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 15:22:29,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:22:29,853 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:22:29,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-12-07 15:22:29,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5, 5] total 10 [2019-12-07 15:22:29,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367732206] [2019-12-07 15:22:29,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:22:29,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:22:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:22:29,867 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2019-12-07 15:22:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:29,878 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-12-07 15:22:29,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:22:29,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 15:22:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:29,879 INFO L225 Difference]: With dead ends: 42 [2019-12-07 15:22:29,879 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 15:22:29,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:22:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 15:22:29,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 15:22:29,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 15:22:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-12-07 15:22:29,883 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2019-12-07 15:22:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-12-07 15:22:29,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:22:29,883 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-12-07 15:22:29,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:22:29,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:29,884 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:30,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:30,286 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2139127327, now seen corresponding path program 1 times [2019-12-07 15:22:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:30,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882135199] [2019-12-07 15:22:30,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:30,349 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:22:30,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:30,376 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:30,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882135199] [2019-12-07 15:22:30,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [126048798] [2019-12-07 15:22:30,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:30,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:22:30,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:30,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 15:22:30,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811638153] [2019-12-07 15:22:30,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:30,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 15:22:30,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 15:22:30,678 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:30,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:30,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:30,833 INFO L377 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 20 treesize of output 20 [2019-12-07 15:22:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:30,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:32,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-12-07 15:22:32,881 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:39,028 WARN L192 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 18 [2019-12-07 15:22:39,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:39,034 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-12-07 15:22:39,035 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:39,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:22:39,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:39,040 INFO L377 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 20 treesize of output 12 [2019-12-07 15:22:39,040 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:39,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:39,044 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:22:39,044 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:7 [2019-12-07 15:22:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 15:22:39,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:22:39,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 9, 7] total 20 [2019-12-07 15:22:39,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660797405] [2019-12-07 15:22:39,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 15:22:39,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 15:22:39,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-12-07 15:22:39,067 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 20 states. [2019-12-07 15:22:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:39,606 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-12-07 15:22:39,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 15:22:39,607 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-12-07 15:22:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:39,607 INFO L225 Difference]: With dead ends: 54 [2019-12-07 15:22:39,607 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 15:22:39,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2019-12-07 15:22:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 15:22:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-12-07 15:22:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 15:22:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-12-07 15:22:39,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2019-12-07 15:22:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:39,613 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-12-07 15:22:39,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 15:22:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-12-07 15:22:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 15:22:39,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:39,614 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:40,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:40,216 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:40,217 INFO L82 PathProgramCache]: Analyzing trace with hash 225697560, now seen corresponding path program 1 times [2019-12-07 15:22:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822042144] [2019-12-07 15:22:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:40,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:22:40,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 15:22:40,330 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 15:22:40,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822042144] [2019-12-07 15:22:40,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324548232] [2019-12-07 15:22:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:40,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 15:22:40,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 15:22:40,704 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 15:22:40,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15831991] [2019-12-07 15:22:40,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:22:40,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:22:40,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:41,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 15:22:41,088 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:41,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:41,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:41,515 INFO L377 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 22 treesize of output 22 [2019-12-07 15:22:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:41,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:45,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2019-12-07 15:22:45,579 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:51,749 WARN L192 SmtUtils]: Spent 6.17 s on a formula simplification that was a NOOP. DAG size: 19 [2019-12-07 15:22:51,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:51,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:51,765 INFO L377 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 22 treesize of output 22 [2019-12-07 15:22:51,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:22:51,766 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:51,767 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-12-07 15:22:51,767 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 15:22:51,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:22:51,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:22:51,769 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:9 [2019-12-07 15:22:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 15:22:51,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:22:51,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 11, 10] total 33 [2019-12-07 15:22:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406500023] [2019-12-07 15:22:51,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 15:22:51,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 15:22:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 15:22:51,844 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 33 states. [2019-12-07 15:22:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:22:53,635 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-12-07 15:22:53,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 15:22:53,636 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-12-07 15:22:53,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:22:53,636 INFO L225 Difference]: With dead ends: 80 [2019-12-07 15:22:53,636 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 15:22:53,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=407, Invalid=2349, Unknown=0, NotChecked=0, Total=2756 [2019-12-07 15:22:53,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 15:22:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2019-12-07 15:22:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 15:22:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-12-07 15:22:53,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 33 [2019-12-07 15:22:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:22:53,642 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-12-07 15:22:53,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 15:22:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-12-07 15:22:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 15:22:53,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:22:53,644 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:22:54,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk,12 mathsat -unsat_core_generation=3 [2019-12-07 15:22:54,245 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:22:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:22:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -403676583, now seen corresponding path program 2 times [2019-12-07 15:22:54,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:22:54,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585624123] [2019-12-07 15:22:54,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 15:22:54,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:22:54,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:22:54,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 15:22:54,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:22:54,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:22:55,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585624123] [2019-12-07 15:22:55,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1746081575] [2019-12-07 15:22:55,604 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:22:55,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:22:55,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:22:55,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 15:22:55,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:22:55,783 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 15:22:55,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803891494] [2019-12-07 15:22:55,791 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:22:55,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 15:22:55,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:22:55,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:22:55,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:22:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 15:22:55,963 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:22:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-12-07 15:22:56,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:22:56,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17, 17, 5, 5] total 38 [2019-12-07 15:22:56,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39120049] [2019-12-07 15:22:56,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-07 15:22:56,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:22:56,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-07 15:22:56,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 15:22:56,137 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 38 states. [2019-12-07 15:22:57,332 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 15:22:57,894 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 15:22:58,256 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 15:22:58,687 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 15:22:59,076 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 15:22:59,368 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-07 15:22:59,689 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-12-07 15:23:00,007 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-12-07 15:23:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:01,479 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2019-12-07 15:23:01,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 15:23:01,479 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-12-07 15:23:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:01,480 INFO L225 Difference]: With dead ends: 147 [2019-12-07 15:23:01,480 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 15:23:01,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=771, Invalid=2091, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 15:23:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 15:23:01,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2019-12-07 15:23:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-12-07 15:23:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-12-07 15:23:01,489 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 54 [2019-12-07 15:23:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:01,490 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-12-07 15:23:01,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-07 15:23:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-12-07 15:23:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 15:23:01,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:23:01,491 INFO L410 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:23:02,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3,16 cvc4 --incremental --print-success --lang smt --rewrite-divk,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:02,093 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:23:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:23:02,093 INFO L82 PathProgramCache]: Analyzing trace with hash 333100921, now seen corresponding path program 3 times [2019-12-07 15:23:02,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:23:02,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532885374] [2019-12-07 15:23:02,095 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 15:23:02,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 15:23:02,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:02,180 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:23:02,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:02,206 INFO L377 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 15 treesize of output 11 [2019-12-07 15:23:02,206 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:02,218 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:02,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:02,219 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-12-07 15:23:02,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:02,345 INFO L377 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 22 treesize of output 22 [2019-12-07 15:23:02,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:02,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:23:02,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:02,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:02,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:02,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 15:23:02,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:02,597 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:23:02,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-12-07 15:23:02,973 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:03,074 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 15:23:03,075 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 15:23:03,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:03,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:03,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 15:23:03,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:03,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:03,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:04,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:04,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:04,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:05,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:05,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:05,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:05,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:05,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:06,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:06,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:06,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:06,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:06,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:07,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:07,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:07,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:07,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:08,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:08,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:08,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:08,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:09,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:09,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:09,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:09,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:09,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:10,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:10,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:10,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:10,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:10,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:11,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:11,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:11,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:11,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:12,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:12,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:12,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:12,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:12,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:13,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:14,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:14,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:14,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:15,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532885374] [2019-12-07 15:23:15,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354601803] [2019-12-07 15:23:15,806 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:23:15,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 15:23:15,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:15,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:23:15,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:15,928 INFO L377 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 15 treesize of output 11 [2019-12-07 15:23:15,928 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:15,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:15,941 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:15,942 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-12-07 15:23:15,963 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:15,964 INFO L377 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 22 treesize of output 22 [2019-12-07 15:23:15,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,964 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:23:15,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:15,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:15,990 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:15,990 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 15:23:15,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:16,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:23:16,045 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-12-07 15:23:16,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:16,155 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 15:23:16,155 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 15:23:16,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,158 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:16,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 15:23:16,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:16,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:17,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:17,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:17,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:17,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:18,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:18,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:18,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:19,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:19,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:19,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:19,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:20,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:20,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:20,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:20,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:20,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:21,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:21,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:21,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:22,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:22,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:22,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:22,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:22,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:23,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:23,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:23,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:24,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:24,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:24,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:24,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:25,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:26,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:26,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:26,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:26,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:27,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:27,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:28,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612007060] [2019-12-07 15:23:28,652 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 15:23:28,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-07 15:23:28,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 15:23:28,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:23:28,714 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:23:28,721 INFO L377 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 15 treesize of output 11 [2019-12-07 15:23:28,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:23:28,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:28,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:23:28,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-12-07 15:23:28,755 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:28,755 INFO L377 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 22 treesize of output 22 [2019-12-07 15:23:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 15:23:28,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:23:28,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,779 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:28,779 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2019-12-07 15:23:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:28,814 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:23:28,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-12-07 15:23:28,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:23:28,951 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-12-07 15:23:28,951 INFO L614 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2019-12-07 15:23:28,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:23:28,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-12-07 15:23:28,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:28,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:29,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:29,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:29,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:29,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:30,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:30,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:30,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:30,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:31,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:31,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:31,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:32,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:32,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:32,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:32,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:33,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:33,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:33,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:33,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:34,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:35,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:36,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:36,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:36,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:36,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:37,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:37,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:37,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:37,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:37,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:38,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:38,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:38,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:38,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:39,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:39,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:39,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:39,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:39,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:40,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:40,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:40,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:23:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-12-07 15:23:41,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 15:23:41,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9, 9] total 16 [2019-12-07 15:23:41,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971321758] [2019-12-07 15:23:41,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 15:23:41,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:23:41,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 15:23:41,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:23:41,803 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 16 states. [2019-12-07 15:23:42,534 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-12-07 15:23:43,038 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-12-07 15:23:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:23:43,070 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2019-12-07 15:23:43,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 15:23:43,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 98 [2019-12-07 15:23:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:23:43,072 INFO L225 Difference]: With dead ends: 99 [2019-12-07 15:23:43,072 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 15:23:43,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 394 SyntacticMatches, 174 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:23:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 15:23:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 15:23:43,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 15:23:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 15:23:43,073 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2019-12-07 15:23:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:23:43,074 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 15:23:43,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 15:23:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 15:23:43,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 15:23:43,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 15:23:43,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 15:23:44,595 WARN L192 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-07 15:23:44,718 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L242 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (not (= (_ bv0 32) ULTIMATE.start_main_~flag~0)) [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L249 CegarLoopResult]: At program point L36(lines 17 37) the Hoare annotation is: true [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 15:23:44,720 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L242 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#a~0.base|)) (.cse10 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|))) (let ((.cse3 (= (select .cse10 |ULTIMATE.start_main_~#a~0.offset|) (_ bv0 32))) (.cse4 (= (select .cse12 |ULTIMATE.start_main_~#a~0.offset|) (_ bv0 32))) (.cse6 (bvadd ULTIMATE.start_main_~i~1 (_ bv4294967295 32))) (.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~#a~0.offset|)) (.cse1 (= ULTIMATE.start_init_~a.base |ULTIMATE.start_main_~#a~0.base|)) (.cse2 (= (_ bv1000000 32) ULTIMATE.start_init_~size)) (.cse5 (= ULTIMATE.start_init_~a.offset |ULTIMATE.start_main_~#a~0.offset|)) (.cse7 (exists ((ULTIMATE.start_init_~i~0 (_ BitVec 32))) (and (not (bvslt ULTIMATE.start_init_~i~0 (_ bv1000000 32))) (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32)))))) (.cse8 (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) ULTIMATE.start_init_~size)) (.cse9 (not (= (select .cse10 (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 (_ bv0 32)) .cse7 .cse8 .cse9) (let ((.cse11 (bvadd |ULTIMATE.start_main_~#a~0.offset| (_ bv4 32)))) (and .cse1 .cse5 (= (select .cse10 .cse11) (_ bv0 32)) .cse7 .cse8 .cse0 (= (_ bv0 32) (select .cse12 .cse11)) .cse2 .cse3 .cse4 (bvslt .cse6 (_ bv1000000 32)) (exists ((ULTIMATE.start_init_~i~0 (_ BitVec 32))) (and (not (bvslt ULTIMATE.start_init_~i~0 (_ bv1000000 32))) (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) (_ bv1000000 32)) (not (= (bvmul ULTIMATE.start_main_~i~1 (_ bv4 32)) (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)))))) .cse9)) (and .cse0 .cse1 .cse2 .cse5 (= (_ bv0 32) ULTIMATE.start_main_~i~1) .cse7 .cse8 .cse9) (= (_ bv1 32) ULTIMATE.start_main_~flag~0)))) [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L242 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~#a~0.offset|)) (.cse1 (= ULTIMATE.start_init_~a.base |ULTIMATE.start_main_~#a~0.base|)) (.cse2 (= (_ bv1000000 32) ULTIMATE.start_init_~size)) (.cse3 (= ULTIMATE.start_init_~a.offset |ULTIMATE.start_main_~#a~0.offset|))) (or (and .cse0 .cse1 .cse2 .cse3 (bvslt (bvadd ULTIMATE.start_init_~i~0 (_ bv4294967295 32)) ULTIMATE.start_init_~size) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#a~0.base|) (bvadd |ULTIMATE.start_main_~#a~0.offset| (bvmul ULTIMATE.start_init_~i~0 (_ bv4 32)) (_ bv4294967292 32))) (_ bv0 32)))) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv0 32) ULTIMATE.start_init_~i~0)))) [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L9(lines 9 16) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-12-07 15:23:44,721 INFO L246 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2019-12-07 15:23:44,729 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,730 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,732 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,733 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,735 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,736 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,737 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,745 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,746 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,748 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,749 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,749 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:23:44 BoogieIcfgContainer [2019-12-07 15:23:44,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:23:44,751 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:23:44,751 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:23:44,751 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:23:44,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:22:27" (3/4) ... [2019-12-07 15:23:44,754 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 15:23:44,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 15:23:44,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 15:23:44,761 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 15:23:44,778 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0bv32 == a && a == a) && 1000000bv32 == size) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && a == a) && ~bvadd64(i, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || ((((((((((((a == a && a == a) && #memory_$Pointer$[a][~bvadd64(a, 4bv32)] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && 0bv32 == a) && 0bv32 == #memory_$Pointer$[a][~bvadd64(a, 4bv32)]) && 1000000bv32 == size) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), 1000000bv32)) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(~bvmul32(i, 4bv32) == ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32)))) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || (((((((0bv32 == a && a == a) && 1000000bv32 == size) && a == a) && 0bv32 == i) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || 1bv32 == flag [2019-12-07 15:23:44,788 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_db8930f6-f478-4a76-aa51-72db1eaa48f1/bin/utaipan/witness.graphml [2019-12-07 15:23:44,788 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:23:44,789 INFO L168 Benchmark]: Toolchain (without parser) took 77379.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.3 MB). Free memory was 953.7 MB in the beginning and 973.2 MB in the end (delta: -19.4 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2019-12-07 15:23:44,789 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:23:44,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:23:44,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:23:44,790 INFO L168 Benchmark]: Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:23:44,790 INFO L168 Benchmark]: RCFGBuilder took 192.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:23:44,790 INFO L168 Benchmark]: TraceAbstraction took 76896.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 973.2 MB in the end (delta: 133.2 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:23:44,790 INFO L168 Benchmark]: Witness Printer took 37.12 ms. Allocated memory is still 1.3 GB. Free memory is still 973.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:23:44,792 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 192.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76896.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 973.2 MB in the end (delta: 133.2 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. * Witness Printer took 37.12 ms. Allocated memory is still 1.3 GB. Free memory is still 973.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 15:23:44,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,796 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,798 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,800 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,800 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_init_~i~0,QUANTIFIED] [2019-12-07 15:23:44,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((0bv32 == a && a == a) && 1000000bv32 == size) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && a == a) && ~bvadd64(i, 4294967295bv32) == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || ((((((((((((a == a && a == a) && #memory_$Pointer$[a][~bvadd64(a, 4bv32)] == 0bv32) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && 0bv32 == a) && 0bv32 == #memory_$Pointer$[a][~bvadd64(a, 4bv32)]) && 1000000bv32 == size) && #memory_$Pointer$[a][a] == 0bv32) && #memory_$Pointer$[a][a] == 0bv32) && ~bvslt32(~bvadd64(i, 4294967295bv32), 1000000bv32)) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(~bvmul32(i, 4bv32) == ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32)))) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || (((((((0bv32 == a && a == a) && 1000000bv32 == size) && a == a) && 0bv32 == i) && (\exists ULTIMATE.start_init_~i~0 : bv32 :: (!~bvslt32(ULTIMATE.start_init_~i~0, 1000000bv32) && ~bvslt32(~bvadd64(ULTIMATE.start_init_~i~0, 4294967295bv32), 1000000bv32)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(ULTIMATE.start_init_~i~0, 4bv32), 4294967292bv32)] == 0bv32))) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32))) || 1bv32 == flag - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: !(0bv32 == flag) - InvariantResult [Line: 12]: Loop Invariant [2019-12-07 15:23:44,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-12-07 15:23:44,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-12-07 15:23:44,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((0bv32 == a && a == a) && 1000000bv32 == size) && a == a) && ~bvslt32(~bvadd64(i, 4294967295bv32), size)) && !(#memory_$Pointer$[a][~bvadd64(a, ~bvmul32(i, 4bv32), 4294967292bv32)] == 0bv32)) || ((((0bv32 == a && a == a) && 1000000bv32 == size) && a == a) && 0bv32 == i) - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Result: SAFE, OverallTime: 75.7s, OverallIterations: 8, TraceHistogramMax: 30, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 123 SDtfs, 290 SDslu, 596 SDs, 0 SdLazy, 1787 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1450 GetRequests, 1105 SyntacticMatches, 174 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 46 NumberOfFragments, 300 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2139 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 132 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 61.5s InterpolantComputationTime, 717 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1396 ConstructedInterpolants, 294 QuantifiedInterpolants, 1243510 SizeOfPredicates, 109 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 5970/7422 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...