./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c --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_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d80676b9a99131191df12fd74204f331d0509f64 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:25:51,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:25:51,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:25:51,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:25:51,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:25:51,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:25:51,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:25:51,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:25:51,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:25:51,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:25:51,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:25:51,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:25:51,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:25:51,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:25:51,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:25:51,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:25:51,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:25:51,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:25:51,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:25:51,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:25:51,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:25:51,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:25:51,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:25:51,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:25:51,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:25:51,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:25:51,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:25:51,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:25:51,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:25:51,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:25:51,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:25:51,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:25:51,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:25:51,106 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:25:51,107 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:25:51,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:25:51,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:25:51,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:25:51,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:25:51,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:25:51,109 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:25:51,110 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:25:51,121 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:25:51,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:25:51,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:25:51,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:25:51,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:25:51,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:25:51,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:25:51,124 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:25:51,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:25:51,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:25:51,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:25:51,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:25:51,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:25:51,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:25:51,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:25:51,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:25:51,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:25:51,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:25:51,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d80676b9a99131191df12fd74204f331d0509f64 [2019-12-07 13:25:51,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:25:51,233 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:25:51,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:25:51,236 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:25:51,236 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:25:51,237 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 13:25:51,273 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/data/6c67822a0/4f82fc678ced48dbb87adf261579e0e6/FLAG934437b11 [2019-12-07 13:25:51,590 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:25:51,590 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/sv-benchmarks/c/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 13:25:51,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/data/6c67822a0/4f82fc678ced48dbb87adf261579e0e6/FLAG934437b11 [2019-12-07 13:25:51,603 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/data/6c67822a0/4f82fc678ced48dbb87adf261579e0e6 [2019-12-07 13:25:51,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:25:51,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:25:51,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:25:51,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:25:51,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:25:51,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51, skipping insertion in model container [2019-12-07 13:25:51,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:25:51,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:25:51,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:25:51,778 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:25:51,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:25:51,816 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:25:51,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51 WrapperNode [2019-12-07 13:25:51,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:25:51,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:25:51,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:25:51,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:25:51,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,828 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:25:51,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:25:51,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:25:51,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:25:51,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... [2019-12-07 13:25:51,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:25:51,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:25:51,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:25:51,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:25:51,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/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 13:25:51,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:25:51,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:25:51,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 13:25:51,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:25:51,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:25:52,087 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:25:52,087 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 13:25:52,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:52 BoogieIcfgContainer [2019-12-07 13:25:52,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:25:52,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:25:52,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:25:52,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:25:52,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:25:51" (1/3) ... [2019-12-07 13:25:52,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b11cafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:25:52, skipping insertion in model container [2019-12-07 13:25:52,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:25:51" (2/3) ... [2019-12-07 13:25:52,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b11cafb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:25:52, skipping insertion in model container [2019-12-07 13:25:52,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:52" (3/3) ... [2019-12-07 13:25:52,095 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-12-07 13:25:52,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:25:52,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-12-07 13:25:52,113 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 13:25:52,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:25:52,131 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:25:52,131 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:25:52,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:25:52,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:25:52,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:25:52,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:25:52,132 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:25:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-12-07 13:25:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:25:52,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:52,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:52,147 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,151 INFO L82 PathProgramCache]: Analyzing trace with hash -549247241, now seen corresponding path program 1 times [2019-12-07 13:25:52,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:52,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374121005] [2019-12-07 13:25:52,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:52,288 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 13:25:52,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374121005] [2019-12-07 13:25:52,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:52,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:52,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24627885] [2019-12-07 13:25:52,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:52,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:52,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,303 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-12-07 13:25:52,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:52,327 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2019-12-07 13:25:52,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:52,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:25:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:52,337 INFO L225 Difference]: With dead ends: 51 [2019-12-07 13:25:52,338 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 13:25:52,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 13:25:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-12-07 13:25:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:25:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-12-07 13:25:52,367 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 9 [2019-12-07 13:25:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:52,367 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-12-07 13:25:52,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-12-07 13:25:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:25:52,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:52,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:52,368 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2084862863, now seen corresponding path program 1 times [2019-12-07 13:25:52,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:52,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268078267] [2019-12-07 13:25:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:52,390 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 13:25:52,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268078267] [2019-12-07 13:25:52,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:52,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:52,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164792250] [2019-12-07 13:25:52,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:52,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:52,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:52,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,393 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 3 states. [2019-12-07 13:25:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:52,420 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2019-12-07 13:25:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:52,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 13:25:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:52,422 INFO L225 Difference]: With dead ends: 56 [2019-12-07 13:25:52,422 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 13:25:52,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 13:25:52,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-12-07 13:25:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 13:25:52,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-12-07 13:25:52,428 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2019-12-07 13:25:52,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:52,429 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-12-07 13:25:52,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-12-07 13:25:52,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 13:25:52,429 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:52,429 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:52,430 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2140661612, now seen corresponding path program 1 times [2019-12-07 13:25:52,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:52,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99611261] [2019-12-07 13:25:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:52,461 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 13:25:52,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99611261] [2019-12-07 13:25:52,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:52,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:25:52,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174121726] [2019-12-07 13:25:52,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:25:52,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:52,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:25:52,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:25:52,463 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 4 states. [2019-12-07 13:25:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:52,492 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2019-12-07 13:25:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:25:52,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 13:25:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:52,493 INFO L225 Difference]: With dead ends: 49 [2019-12-07 13:25:52,494 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 13:25:52,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:25:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 13:25:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2019-12-07 13:25:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 13:25:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-12-07 13:25:52,500 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 10 [2019-12-07 13:25:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:52,500 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-12-07 13:25:52,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:25:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-12-07 13:25:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:25:52,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:52,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:52,501 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1998916233, now seen corresponding path program 1 times [2019-12-07 13:25:52,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:52,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616899040] [2019-12-07 13:25:52,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:52,526 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 13:25:52,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616899040] [2019-12-07 13:25:52,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:52,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:25:52,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980274753] [2019-12-07 13:25:52,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:25:52,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:52,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:25:52,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,528 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2019-12-07 13:25:52,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:52,551 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 13:25:52,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:25:52,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 13:25:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:52,552 INFO L225 Difference]: With dead ends: 52 [2019-12-07 13:25:52,552 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 13:25:52,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:25:52,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 13:25:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-12-07 13:25:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 13:25:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-12-07 13:25:52,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2019-12-07 13:25:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:52,555 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-12-07 13:25:52,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:25:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-12-07 13:25:52,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:25:52,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:52,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:52,556 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:52,556 INFO L82 PathProgramCache]: Analyzing trace with hash 588855308, now seen corresponding path program 1 times [2019-12-07 13:25:52,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:52,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457731862] [2019-12-07 13:25:52,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:53,008 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 38 [2019-12-07 13:25:53,062 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 13:25:53,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457731862] [2019-12-07 13:25:53,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:53,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:25:53,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510171921] [2019-12-07 13:25:53,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:25:53,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:53,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:25:53,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:25:53,064 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 8 states. [2019-12-07 13:25:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:53,249 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2019-12-07 13:25:53,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:25:53,250 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-12-07 13:25:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:53,250 INFO L225 Difference]: With dead ends: 43 [2019-12-07 13:25:53,251 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 13:25:53,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:25:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 13:25:53,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-12-07 13:25:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 13:25:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-12-07 13:25:53,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 16 [2019-12-07 13:25:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:53,256 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-12-07 13:25:53,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:25:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-12-07 13:25:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:25:53,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:53,257 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:53,257 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash 394194232, now seen corresponding path program 1 times [2019-12-07 13:25:53,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:53,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562799288] [2019-12-07 13:25:53,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:53,294 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 13:25:53,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562799288] [2019-12-07 13:25:53,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:25:53,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:25:53,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758177092] [2019-12-07 13:25:53,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:25:53,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:25:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:25:53,295 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-12-07 13:25:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:53,342 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-12-07 13:25:53,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:25:53,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-07 13:25:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:53,343 INFO L225 Difference]: With dead ends: 40 [2019-12-07 13:25:53,343 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 13:25:53,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:25:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 13:25:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 24. [2019-12-07 13:25:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 13:25:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-12-07 13:25:53,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2019-12-07 13:25:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:53,347 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-12-07 13:25:53,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:25:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-12-07 13:25:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:25:53,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:25:53,348 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:25:53,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:25:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:25:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1945950452, now seen corresponding path program 1 times [2019-12-07 13:25:53,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:25:53,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661310961] [2019-12-07 13:25:53,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:25:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:53,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661310961] [2019-12-07 13:25:53,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612171505] [2019-12-07 13:25:53,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:25:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:25:53,486 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 13:25:53,490 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:25:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:25:53,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:25:53,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-12-07 13:25:53,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113414920] [2019-12-07 13:25:53,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:25:53,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:25:53,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:25:53,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:25:53,538 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 7 states. [2019-12-07 13:25:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:25:56,185 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-12-07 13:25:56,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:25:56,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 13:25:56,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:25:56,192 INFO L225 Difference]: With dead ends: 28 [2019-12-07 13:25:56,192 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 13:25:56,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:25:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 13:25:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 13:25:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 13:25:56,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 13:25:56,193 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-12-07 13:25:56,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:25:56,193 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 13:25:56,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:25:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 13:25:56,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 13:25:56,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:25:56,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 13:25:56,807 WARN L192 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 13:25:56,883 INFO L249 CegarLoopResult]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-12-07 13:25:56,883 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-12-07 13:25:56,883 INFO L246 CegarLoopResult]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-12-07 13:25:56,883 INFO L246 CegarLoopResult]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-12-07 13:25:56,884 INFO L242 CegarLoopResult]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-12-07 13:25:56,884 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L242 CegarLoopResult]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-12-07 13:25:56,885 INFO L242 CegarLoopResult]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse7 (div ULTIMATE.start_main_~main__index2~0 4294967296)) (.cse6 (div ULTIMATE.start_main_~main__index1~0 4294967296))) (let ((.cse9 (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 .cse6))) (.cse8 (* 4294967296 .cse7)) (.cse0 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) .cse0 (or (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#main__array~0.base|))) (let ((.cse3 (select .cse5 (+ (* ULTIMATE.start_main_~main__index2~0 4) (* .cse7 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|))) (.cse4 (select .cse5 (+ (* ULTIMATE.start_main_~main__index1~0 4) (* .cse6 (- 17179869184)) |ULTIMATE.start_main_~#main__array~0.offset|)))) (let ((.cse2 (+ .cse3 (* 4294967296 (div .cse4 4294967296)))) (.cse1 (+ (* 4294967296 (div .cse3 4294967296)) .cse4))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))))) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8) .cse9))) (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ ULTIMATE.start_main_~main__index1~0 .cse8 1) .cse9) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse8 99999)) .cse0)))) [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 13:25:56,885 INFO L249 CegarLoopResult]: At program point L189(lines 9 191) the Hoare annotation is: true [2019-12-07 13:25:56,885 INFO L246 CegarLoopResult]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L246 CegarLoopResult]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L242 CegarLoopResult]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~main__index1~0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)) 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0) (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))) [2019-12-07 13:25:56,886 INFO L246 CegarLoopResult]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L242 CegarLoopResult]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (let ((.cse1 (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999))) (.cse2 (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))) (or (and .cse1 (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1) .cse2) (and .cse1 (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~1)) .cse2 (not (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~1 0))))))) [2019-12-07 13:25:56,886 INFO L246 CegarLoopResult]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:25:56,886 INFO L242 CegarLoopResult]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~main__index2~0 4294967296)))) (and (<= (+ ULTIMATE.start_main_~main__index1~0 .cse0 1) (+ ULTIMATE.start_main_~main__index2~0 (* 4294967296 (div ULTIMATE.start_main_~main__index1~0 4294967296)))) (= ULTIMATE.start_main_~main__loop_entered~0 0) (<= ULTIMATE.start_main_~main__index2~0 (+ .cse0 99999)) (= ULTIMATE.start_main_~main____CPAchecker_TMP_0~0 1))) [2019-12-07 13:25:56,887 INFO L246 CegarLoopResult]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-12-07 13:25:56,887 INFO L246 CegarLoopResult]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-12-07 13:25:56,887 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-12-07 13:25:56,887 INFO L242 CegarLoopResult]: At program point L167(lines 21 180) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~2)) (<= (+ (* 4294967296 (div (+ (* ULTIMATE.start_main_~main__index2~0 (- 1)) ULTIMATE.start_main_~main__index1~0 (* (div (+ ULTIMATE.start_main_~main__index2~0 4294867297) 4294967296) 4294967296) 4294967294) 4294967296)) 1) ULTIMATE.start_main_~main__index1~0) (= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)) [2019-12-07 13:25:56,887 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 13:25:56,887 INFO L246 CegarLoopResult]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-12-07 13:25:56,900 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,908 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,908 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,909 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:25:56 BoogieIcfgContainer [2019-12-07 13:25:56,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:25:56,913 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:25:56,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:25:56,914 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:25:56,914 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:25:52" (3/4) ... [2019-12-07 13:25:56,916 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:25:56,925 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-12-07 13:25:56,925 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 13:25:56,925 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 13:25:56,968 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d744f0ee-3984-4894-9bac-7a6c2a9b0e78/bin/uautomizer/witness.graphml [2019-12-07 13:25:56,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:25:56,969 INFO L168 Benchmark]: Toolchain (without parser) took 5363.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -145.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:25:56,970 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:25:56,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:25:56,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:25:56,970 INFO L168 Benchmark]: Boogie Preprocessor took 16.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:25:56,971 INFO L168 Benchmark]: RCFGBuilder took 226.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:25:56,971 INFO L168 Benchmark]: TraceAbstraction took 4823.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.0 MB). Peak memory consumption was 237.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:25:56,971 INFO L168 Benchmark]: Witness Printer took 55.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:25:56,972 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 210.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.75 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 226.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4823.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.0 MB). Peak memory consumption was 237.5 MB. Max. memory is 11.5 GB. * Witness Printer took 55.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main____CPAchecker_TMP_0 == 1) && 1 == __VERIFIER_assert__cond) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0))) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(0 == __VERIFIER_assert__cond) && 4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1) && 1 == __VERIFIER_assert__cond - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 93]: Loop Invariant [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,978 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-12-07 13:25:56,980 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1 && 1 == __VERIFIER_assert__cond) && ((4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] <= unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array] / 4294967296) <= 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__index2 / 4294967296 * -17179869184 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__index1 / 4294967296 * -17179869184 + main__array]) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296))) || (((!(0 == __VERIFIER_assert__cond) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && 1 == __VERIFIER_assert__cond) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && 4294967296 * ((main__index2 * -1 + main__index1 + (main__index2 + 4294867297) / 4294967296 * 4294967296 + 4294967294) / 4294967296) + 1 <= main__index1) && 1 == __VERIFIER_assert__cond) && !(main____CPAchecker_TMP_0 == 0) - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) && main__loop_entered == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main____CPAchecker_TMP_0 == 1 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 4 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 180 SDtfs, 181 SDslu, 202 SDs, 0 SdLazy, 145 SolverSat, 14 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, 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, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 19 NumberOfFragments, 375 HoareAnnotationTreeSize, 9 FomulaSimplifications, 697 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 113 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 21050 SizeOfPredicates, 2 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 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...