./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 d2a071cc6090a217f48ed180b566a651717a8e39 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 d2a071cc6090a217f48ed180b566a651717a8e39 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:29:24,664 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:29:24,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:29:24,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:29:24,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:29:24,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:29:24,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:29:24,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:29:24,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:29:24,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:29:24,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:29:24,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:29:24,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:29:24,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:29:24,681 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:29:24,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:29:24,682 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:29:24,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:29:24,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:29:24,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:29:24,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:29:24,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:29:24,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:29:24,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:29:24,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:29:24,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:29:24,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:29:24,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:29:24,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:29:24,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:29:24,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:29:24,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:29:24,693 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:29:24,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:29:24,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:29:24,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:29:24,695 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 05:29:24,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:29:24,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:29:24,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:29:24,703 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:29:24,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:29:24,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:29:24,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:29:24,704 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:29:24,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:29:24,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:29:24,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:29:24,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:29:24,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:29:24,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:29:24,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-12-02 05:29:24,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:29:24,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:29:24,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:29:24,743 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:29:24,744 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:29:24,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:24,786 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/64f9fbf01/167987ca81b2424eb43026dd5c146c3b/FLAGce7079b59 [2018-12-02 05:29:25,079 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:29:25,080 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:25,083 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/64f9fbf01/167987ca81b2424eb43026dd5c146c3b/FLAGce7079b59 [2018-12-02 05:29:25,521 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/64f9fbf01/167987ca81b2424eb43026dd5c146c3b [2018-12-02 05:29:25,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:29:25,525 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:29:25,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:29:25,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:29:25,527 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:29:25,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25, skipping insertion in model container [2018-12-02 05:29:25,530 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:29:25,546 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:29:25,634 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:29:25,637 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:29:25,647 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:29:25,654 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:29:25,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25 WrapperNode [2018-12-02 05:29:25,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:29:25,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:29:25,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:29:25,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:29:25,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:29:25,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:29:25,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:29:25,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:29:25,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... [2018-12-02 05:29:25,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:29:25,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:29:25,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:29:25,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:29:25,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 [2018-12-02 05:29:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:29:25,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:29:25,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:29:25,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:29:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:29:25,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:29:25,740 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 05:29:25,740 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 05:29:25,824 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:29:25,824 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 05:29:25,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:25 BoogieIcfgContainer [2018-12-02 05:29:25,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:29:25,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:29:25,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:29:25,828 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:29:25,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:29:25" (1/3) ... [2018-12-02 05:29:25,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e12ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:29:25, skipping insertion in model container [2018-12-02 05:29:25,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:25" (2/3) ... [2018-12-02 05:29:25,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e12ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:29:25, skipping insertion in model container [2018-12-02 05:29:25,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:25" (3/3) ... [2018-12-02 05:29:25,830 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:25,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:29:25,844 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:29:25,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:29:25,873 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:29:25,873 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:29:25,873 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:29:25,873 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:29:25,873 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:29:25,874 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:29:25,874 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:29:25,874 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:29:25,874 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:29:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-02 05:29:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:29:25,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:25,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:25,889 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:25,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:25,892 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-12-02 05:29:25,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:25,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:25,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:25,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:25,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:29:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:29:25,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 05:29:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:29:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:29:25,968 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-12-02 05:29:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:25,980 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 05:29:25,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:29:25,981 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 05:29:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:25,986 INFO L225 Difference]: With dead ends: 32 [2018-12-02 05:29:25,986 INFO L226 Difference]: Without dead ends: 13 [2018-12-02 05:29:25,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:29:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-02 05:29:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 05:29:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 05:29:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 05:29:26,008 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-02 05:29:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,009 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 05:29:26,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 05:29:26,009 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-02 05:29:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:29:26,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,009 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,010 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-12-02 05:29:26,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:26,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:29:26,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:29:26,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:29:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:29:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:29:26,055 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-12-02 05:29:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:26,065 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-02 05:29:26,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:29:26,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:29:26,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:26,066 INFO L225 Difference]: With dead ends: 21 [2018-12-02 05:29:26,066 INFO L226 Difference]: Without dead ends: 16 [2018-12-02 05:29:26,067 INFO L631 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 [2018-12-02 05:29:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-02 05:29:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-02 05:29:26,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 05:29:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-02 05:29:26,069 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-12-02 05:29:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,069 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-02 05:29:26,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:29:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-02 05:29:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:29:26,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,070 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-12-02 05:29:26,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:26,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:26,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:26,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 05:29:26,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:29:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:29:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:29:26,180 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-12-02 05:29:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:26,198 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-12-02 05:29:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:29:26,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-02 05:29:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:26,199 INFO L225 Difference]: With dead ends: 24 [2018-12-02 05:29:26,199 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 05:29:26,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:29:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 05:29:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-02 05:29:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 05:29:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-02 05:29:26,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-12-02 05:29:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,202 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-02 05:29:26,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:29:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-02 05:29:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 05:29:26,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,203 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,203 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1182180650, now seen corresponding path program 2 times [2018-12-02 05:29:26,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:26,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:26,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:26,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:29:26,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:29:26,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:26,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:26,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 05:29:26,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:29:26,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:29:26,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:29:26,312 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2018-12-02 05:29:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:26,342 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-12-02 05:29:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:29:26,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 05:29:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:26,343 INFO L225 Difference]: With dead ends: 27 [2018-12-02 05:29:26,343 INFO L226 Difference]: Without dead ends: 22 [2018-12-02 05:29:26,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:29:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-02 05:29:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-02 05:29:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-02 05:29:26,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-02 05:29:26,348 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 16 [2018-12-02 05:29:26,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,348 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-02 05:29:26,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:29:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-02 05:29:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 05:29:26,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,349 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,349 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2055818357, now seen corresponding path program 3 times [2018-12-02 05:29:26,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:26,420 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:26,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:29:26,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 05:29:26,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:26,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:26,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-02 05:29:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:29:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:29:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:29:26,505 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 9 states. [2018-12-02 05:29:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:26,548 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-12-02 05:29:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:29:26,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-12-02 05:29:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:26,550 INFO L225 Difference]: With dead ends: 30 [2018-12-02 05:29:26,550 INFO L226 Difference]: Without dead ends: 25 [2018-12-02 05:29:26,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:29:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-02 05:29:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-02 05:29:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 05:29:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 05:29:26,555 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2018-12-02 05:29:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,555 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 05:29:26,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:29:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 05:29:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:29:26,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,556 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,556 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 4 times [2018-12-02 05:29:26,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:26,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:26,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:29:26,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:29:26,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:26,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:26,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-02 05:29:26,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:29:26,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:29:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:29:26,716 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-12-02 05:29:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:26,790 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-12-02 05:29:26,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:29:26,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-02 05:29:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:26,791 INFO L225 Difference]: With dead ends: 33 [2018-12-02 05:29:26,791 INFO L226 Difference]: Without dead ends: 28 [2018-12-02 05:29:26,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:29:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-02 05:29:26,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-02 05:29:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-02 05:29:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-02 05:29:26,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2018-12-02 05:29:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:26,795 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-02 05:29:26,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:29:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-02 05:29:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 05:29:26,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:26,795 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:26,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:26,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1904607445, now seen corresponding path program 5 times [2018-12-02 05:29:26,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:26,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:26,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:26,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:26,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:26,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 05:29:26,876 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 05:29:26,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:26,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:27,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:27,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-02 05:29:27,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:29:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:29:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:29:27,018 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 13 states. [2018-12-02 05:29:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:27,118 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-02 05:29:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:29:27,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-12-02 05:29:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:27,119 INFO L225 Difference]: With dead ends: 36 [2018-12-02 05:29:27,119 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 05:29:27,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:29:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 05:29:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-02 05:29:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 05:29:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-12-02 05:29:27,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2018-12-02 05:29:27,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:27,125 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-02 05:29:27,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:29:27,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-12-02 05:29:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 05:29:27,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:27,126 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:27,127 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:27,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:27,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1015181846, now seen corresponding path program 6 times [2018-12-02 05:29:27,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:27,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:27,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:27,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:27,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:27,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 05:29:27,226 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 05:29:27,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:27,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:27,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:27,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-02 05:29:27,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 05:29:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 05:29:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:29:27,349 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 15 states. [2018-12-02 05:29:27,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:27,440 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2018-12-02 05:29:27,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:29:27,440 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-02 05:29:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:27,441 INFO L225 Difference]: With dead ends: 39 [2018-12-02 05:29:27,441 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 05:29:27,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-12-02 05:29:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 05:29:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-02 05:29:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 05:29:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-12-02 05:29:27,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 28 [2018-12-02 05:29:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:27,445 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-12-02 05:29:27,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 05:29:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-12-02 05:29:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 05:29:27,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:27,446 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:27,446 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:27,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -209588939, now seen corresponding path program 7 times [2018-12-02 05:29:27,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:27,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:27,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:27,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:29:27,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 05:29:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:27,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:27,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:27,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-02 05:29:27,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 05:29:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 05:29:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:29:27,698 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 17 states. [2018-12-02 05:29:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:27,810 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2018-12-02 05:29:27,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:29:27,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-02 05:29:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:27,811 INFO L225 Difference]: With dead ends: 42 [2018-12-02 05:29:27,811 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 05:29:27,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-02 05:29:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 05:29:27,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-12-02 05:29:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 05:29:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2018-12-02 05:29:27,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2018-12-02 05:29:27,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:27,815 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2018-12-02 05:29:27,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 05:29:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-12-02 05:29:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:29:27,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:27,815 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:27,815 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:27,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:27,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1608865354, now seen corresponding path program 8 times [2018-12-02 05:29:27,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:29:27,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:29:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:27,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:29:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:29:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:29:27,838 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:29:27,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:29:27 BoogieIcfgContainer [2018-12-02 05:29:27,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:29:27,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:29:27,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:29:27,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:29:27,857 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:25" (3/4) ... [2018-12-02 05:29:27,860 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:29:27,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:29:27,860 INFO L168 Benchmark]: Toolchain (without parser) took 2336.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 953.3 MB in the beginning and 1.0 GB in the end (delta: -51.1 MB). Peak memory consumption was 49.0 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:27,861 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:27,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:27,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:27,862 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:27,862 INFO L168 Benchmark]: RCFGBuilder took 116.54 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:27,862 INFO L168 Benchmark]: TraceAbstraction took 2031.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:27,863 INFO L168 Benchmark]: Witness Printer took 3.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:27,864 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.58 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.77 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 116.54 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2031.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftLeft at line 22, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L14] unsigned char x; [L15] unsigned char y; [L16] unsigned char c; [L18] x = 37 [L19] y = 0 [L20] c = 0 VAL [c=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=0, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=0, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=1, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=1, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=1, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=2, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=2, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=2, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=3, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=3, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=3, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=4, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=4, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=4, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=5, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=5, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=5, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=6, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=6, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=6, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=7, i=0, x=37, y=0] [L21] COND TRUE c < (unsigned char)8 [L22] unsigned char i = ((unsigned char)1) << c; [L23] unsigned char bit = x & i; VAL [c=7, x=37, y=0] [L24] COND TRUE bit != (unsigned char)0 [L25] y = y + i VAL [bit=1, c=7, i=0, x=37, y=0] [L27] c = c + ((unsigned char)1) VAL [bit=1, c=8, i=0, x=37, y=0] [L21] COND FALSE !(c < (unsigned char)8) VAL [bit=1, c=8, i=0, x=37, y=0] [L29] CALL __VERIFIER_assert(x == y) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 1.9s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 173 SDtfs, 130 SDslu, 914 SDs, 0 SdLazy, 667 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 124 SyntacticMatches, 13 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 312 ConstructedInterpolants, 70 QuantifiedInterpolants, 68271 SizeOfPredicates, 11 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/392 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:29:29,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:29:29,097 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:29:29,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:29:29,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:29:29,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:29:29,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:29:29,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:29:29,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:29:29,107 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:29:29,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:29:29,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:29:29,108 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:29:29,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:29:29,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:29:29,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:29:29,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:29:29,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:29:29,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:29:29,112 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:29:29,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:29:29,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:29:29,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:29:29,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:29:29,114 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:29:29,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:29:29,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:29:29,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:29:29,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:29:29,116 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:29:29,116 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:29:29,117 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:29:29,117 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:29:29,117 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:29:29,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:29:29,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:29:29,118 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-02 05:29:29,125 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:29:29,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:29:29,125 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:29:29,125 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:29:29,126 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:29:29,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:29:29,126 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:29:29,127 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:29:29,127 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:29:29,128 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 05:29:29,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 -> d2a071cc6090a217f48ed180b566a651717a8e39 [2018-12-02 05:29:29,146 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:29:29,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:29:29,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:29:29,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:29:29,158 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:29:29,158 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:29,196 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/9a95d4b7e/83255a537b654b40932ac74c776da722/FLAG6499813b0 [2018-12-02 05:29:29,496 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:29:29,496 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/sv-benchmarks/c/bitvector/num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:29,499 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/9a95d4b7e/83255a537b654b40932ac74c776da722/FLAG6499813b0 [2018-12-02 05:29:29,507 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/data/9a95d4b7e/83255a537b654b40932ac74c776da722 [2018-12-02 05:29:29,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:29:29,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:29:29,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:29:29,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:29:29,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:29:29,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63407dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29, skipping insertion in model container [2018-12-02 05:29:29,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:29:29,528 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:29:29,625 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:29:29,629 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:29:29,640 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:29:29,648 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:29:29,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29 WrapperNode [2018-12-02 05:29:29,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:29:29,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:29:29,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:29:29,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:29:29,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:29:29,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:29:29,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:29:29,665 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:29:29,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... [2018-12-02 05:29:29,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:29:29,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:29:29,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:29:29,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:29:29,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/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 [2018-12-02 05:29:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 05:29:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 05:29:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:29:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:29:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 05:29:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 05:29:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 05:29:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 05:29:29,842 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:29:29,842 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 05:29:29,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:29 BoogieIcfgContainer [2018-12-02 05:29:29,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:29:29,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:29:29,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:29:29,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:29:29,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:29:29" (1/3) ... [2018-12-02 05:29:29,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d941d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:29:29, skipping insertion in model container [2018-12-02 05:29:29,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:29:29" (2/3) ... [2018-12-02 05:29:29,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d941d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:29:29, skipping insertion in model container [2018-12-02 05:29:29,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:29" (3/3) ... [2018-12-02 05:29:29,847 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1_true-unreach-call_true-no-overflow.i [2018-12-02 05:29:29,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:29:29,857 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 05:29:29,866 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 05:29:29,882 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:29:29,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:29:29,883 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:29:29,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:29:29,883 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:29:29,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:29:29,883 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:29:29,883 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:29:29,883 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:29:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-12-02 05:29:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:29:29,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:29,897 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:29,898 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:29,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:29,901 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-12-02 05:29:29,903 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:29,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:29,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:29,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:29,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:29:29,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:29:29,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:29:29,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 05:29:29,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:29:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:29:29,967 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-12-02 05:29:29,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:29,981 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 05:29:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:29:29,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 05:29:29,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:29,987 INFO L225 Difference]: With dead ends: 32 [2018-12-02 05:29:29,987 INFO L226 Difference]: Without dead ends: 13 [2018-12-02 05:29:29,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:29:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-02 05:29:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 05:29:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 05:29:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 05:29:30,009 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-02 05:29:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:30,009 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 05:29:30,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 05:29:30,010 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-02 05:29:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 05:29:30,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:30,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:30,010 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:30,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-12-02 05:29:30,011 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:30,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:30,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:30,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:29:30,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:29:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:29:30,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:29:30,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:29:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:29:30,052 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-12-02 05:29:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:30,065 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-02 05:29:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:29:30,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 05:29:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:30,066 INFO L225 Difference]: With dead ends: 21 [2018-12-02 05:29:30,066 INFO L226 Difference]: Without dead ends: 16 [2018-12-02 05:29:30,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:29:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-02 05:29:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-02 05:29:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-02 05:29:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-02 05:29:30,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-12-02 05:29:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-02 05:29:30,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:29:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-02 05:29:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 05:29:30,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:30,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:30,071 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:30,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-12-02 05:29:30,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:30,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:29:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:30,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:30,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:30,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:30,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-12-02 05:29:30,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:29:30,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:29:30,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:29:30,126 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2018-12-02 05:29:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:30,159 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-12-02 05:29:30,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:29:30,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-02 05:29:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:30,160 INFO L225 Difference]: With dead ends: 28 [2018-12-02 05:29:30,160 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 05:29:30,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:29:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 05:29:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 05:29:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 05:29:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 05:29:30,163 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-12-02 05:29:30,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:30,163 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 05:29:30,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:29:30,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-02 05:29:30,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:29:30,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:30,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:30,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:30,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash 318767734, now seen corresponding path program 2 times [2018-12-02 05:29:30,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:30,165 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/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 [2018-12-02 05:29:30,178 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 05:29:30,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:29:30,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:30,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:30,238 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:30,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:30,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:30,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 05:29:30,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:29:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:29:30,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:29:30,277 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2018-12-02 05:29:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:30,351 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-12-02 05:29:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:29:30,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-02 05:29:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:30,352 INFO L225 Difference]: With dead ends: 45 [2018-12-02 05:29:30,353 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 05:29:30,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:29:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 05:29:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-02 05:29:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-02 05:29:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-02 05:29:30,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2018-12-02 05:29:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:30,357 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-02 05:29:30,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:29:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-12-02 05:29:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 05:29:30,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:30,358 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:30,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:30,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:30,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1506969082, now seen corresponding path program 1 times [2018-12-02 05:29:30,358 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:30,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:30,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:29:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:29:30,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:30,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:30,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-12-02 05:29:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 05:29:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 05:29:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:29:30,493 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 12 states. [2018-12-02 05:29:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:30,586 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-12-02 05:29:30,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:29:30,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-02 05:29:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:30,588 INFO L225 Difference]: With dead ends: 40 [2018-12-02 05:29:30,588 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 05:29:30,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:29:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 05:29:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-02 05:29:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 05:29:30,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-02 05:29:30,594 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 22 [2018-12-02 05:29:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-02 05:29:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 05:29:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-02 05:29:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:29:30,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:30,595 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:30,595 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:30,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:30,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1137706810, now seen corresponding path program 2 times [2018-12-02 05:29:30,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:30,596 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:30,609 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 05:29:30,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:29:30,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:30,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 05:29:30,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 51 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-02 05:29:30,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:30,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-02 05:29:30,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 05:29:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:29:30,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:29:30,787 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 13 states. [2018-12-02 05:29:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:31,195 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-02 05:29:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:29:31,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-12-02 05:29:31,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:31,196 INFO L225 Difference]: With dead ends: 69 [2018-12-02 05:29:31,197 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 05:29:31,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-12-02 05:29:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 05:29:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2018-12-02 05:29:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 05:29:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-02 05:29:31,202 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2018-12-02 05:29:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:31,203 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-02 05:29:31,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 05:29:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-02 05:29:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:29:31,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:31,203 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:31,204 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:31,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:31,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1498618808, now seen corresponding path program 3 times [2018-12-02 05:29:31,204 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:31,204 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/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 [2018-12-02 05:29:31,227 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 05:29:31,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 05:29:31,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:31,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 2 proven. 83 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:31,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:32,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:32,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-12-02 05:29:32,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 05:29:32,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 05:29:32,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 05:29:32,687 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 34 states. [2018-12-02 05:29:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:35,261 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-12-02 05:29:35,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-02 05:29:35,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-02 05:29:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:35,263 INFO L225 Difference]: With dead ends: 118 [2018-12-02 05:29:35,263 INFO L226 Difference]: Without dead ends: 113 [2018-12-02 05:29:35,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=431, Invalid=2875, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 05:29:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-02 05:29:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2018-12-02 05:29:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-02 05:29:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2018-12-02 05:29:35,281 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 34 [2018-12-02 05:29:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:35,281 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2018-12-02 05:29:35,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 05:29:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2018-12-02 05:29:35,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 05:29:35,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:35,282 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:35,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:35,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 911812794, now seen corresponding path program 4 times [2018-12-02 05:29:35,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:35,283 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 05:29:35,295 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:29:35,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:29:35,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:35,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:35,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 05:29:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 45 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 05:29:35,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:29:35,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-12-02 05:29:35,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 05:29:35,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:29:35,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:29:35,479 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 16 states. [2018-12-02 05:29:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:35,605 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-12-02 05:29:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 05:29:35,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-12-02 05:29:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:35,606 INFO L225 Difference]: With dead ends: 103 [2018-12-02 05:29:35,606 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 05:29:35,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-12-02 05:29:35,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 05:29:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-02 05:29:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 05:29:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-02 05:29:35,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 34 [2018-12-02 05:29:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:35,615 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-02 05:29:35,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 05:29:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-02 05:29:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 05:29:35,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:29:35,615 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:29:35,616 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:29:35,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:29:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1684357419, now seen corresponding path program 5 times [2018-12-02 05:29:35,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 05:29:35,616 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/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 [2018-12-02 05:29:35,629 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-02 05:29:35,662 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-12-02 05:29:35,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:29:35,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:29:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:29:36,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 05:29:36,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:29:36,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-02 05:29:36,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 05:29:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 05:29:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:29:36,104 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 18 states. [2018-12-02 05:29:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:29:36,232 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-02 05:29:36,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:29:36,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-12-02 05:29:36,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:29:36,233 INFO L225 Difference]: With dead ends: 42 [2018-12-02 05:29:36,233 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 05:29:36,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2018-12-02 05:29:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 05:29:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 05:29:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 05:29:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 05:29:36,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-02 05:29:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:29:36,234 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:29:36,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 05:29:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:29:36,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 05:29:36,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 05:29:36,701 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 115 [2018-12-02 05:29:36,703 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 05:29:36,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:29:36,703 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 05:29:36,703 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 05:29:36,704 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 05:29:36,704 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 05:29:36,704 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 12 32) the Hoare annotation is: true [2018-12-02 05:29:36,704 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-02 05:29:36,704 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 12 32) no Hoare annotation was computed. [2018-12-02 05:29:36,704 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-12-02 05:29:36,704 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 28) the Hoare annotation is: (let ((.cse12 (= (_ bv1 8) main_~y~0)) (.cse13 (not (= ((_ zero_extend 24) main_~bit~0) (_ bv0 32)))) (.cse11 (= (_ bv5 8) main_~y~0)) (.cse1 (= (_ bv0 8) main_~bit~0)) (.cse0 (= (_ bv37 8) main_~x~0)) (.cse9 ((_ zero_extend 24) main_~c~0))) (or (and .cse0 .cse1 (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 (_ bv1 32)))))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 (_ bv1 32)))))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse8 (_ bv1 32)))))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 (_ bv1 32)))))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 (_ bv1 32)))))) (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (_ bv1 32)))))) (and (bvslt .cse2 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse3 (_ bv1 32))) main_~c~0) (bvslt .cse4 (_ bv8 32)) (bvslt .cse5 (_ bv8 32)) (bvslt .cse6 (_ bv8 32)) (bvslt .cse7 (_ bv8 32)) (bvslt .cse8 (_ bv8 32)) (bvslt .cse3 (_ bv8 32))))))))))) (bvslt .cse9 (_ bv8 32)) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) v_main_~c~0_41))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse10 (_ bv1 32)))) (_ bv1 32))) main_~c~0) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse10))) (_ bv5 32))) main_~y~0))))) (and .cse0 .cse1 (= (_ bv5 8) main_~c~0) .cse11) (and (= (_ bv0 8) main_~c~0) .cse0 (= (_ bv0 8) main_~y~0)) (and .cse0 .cse1 .cse12 (= (_ bv2 8) main_~c~0)) (and .cse0 .cse1 .cse11 (= (_ bv4 8) main_~c~0)) (and .cse0 (= (_ bv1 8) main_~c~0) .cse13 .cse12) (and .cse0 .cse13 .cse11 (= (_ bv3 8) main_~c~0)) (and .cse0 (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse14 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse15))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse14 (_ bv1 32)))))))) .cse1 (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse20 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 (_ bv1 32)))))) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 (_ bv1 32)))))) (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse22 (_ bv1 32)))))) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (_ bv1 32)))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 (_ bv1 32)))))) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 (_ bv1 32)))))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse23 (_ bv1 32)))))) (and (bvslt .cse16 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse17 (_ bv1 32))) main_~c~0) (bvslt .cse18 (_ bv8 32)) (bvslt .cse17 (_ bv8 32)) (bvslt .cse19 (_ bv8 32)) (bvslt .cse20 (_ bv8 32)) (bvslt .cse21 (_ bv8 32)) (bvslt .cse22 (_ bv8 32)) (bvslt .cse23 (_ bv8 32))))))))))))) (and .cse0 (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) v_main_~c~0_41))) (and (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse24))) (_ bv5 32))) main_~y~0) (= ((_ extract 7 0) (bvadd .cse24 (_ bv1 32))) main_~c~0)))) (= (_ bv32 8) main_~bit~0) (exists ((v_main_~c~0_67 (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) v_main_~c~0_67))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (_ bv1 32)))))) (let ((.cse30 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (_ bv1 32)))))) (let ((.cse28 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse30 (_ bv1 32)))))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (_ bv1 32)))))) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse25 (_ bv1 32)))))) (and (bvslt .cse25 (_ bv8 32)) (bvslt .cse26 (_ bv8 32)) (= ((_ extract 7 0) (bvadd .cse27 (_ bv1 32))) main_~c~0) (bvslt .cse28 (_ bv8 32)) (bvslt .cse29 (_ bv8 32)) (bvslt .cse27 (_ bv8 32)) (bvslt .cse30 (_ bv8 32)))))))))) (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse9 (_ bv1 32)))) (_ bv8 32))))) [2018-12-02 05:29:36,705 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 28) the Hoare annotation is: (and (= (_ bv37 8) main_~x~0) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse1 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse0 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse1))) (_ bv5 32))) main_~y~0) (not (bvslt ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse0 (_ bv1 32)))) (_ bv8 32))))))) (exists ((v_main_~c~0_41 (_ BitVec 8))) (let ((.cse3 ((_ zero_extend 24) v_main_~c~0_41))) (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse3 (_ bv1 32)))) (_ bv1 32)))))) (and (bvslt .cse2 (_ bv8 32)) (= ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvshl (_ bv1 32) .cse3))) (_ bv5 32))) main_~y~0) (= main_~c~0 ((_ extract 7 0) (bvadd .cse2 (_ bv1 32))))))))) [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 12 32) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-02 05:29:36,705 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-12-02 05:29:36,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,733 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:29:36 BoogieIcfgContainer [2018-12-02 05:29:36,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:29:36,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:29:36,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:29:36,736 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:29:36,737 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:29:29" (3/4) ... [2018-12-02 05:29:36,740 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 05:29:36,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 05:29:36,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 05:29:36,744 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 05:29:36,747 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 05:29:36,747 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 05:29:36,747 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 05:29:36,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0] == c)) && 32bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) [2018-12-02 05:29:36,778 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_122f6be3-cee1-4bf7-a04a-d7a1255a0ce4/bin-2019/uautomizer/witness.graphml [2018-12-02 05:29:36,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:29:36,779 INFO L168 Benchmark]: Toolchain (without parser) took 7269.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -125.5 MB). Peak memory consumption was 163.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:36,779 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:36,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:36,780 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.85 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:36,780 INFO L168 Benchmark]: Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:36,780 INFO L168 Benchmark]: RCFGBuilder took 162.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:36,781 INFO L168 Benchmark]: TraceAbstraction took 6893.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:29:36,781 INFO L168 Benchmark]: Witness Printer took 41.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:29:36,783 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.41 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.85 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.76 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 162.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -196.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6893.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 54.4 MB). Peak memory consumption was 190.1 MB. Max. memory is 11.5 GB. * Witness Printer took 41.80 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 21]: Loop Invariant [2018-12-02 05:29:36,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,787 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,794 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,795 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_41,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,798 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] [2018-12-02 05:29:36,799 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~c~0_67,QUANTIFIED] Derived loop invariant: (((((((((((37bv8 == x && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: ((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(c), 8bv32)) && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0] == c && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == c) && 5bv8 == y)) || ((0bv8 == c && 37bv8 == x) && 0bv8 == y)) || (((37bv8 == x && 0bv8 == bit) && 1bv8 == y) && 2bv8 == c)) || (((37bv8 == x && 0bv8 == bit) && 5bv8 == y) && 4bv8 == c)) || (((37bv8 == x && 1bv8 == c) && !(~zero_extendFrom8To32(bit) == 0bv32)) && 1bv8 == y)) || (((37bv8 == x && !(~zero_extendFrom8To32(bit) == 0bv32)) && 5bv8 == y) && 3bv8 == c)) || (((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: (~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y) && c == ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0])) && 0bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)))) || ((((37bv8 == x && (\exists v_main_~c~0_41 : bv8 :: ~bvadd64(~zero_extendFrom8To32(~bvshl32(1bv32, ~zero_extendFrom8To32(v_main_~c~0_41))[7:0]), 5bv32)[7:0] == y && ~bvadd64(~zero_extendFrom8To32(v_main_~c~0_41), 1bv32)[7:0] == c)) && 32bv8 == bit) && (\exists v_main_~c~0_67 : bv8 :: (((((~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32) && ~bvslt32(~zero_extendFrom8To32(v_main_~c~0_67), 8bv32)) && ~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0] == c) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32)) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(v_main_~c~0_67), 1bv32)[7:0]), 1bv32)[7:0]), 8bv32))) && ~bvslt32(~zero_extendFrom8To32(~bvadd64(~zero_extendFrom8To32(c), 1bv32)[7:0]), 8bv32)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 6.8s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 198 SDslu, 762 SDs, 0 SdLazy, 1122 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 414 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 727 HoareAnnotationTreeSize, 15 FomulaSimplifications, 364 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 581 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 216 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 360 ConstructedInterpolants, 46 QuantifiedInterpolants, 152124 SizeOfPredicates, 24 NumberOfNonLiveVariables, 393 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 409/759 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...