./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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 3de88212c8693b9f87e164f2a8585947c848ea21 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:29:40,056 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:29:40,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:29:40,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:29:40,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:29:40,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:29:40,066 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:29:40,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:29:40,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:29:40,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:29:40,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:29:40,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:29:40,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:29:40,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:29:40,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:29:40,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:29:40,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:29:40,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:29:40,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:29:40,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:29:40,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:29:40,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:29:40,081 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:29:40,081 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:29:40,081 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:29:40,082 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:29:40,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:29:40,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:29:40,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:29:40,084 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:29:40,084 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:29:40,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:29:40,085 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:29:40,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:29:40,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:29:40,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:29:40,087 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:29:40,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:29:40,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:29:40,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:29:40,097 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:29:40,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:29:40,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:29:40,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:29:40,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:29:40,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:29:40,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:29:40,100 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:29:40,101 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:29:40,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:29:40,101 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_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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 -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-11-22 21:29:40,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:29:40,133 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:29:40,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:29:40,137 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:29:40,138 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:29:40,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-22 21:29:40,179 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/data/127bd9d96/e1438b1c3aa64578a5cef8031b1bb1f5/FLAGdef416344 [2018-11-22 21:29:40,514 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:29:40,515 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-22 21:29:40,520 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/data/127bd9d96/e1438b1c3aa64578a5cef8031b1bb1f5/FLAGdef416344 [2018-11-22 21:29:40,946 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/data/127bd9d96/e1438b1c3aa64578a5cef8031b1bb1f5 [2018-11-22 21:29:40,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:29:40,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:29:40,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:29:40,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:29:40,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:29:40,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:40" (1/1) ... [2018-11-22 21:29:40,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee9d804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:40, skipping insertion in model container [2018-11-22 21:29:40,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:29:40" (1/1) ... [2018-11-22 21:29:40,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:29:40,978 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:29:41,106 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:29:41,109 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:29:41,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:29:41,132 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:29:41,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41 WrapperNode [2018-11-22 21:29:41,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:29:41,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:29:41,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:29:41,133 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:29:41,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:29:41,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:29:41,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:29:41,146 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:29:41,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... [2018-11-22 21:29:41,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:29:41,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:29:41,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:29:41,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:29:41,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:29:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:29:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:29:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:29:41,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:29:41,235 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:29:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:29:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 21:29:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 21:29:41,377 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:29:41,377 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:29:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:41 BoogieIcfgContainer [2018-11-22 21:29:41,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:29:41,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:29:41,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:29:41,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:29:41,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:29:40" (1/3) ... [2018-11-22 21:29:41,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30171b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:41, skipping insertion in model container [2018-11-22 21:29:41,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:29:41" (2/3) ... [2018-11-22 21:29:41,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30171b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:29:41, skipping insertion in model container [2018-11-22 21:29:41,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:41" (3/3) ... [2018-11-22 21:29:41,384 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-22 21:29:41,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:29:41,394 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:29:41,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:29:41,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:29:41,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:29:41,421 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:29:41,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:29:41,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:29:41,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:29:41,422 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:29:41,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:29:41,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:29:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-22 21:29:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:29:41,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:41,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:41,437 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:41,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-22 21:29:41,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:41,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:41,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:41,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 21:29:41,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 21:29:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 21:29:41,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 21:29:41,517 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-22 21:29:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:41,530 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-22 21:29:41,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 21:29:41,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-22 21:29:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:41,536 INFO L225 Difference]: With dead ends: 38 [2018-11-22 21:29:41,536 INFO L226 Difference]: Without dead ends: 21 [2018-11-22 21:29:41,538 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-11-22 21:29:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-22 21:29:41,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-22 21:29:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 21:29:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-22 21:29:41,566 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-22 21:29:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:41,566 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-22 21:29:41,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 21:29:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-22 21:29:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:29:41,567 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:41,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:41,567 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:41,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-22 21:29:41,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:41,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:41,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:41,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:41,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:41,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:41,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:29:41,651 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-22 21:29:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:41,716 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-22 21:29:41,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:41,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-22 21:29:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:41,719 INFO L225 Difference]: With dead ends: 28 [2018-11-22 21:29:41,719 INFO L226 Difference]: Without dead ends: 23 [2018-11-22 21:29:41,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:29:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-22 21:29:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-22 21:29:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-22 21:29:41,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-22 21:29:41,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-22 21:29:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:41,723 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-22 21:29:41,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-22 21:29:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:41,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:41,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:41,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:41,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-22 21:29:41,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:41,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:41,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:43,800 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-11-22 21:29:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:43,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:43,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:43,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:43,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:29:43,805 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-22 21:29:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:43,901 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-22 21:29:43,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:43,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 21:29:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:43,903 INFO L225 Difference]: With dead ends: 50 [2018-11-22 21:29:43,904 INFO L226 Difference]: Without dead ends: 34 [2018-11-22 21:29:43,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:29:43,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-22 21:29:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-22 21:29:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:29:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-22 21:29:43,909 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-22 21:29:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:43,910 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-22 21:29:43,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-22 21:29:43,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:43,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:43,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:43,911 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:43,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:43,911 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-22 21:29:43,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:43,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:43,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:43,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:44,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-11-22 21:29:44,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:29:44,114 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:29:44,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:44,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:29:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:44,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:29:44,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-22 21:29:44,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 21:29:44,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:29:44,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:29:44,238 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-11-22 21:29:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:44,412 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-22 21:29:44,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 21:29:44,413 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-22 21:29:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:44,414 INFO L225 Difference]: With dead ends: 51 [2018-11-22 21:29:44,414 INFO L226 Difference]: Without dead ends: 46 [2018-11-22 21:29:44,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:29:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-22 21:29:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-22 21:29:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:29:44,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-22 21:29:44,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-22 21:29:44,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:44,420 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-22 21:29:44,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 21:29:44,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-22 21:29:44,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:44,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:44,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:44,422 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:44,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:44,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-11-22 21:29:44,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:44,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:44,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:44,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:46,454 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-22 21:29:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:46,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:46,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:46,458 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-22 21:29:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:46,462 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-22 21:29:46,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:46,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 21:29:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:46,462 INFO L225 Difference]: With dead ends: 60 [2018-11-22 21:29:46,463 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:29:46,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:29:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-22 21:29:46,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:29:46,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-22 21:29:46,469 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-11-22 21:29:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:46,470 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-22 21:29:46,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:46,470 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-22 21:29:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:46,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:46,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:46,471 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:46,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-11-22 21:29:46,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:46,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:46,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:46,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:46,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:48,507 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-22 21:29:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:48,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:48,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:48,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:48,512 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-22 21:29:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:48,515 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-22 21:29:48,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:48,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 21:29:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:48,516 INFO L225 Difference]: With dead ends: 60 [2018-11-22 21:29:48,516 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:29:48,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:29:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-22 21:29:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:29:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-22 21:29:48,521 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-11-22 21:29:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:48,521 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-22 21:29:48,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-22 21:29:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:48,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:48,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:48,522 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:48,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-11-22 21:29:48,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:48,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:48,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:48,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:50,548 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-22 21:29:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:50,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:50,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:50,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:50,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:50,552 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-22 21:29:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:50,555 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-22 21:29:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:50,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 21:29:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:50,555 INFO L225 Difference]: With dead ends: 60 [2018-11-22 21:29:50,556 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:29:50,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-22 21:29:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:29:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-22 21:29:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:29:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-22 21:29:50,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-22 21:29:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:50,561 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-22 21:29:50,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-22 21:29:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:50,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:50,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:50,562 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:50,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-11-22 21:29:50,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:50,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:50,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:29:50,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:29:50,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:29:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:29:50,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:29:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:29:50,606 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-22 21:29:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:29:50,646 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-22 21:29:50,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:29:50,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-22 21:29:50,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:29:50,647 INFO L225 Difference]: With dead ends: 61 [2018-11-22 21:29:50,647 INFO L226 Difference]: Without dead ends: 45 [2018-11-22 21:29:50,647 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-11-22 21:29:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-22 21:29:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-22 21:29:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:29:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-22 21:29:50,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-11-22 21:29:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:29:50,651 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-22 21:29:50,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:29:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-22 21:29:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-22 21:29:50,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:29:50,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:29:50,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:29:50,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:29:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-22 21:29:50,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:29:50,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:29:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:29:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:29:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:29:52,798 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-22 21:29:58,884 WARN L180 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-11-22 21:30:06,969 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-11-22 21:30:08,980 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-22 21:30:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:11,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:30:11,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:30:11,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:11,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:11,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:30:11,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2018-11-22 21:30:11,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 21:30:11,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 21:30:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=5, NotChecked=42, Total=182 [2018-11-22 21:30:11,333 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 14 states. [2018-11-22 21:30:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:25,551 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-22 21:30:25,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 21:30:25,551 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-22 21:30:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:25,552 INFO L225 Difference]: With dead ends: 62 [2018-11-22 21:30:25,552 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 21:30:25,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=31, Invalid=128, Unknown=5, NotChecked=46, Total=210 [2018-11-22 21:30:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 21:30:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 21:30:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 21:30:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-22 21:30:25,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-11-22 21:30:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:25,556 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-22 21:30:25,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 21:30:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-22 21:30:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:30:25,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:25,557 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:25,557 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:25,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-11-22 21:30:25,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:25,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:25,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:25,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:25,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:30:25,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:30:25,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:30:25,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:30:25,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:30:25,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:30:25,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-22 21:30:25,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-22 21:30:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-22 21:30:25,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-22 21:30:25,899 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-22 21:30:26,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:26,099 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-22 21:30:26,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-22 21:30:26,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-22 21:30:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:26,100 INFO L225 Difference]: With dead ends: 50 [2018-11-22 21:30:26,100 INFO L226 Difference]: Without dead ends: 45 [2018-11-22 21:30:26,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-22 21:30:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-22 21:30:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-22 21:30:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 21:30:26,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-22 21:30:26,103 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-11-22 21:30:26,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:26,103 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-22 21:30:26,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-22 21:30:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-22 21:30:26,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-22 21:30:26,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:26,104 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:26,104 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:26,104 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-11-22 21:30:26,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:26,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:26,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:26,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:26,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:26,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:30:26,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:30:26,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:30:26,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-22 21:30:26,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:30:26,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:26,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:30:26,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-22 21:30:26,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-22 21:30:26,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-22 21:30:26,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-11-22 21:30:26,684 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-11-22 21:30:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:27,082 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-22 21:30:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-22 21:30:27,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-22 21:30:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:27,083 INFO L225 Difference]: With dead ends: 61 [2018-11-22 21:30:27,084 INFO L226 Difference]: Without dead ends: 56 [2018-11-22 21:30:27,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-11-22 21:30:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-22 21:30:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-22 21:30:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 21:30:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-22 21:30:27,087 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-11-22 21:30:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:27,087 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-22 21:30:27,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-22 21:30:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-22 21:30:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-22 21:30:27,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:27,090 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:27,090 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:27,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-11-22 21:30:27,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:27,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:27,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:27,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:30:27,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:30:27,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 21:30:27,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 21:30:27,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:30:27,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:27,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:30:27,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-22 21:30:27,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-22 21:30:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-22 21:30:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-11-22 21:30:27,973 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-11-22 21:30:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:28,591 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-22 21:30:28,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-22 21:30:28,592 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-11-22 21:30:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:30:28,592 INFO L225 Difference]: With dead ends: 72 [2018-11-22 21:30:28,593 INFO L226 Difference]: Without dead ends: 67 [2018-11-22 21:30:28,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-11-22 21:30:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-22 21:30:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-22 21:30:28,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-22 21:30:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-22 21:30:28,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-11-22 21:30:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:30:28,601 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-22 21:30:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-22 21:30:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-22 21:30:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-22 21:30:28,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:30:28,602 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:28,602 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:30:28,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:28,602 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-11-22 21:30:28,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:28,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:28,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:28,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:30,747 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-11-22 21:30:32,787 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-11-22 21:30:36,903 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:38,976 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:41,028 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:45,092 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:47,149 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:49,209 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:51,269 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:55,344 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:30:59,426 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:03,498 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:07,577 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:09,643 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:11,721 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:15,801 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:17,896 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:21,989 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:24,102 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:32,223 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:34,314 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:38,418 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:46,538 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:52,639 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:56,754 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:31:58,847 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:02,962 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:07,081 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:13,315 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:15,422 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:21,568 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:25,690 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:27,820 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:31,967 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:40,112 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:44,243 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:50,404 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:54,540 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:32:56,681 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:04,832 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:06,989 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:11,130 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:13,263 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:15,419 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:23,584 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:29,745 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-22 21:33:31,756 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse29 (div c_main_~x~0 2))) (and (let ((.cse7 (* 2 .cse29)) (.cse31 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse4 (<= .cse31 c_main_~x~0)) (.cse30 (* (- 2) .cse29)) (.cse3 (= .cse7 c_main_~x~0))) (let ((.cse0 (not .cse3)) (.cse1 (< c_main_~x~0 .cse31)) (.cse2 (div (+ c_main_~x~0 .cse30 (- 2)) 4294967296)) (.cse23 (or .cse3 .cse4)) (.cse27 (div (+ c_main_~x~0 .cse30) 4294967296))) (or (and .cse0 .cse1 (<= (+ .cse2 1) 0)) (let ((.cse28 (div c_main_~y~0 2))) (let ((.cse26 (* (- 2) .cse28)) (.cse25 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse8 (* 2 .cse28))) (let ((.cse12 (= c_main_~y~0 .cse8)) (.cse13 (<= .cse25 c_main_~y~0)) (.cse24 (* 4294967296 (div (+ c_main_~y~0 .cse26) 4294967296))) (.cse16 (* 4294967296 .cse27)) (.cse9 (* 4294967296 (div (+ c_main_~y~0 .cse26 (- 2)) 4294967296))) (.cse6 (* 4294967296 .cse2))) (let ((.cse21 (+ c_main_~y~0 .cse6 .cse7)) (.cse5 (+ .cse8 c_main_~x~0 .cse9)) (.cse20 (+ .cse8 c_main_~x~0 .cse9 2)) (.cse22 (+ c_main_~y~0 .cse6 .cse7 2)) (.cse10 (+ c_main_~y~0 .cse7 .cse16)) (.cse15 (+ .cse8 c_main_~x~0 .cse24)) (.cse17 (or .cse12 .cse13)) (.cse18 (not .cse12)) (.cse19 (< c_main_~y~0 .cse25))) (and (let ((.cse14 (and .cse18 .cse19)) (.cse11 (and .cse0 .cse1))) (or (and (or (and (or .cse3 .cse4 (< .cse5 (+ c_main_~y~0 .cse6 .cse7 1))) (or (< (+ .cse8 c_main_~x~0 .cse9 1) .cse10) .cse11)) .cse12 .cse13) (or .cse14 (and (or .cse11 (< .cse15 (+ c_main_~y~0 .cse7 .cse16 1))) (or (< .cse15 (+ c_main_~y~0 .cse6 .cse7 3)) .cse3 .cse4)))) (and (<= .cse15 (+ c_main_~y~0 100)) .cse17) (and (<= .cse5 (+ c_main_~y~0 98)) .cse18 .cse19) (and (or (and (or (< .cse20 .cse10) .cse11) (or (< .cse5 .cse21) .cse3 .cse4)) .cse12 .cse13) (or .cse14 (and (or .cse3 .cse4 (< .cse15 .cse22)) (or (< .cse15 .cse10) .cse11)))))) (or (and .cse18 .cse19 (or (and (<= .cse21 .cse5) .cse0 .cse1) (and .cse23 (<= .cse10 .cse20)))) (and (or (and .cse0 (<= .cse22 .cse15) .cse1) (and .cse23 (<= .cse10 .cse15))) .cse17) (and (<= c_main_~y~0 (+ .cse8 .cse24)) .cse17) (and .cse18 .cse19 (<= c_main_~y~0 (+ .cse8 .cse9 2))))))))) (<= .cse29 49) (and .cse23 (<= (+ .cse27 1) 0)))))) (or (< 49 .cse29) (<= 100 c_main_~x~0)))) is different from false [2018-11-22 21:34:18,259 WARN L180 SmtUtils]: Spent 16.15 s on a formula simplification. DAG size of input: 122 DAG size of output: 27 [2018-11-22 21:34:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-22 21:34:18,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:34:18,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/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-11-22 21:34:18,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 21:34:19,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-22 21:34:19,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:34:19,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:34:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:34:20,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 21:34:20,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55] total 67 [2018-11-22 21:34:20,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-11-22 21:34:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-11-22 21:34:20,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4136, Unknown=16, NotChecked=128, Total=4422 [2018-11-22 21:34:20,223 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 67 states. [2018-11-22 21:34:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:21,528 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-22 21:34:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-22 21:34:21,528 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 65 [2018-11-22 21:34:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:21,529 INFO L225 Difference]: With dead ends: 80 [2018-11-22 21:34:21,529 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:34:21,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 230.4s TimeCoverageRelationStatistics Valid=146, Invalid=4264, Unknown=16, NotChecked=130, Total=4556 [2018-11-22 21:34:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:34:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:34:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:34:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:34:21,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-11-22 21:34:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:21,531 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:34:21,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-11-22 21:34:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:34:21,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:34:21,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:34:21,628 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 21:34:21,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:34:21,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:34:21,628 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:34:21,628 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:34:21,628 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:34:21,628 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-22 21:34:21,629 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-22 21:34:21,629 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-22 21:34:21,629 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-22 21:34:21,630 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-22 21:34:21,630 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-22 21:34:21,630 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-22 21:34:21,630 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-22 21:34:21,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:34:21 BoogieIcfgContainer [2018-11-22 21:34:21,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:34:21,640 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:34:21,640 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:34:21,641 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:34:21,641 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:29:41" (3/4) ... [2018-11-22 21:34:21,644 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:34:21,648 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:34:21,648 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:34:21,649 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-22 21:34:21,651 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-22 21:34:21,651 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-22 21:34:21,651 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:34:21,683 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3eb66409-a50b-42b0-a0db-d8c3f3cbf619/bin-2019/uautomizer/witness.graphml [2018-11-22 21:34:21,683 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:34:21,684 INFO L168 Benchmark]: Toolchain (without parser) took 280735.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 958.1 MB in the beginning and 942.8 MB in the end (delta: 15.3 MB). Peak memory consumption was 281.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,684 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:34:21,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.19 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,685 INFO L168 Benchmark]: Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:34:21,685 INFO L168 Benchmark]: RCFGBuilder took 216.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,686 INFO L168 Benchmark]: TraceAbstraction took 280261.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 175.4 MB). Peak memory consumption was 292.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,686 INFO L168 Benchmark]: Witness Printer took 42.93 ms. Allocated memory is still 1.3 GB. Free memory was 951.1 MB in the beginning and 942.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:21,687 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 183.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 13.19 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.17 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 216.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 280261.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 951.1 MB in the end (delta: 175.4 MB). Peak memory consumption was 292.3 MB. Max. memory is 11.5 GB. * Witness Printer took 42.93 ms. Allocated memory is still 1.3 GB. Free memory was 951.1 MB in the beginning and 942.8 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 280.2s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 17.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 36 SDslu, 1125 SDs, 0 SdLazy, 7380 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 232 SyntacticMatches, 19 SemanticMatches, 193 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 274.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, 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, 13 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 21 PreInvPairs, 30 NumberOfFragments, 289 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 261.1s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 461672 SizeOfPredicates, 8 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 5/477 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...