./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3de88212c8693b9f87e164f2a8585947c848ea21 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:07:46,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:07:46,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:07:46,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:07:46,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:07:46,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:07:46,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:07:46,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:07:46,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:07:46,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:07:46,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:07:46,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:07:46,275 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:07:46,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:07:46,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:07:46,278 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:07:46,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:07:46,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:07:46,281 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:07:46,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:07:46,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:07:46,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:07:46,285 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:07:46,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:07:46,286 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:07:46,287 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:07:46,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:07:46,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:07:46,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:07:46,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:07:46,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:07:46,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:07:46,290 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:07:46,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:07:46,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:07:46,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:07:46,292 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 08:07:46,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:07:46,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:07:46,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:07:46,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:07:46,303 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:07:46,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:07:46,304 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 08:07:46,305 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 08:07:46,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:07:46,306 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:07:46,306 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:07:46,306 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:07:46,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:07:46,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:07:46,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 08:07:46,307 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-12-02 08:07:46,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:07:46,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:07:46,341 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:07:46,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:07:46,342 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:07:46,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-02 08:07:46,378 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/data/b07b6623b/7753fde2522e4679ab0673487b58ca1a/FLAG4e36c832d [2018-12-02 08:07:46,778 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:07:46,778 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-02 08:07:46,781 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/data/b07b6623b/7753fde2522e4679ab0673487b58ca1a/FLAG4e36c832d [2018-12-02 08:07:46,789 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/data/b07b6623b/7753fde2522e4679ab0673487b58ca1a [2018-12-02 08:07:46,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:07:46,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:07:46,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:07:46,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:07:46,794 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:07:46,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033e242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46, skipping insertion in model container [2018-12-02 08:07:46,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:07:46,809 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:07:46,902 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:07:46,904 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:07:46,917 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:07:46,925 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:07:46,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46 WrapperNode [2018-12-02 08:07:46,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:07:46,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:07:46,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:07:46,926 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:07:46,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:07:46,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:07:46,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:07:46,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:07:46,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... [2018-12-02 08:07:46,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:07:46,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:07:46,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:07:46,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:07:46,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:07:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:07:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:07:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:07:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:07:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:07:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:07:47,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 08:07:47,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 08:07:47,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:07:47,157 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 08:07:47,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:07:47 BoogieIcfgContainer [2018-12-02 08:07:47,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:07:47,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:07:47,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:07:47,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:07:47,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:07:46" (1/3) ... [2018-12-02 08:07:47,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:07:47, skipping insertion in model container [2018-12-02 08:07:47,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:07:46" (2/3) ... [2018-12-02 08:07:47,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb2100c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:07:47, skipping insertion in model container [2018-12-02 08:07:47,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:07:47" (3/3) ... [2018-12-02 08:07:47,162 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-12-02 08:07:47,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:07:47,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 08:07:47,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 08:07:47,201 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:07:47,201 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 08:07:47,201 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:07:47,201 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:07:47,201 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:07:47,202 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:07:47,202 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:07:47,202 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:07:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 08:07:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:07:47,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:47,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:07:47,217 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:47,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:47,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-12-02 08:07:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:47,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:47,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:07:47,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:47,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 08:07:47,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 08:07:47,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:07:47,295 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-02 08:07:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:47,308 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-02 08:07:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 08:07:47,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 08:07:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:47,314 INFO L225 Difference]: With dead ends: 38 [2018-12-02 08:07:47,314 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 08:07:47,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:07:47,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 08:07:47,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 08:07:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 08:07:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-12-02 08:07:47,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-12-02 08:07:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:47,339 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-12-02 08:07:47,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 08:07:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-12-02 08:07:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:07:47,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:47,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:07:47,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:47,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:47,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-12-02 08:07:47,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:47,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:47,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:47,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:47,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:47,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:47,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:47,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:07:47,405 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-12-02 08:07:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:47,443 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-12-02 08:07:47,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:47,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 08:07:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:47,445 INFO L225 Difference]: With dead ends: 28 [2018-12-02 08:07:47,445 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 08:07:47,446 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-12-02 08:07:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 08:07:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-02 08:07:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 08:07:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-02 08:07:47,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-12-02 08:07:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:47,449 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-02 08:07:47,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-02 08:07:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:47,450 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:47,450 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-12-02 08:07:47,450 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:47,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-12-02 08:07:47,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:47,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:47,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:49,519 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-12-02 08:07:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:49,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:49,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:49,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:49,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:49,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:49,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:07:49,521 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-02 08:07:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:49,587 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-12-02 08:07:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:49,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:07:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:49,589 INFO L225 Difference]: With dead ends: 50 [2018-12-02 08:07:49,589 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 08:07:49,589 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-12-02 08:07:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 08:07:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 08:07:49,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 08:07:49,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-02 08:07:49,593 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-12-02 08:07:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:49,593 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-02 08:07:49,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-02 08:07:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:49,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:49,594 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-12-02 08:07:49,594 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:49,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:49,594 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-12-02 08:07:49,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:49,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:49,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:49,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:49,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:07:49,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:07:49,735 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 08:07:49,737 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2018-12-02 08:07:49,758 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:07:49,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:07:49,966 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:07:49,967 INFO L272 AbstractInterpreter]: Visited 21 different actions 53 times. Merged at 12 different actions 26 times. Never widened. Performed 214 root evaluator evaluations with a maximum evaluation depth of 13. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 3 variables. [2018-12-02 08:07:49,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:49,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:07:49,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:07:49,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:07:49,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:49,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:07:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:49,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:07:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:50,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:07:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:50,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:07:50,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-02 08:07:50,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:07:50,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 08:07:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 08:07:50,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-02 08:07:50,878 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-12-02 08:07:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:51,018 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-02 08:07:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 08:07:51,019 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-12-02 08:07:51,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:51,019 INFO L225 Difference]: With dead ends: 51 [2018-12-02 08:07:51,019 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 08:07:51,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-02 08:07:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 08:07:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-02 08:07:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:07:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-02 08:07:51,023 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-12-02 08:07:51,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:51,023 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-02 08:07:51,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 08:07:51,023 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-02 08:07:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:51,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:51,024 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-12-02 08:07:51,024 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:51,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:51,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-12-02 08:07:51,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:51,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:51,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:51,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:53,056 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-12-02 08:07:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:53,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:53,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:53,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:53,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:53,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 08:07:53,059 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-12-02 08:07:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:53,061 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-12-02 08:07:53,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:53,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:07:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:53,062 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:07:53,062 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 08:07:53,062 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-12-02 08:07:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 08:07:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 08:07:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:07:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-12-02 08:07:53,065 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-12-02 08:07:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:53,065 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-02 08:07:53,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-12-02 08:07:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:53,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:53,066 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-12-02 08:07:53,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:53,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-12-02 08:07:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:53,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:53,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:55,086 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-12-02 08:07:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:55,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:55,090 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:55,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:55,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:55,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 08:07:55,091 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-12-02 08:07:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:55,093 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-02 08:07:55,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:55,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:07:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:55,093 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:07:55,094 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 08:07:55,094 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-12-02 08:07:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 08:07:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 08:07:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:07:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-02 08:07:55,097 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-12-02 08:07:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:55,097 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-02 08:07:55,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-12-02 08:07:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:55,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:55,097 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-12-02 08:07:55,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:55,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-12-02 08:07:55,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:55,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:55,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:55,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:55,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:57,118 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-12-02 08:07:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:57,123 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:57,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 08:07:57,123 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-12-02 08:07:57,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:57,126 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-12-02 08:07:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:57,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:07:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:57,126 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:07:57,126 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 08:07:57,126 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-12-02 08:07:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 08:07:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 08:07:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:07:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-02 08:07:57,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-02 08:07:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:57,129 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-02 08:07:57,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-02 08:07:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:57,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:57,130 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-12-02 08:07:57,130 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:57,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-12-02 08:07:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:57,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:57,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:07:57,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:07:57,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:07:57,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:07:57,160 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:07:57,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 08:07:57,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 08:07:57,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:07:57,161 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-12-02 08:07:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:07:57,192 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-02 08:07:57,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 08:07:57,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 08:07:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:07:57,192 INFO L225 Difference]: With dead ends: 61 [2018-12-02 08:07:57,193 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 08:07:57,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 08:07:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 08:07:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-02 08:07:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:07:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-02 08:07:57,195 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-12-02 08:07:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:07:57,195 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-02 08:07:57,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 08:07:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-02 08:07:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:07:57,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:07:57,196 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-12-02 08:07:57,196 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:07:57,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:07:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-12-02 08:07:57,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:07:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:57,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:07:57,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:07:57,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:07:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:03,342 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2018-12-02 08:08:05,353 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 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)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-02 08:08:07,366 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 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)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-02 08:08:09,379 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-12-02 08:08:17,535 WARN L180 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 168 DAG size of output: 21 [2018-12-02 08:08:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:19,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:19,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:08:19,601 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 08:08:19,602 INFO L205 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [24], [30], [36], [42], [48], [54], [60], [66], [72], [79], [82], [84], [90], [91], [92], [94] [2018-12-02 08:08:19,603 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:08:19,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:08:19,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:08:19,678 INFO L272 AbstractInterpreter]: Visited 21 different actions 23 times. Merged at 1 different actions 1 times. Never widened. Performed 59 root evaluator evaluations with a maximum evaluation depth of 13. Performed 59 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 4 variables. [2018-12-02 08:08:19,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:19,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:08:19,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:19,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:08:19,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:19,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:08:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:19,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:19,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:08:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:19,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:08:19,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 6] total 19 [2018-12-02 08:08:19,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:08:19,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 08:08:19,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 08:08:19,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=202, Unknown=5, NotChecked=90, Total=342 [2018-12-02 08:08:19,939 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2018-12-02 08:08:28,057 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 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)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-02 08:08:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:08:40,151 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-02 08:08:40,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 08:08:40,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-02 08:08:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:08:40,151 INFO L225 Difference]: With dead ends: 62 [2018-12-02 08:08:40,151 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 08:08:40,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=53, Invalid=229, Unknown=6, NotChecked=132, Total=420 [2018-12-02 08:08:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 08:08:40,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 08:08:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 08:08:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-02 08:08:40,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-12-02 08:08:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:08:40,154 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-02 08:08:40,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 08:08:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-02 08:08:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 08:08:40,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:08:40,155 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-12-02 08:08:40,155 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:08:40,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:40,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-12-02 08:08:40,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:08:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:40,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:40,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:40,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:08:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:40,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:40,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:08:40,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:08:40,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:08:40,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:40,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:08:40,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 08:08:40,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 08:08:40,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 08:08:40,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:08:40,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:40,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:08:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:43,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:08:43,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-02 08:08:43,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:08:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 08:08:43,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 08:08:43,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 08:08:43,285 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-12-02 08:08:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:08:43,479 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-02 08:08:43,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 08:08:43,479 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-12-02 08:08:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:08:43,480 INFO L225 Difference]: With dead ends: 50 [2018-12-02 08:08:43,480 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 08:08:43,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-02 08:08:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 08:08:43,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-02 08:08:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 08:08:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-02 08:08:43,484 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-12-02 08:08:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:08:43,484 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-02 08:08:43,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 08:08:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-02 08:08:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 08:08:43,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:08:43,485 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-12-02 08:08:43,485 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:08:43,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-12-02 08:08:43,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:08:43,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:43,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:08:43,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:43,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:08:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:43,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:43,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:08:43,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:08:43,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:08:43,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:43,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:08:43,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 08:08:43,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 08:08:43,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 08:08:43,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:08:43,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:43,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:08:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:47,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:08:47,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-02 08:08:47,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:08:47,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 08:08:47,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 08:08:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 08:08:47,550 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-12-02 08:08:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:08:47,969 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-02 08:08:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 08:08:47,970 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-12-02 08:08:47,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:08:47,970 INFO L225 Difference]: With dead ends: 61 [2018-12-02 08:08:47,971 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 08:08:47,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-12-02 08:08:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 08:08:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-02 08:08:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 08:08:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-02 08:08:47,974 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-12-02 08:08:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:08:47,975 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-02 08:08:47,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 08:08:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-02 08:08:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 08:08:47,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:08:47,976 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-12-02 08:08:47,976 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:08:47,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:47,976 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-12-02 08:08:47,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:08:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:47,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 08:08:47,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:47,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:08:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:48,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:48,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:08:48,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:08:48,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:08:48,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:08:48,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:08:48,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:48,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:08:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:48,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:08:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:48,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:08:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:08:51,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:08:51,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-02 08:08:51,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:08:51,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 08:08:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 08:08:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-12-02 08:08:51,356 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-12-02 08:08:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:08:52,009 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-02 08:08:52,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 08:08:52,009 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-12-02 08:08:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:08:52,010 INFO L225 Difference]: With dead ends: 72 [2018-12-02 08:08:52,010 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 08:08:52,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-12-02 08:08:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 08:08:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-02 08:08:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 08:08:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-02 08:08:52,017 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-12-02 08:08:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:08:52,017 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-02 08:08:52,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 08:08:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-02 08:08:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 08:08:52,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:08:52,018 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-12-02 08:08:52,018 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 08:08:52,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:08:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-12-02 08:08:52,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:08:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:52,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:08:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:08:52,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:08:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:08:54,129 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse8 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse7 (= c_main_~y~0 .cse0)) (.cse6 (* (- 2) .cse9))) (let ((.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse2 (not .cse7)) (.cse3 (< c_main_~y~0 .cse8)) (.cse5 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse4 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= (+ .cse0 c_main_~x~0 .cse1) c_main_~y~0) .cse2 .cse3) (and (<= (+ .cse0 c_main_~x~0 .cse4) (+ c_main_~y~0 2)) .cse5)) (<= 2 c_main_~x~0) (or (and (= (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (and .cse5 (= (+ .cse0 .cse4) c_main_~y~0)))))))) is different from true [2018-12-02 08:08:56,170 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-12-02 08:08:58,237 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:00,359 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:02,416 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:06,479 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:12,561 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:16,641 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:20,777 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:24,926 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:31,027 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:33,115 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:39,210 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:45,317 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:49,425 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:51,514 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:55,619 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:57,722 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:09:59,829 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:03,958 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:06,070 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:12,210 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:16,325 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:18,456 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:24,593 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:26,724 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:32,855 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:34,969 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:37,104 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:41,505 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:45,642 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:49,793 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:51,950 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:56,107 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:10:58,265 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:11:02,427 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:11:06,873 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:11:09,060 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:11:11,227 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 08:11:29,821 WARN L180 SmtUtils]: Spent 12.17 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2018-12-02 08:12:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-02 08:12:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:12:02,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:12:02,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 08:12:02,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 08:12:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:12:02,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 08:12:02,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 08:12:02,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 08:12:02,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 08:12:02,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 08:12:02,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:12:05,794 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:12:05,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:12:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-12-02 08:12:11,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:12:11,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 100 [2018-12-02 08:12:11,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:12:11,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-02 08:12:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-02 08:12:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=9323, Unknown=4, NotChecked=194, Total=9900 [2018-12-02 08:12:11,375 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 96 states. [2018-12-02 08:12:13,567 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2018-12-02 08:12:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:12:15,488 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-02 08:12:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-02 08:12:15,488 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 65 [2018-12-02 08:12:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:12:15,488 INFO L225 Difference]: With dead ends: 80 [2018-12-02 08:12:15,488 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 08:12:15,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 43 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 201.3s TimeCoverageRelationStatistics Valid=390, Invalid=9710, Unknown=4, NotChecked=198, Total=10302 [2018-12-02 08:12:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 08:12:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 08:12:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 08:12:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 08:12:15,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-12-02 08:12:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:12:15,492 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 08:12:15,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-02 08:12:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 08:12:15,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 08:12:15,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 08:12:15,603 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 08:12:15,603 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 08:12:15,603 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 (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (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-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 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-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,603 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-12-02 08:12:15,604 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-02 08:12:15,604 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-02 08:12:15,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:12:15 BoogieIcfgContainer [2018-12-02 08:12:15,612 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:12:15,612 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:12:15,612 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:12:15,612 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:12:15,613 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:07:47" (3/4) ... [2018-12-02 08:12:15,615 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 08:12:15,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 08:12:15,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 08:12:15,618 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 08:12:15,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 08:12:15,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 08:12:15,620 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 08:12:15,646 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4ce91d94-c929-43db-88d1-8e5b08ae0606/bin-2019/utaipan/witness.graphml [2018-12-02 08:12:15,646 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:12:15,646 INFO L168 Benchmark]: Toolchain (without parser) took 268854.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -90.7 MB). Peak memory consumption was 101.2 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 133.11 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.15 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: Boogie Preprocessor took 46.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: RCFGBuilder took 168.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,647 INFO L168 Benchmark]: TraceAbstraction took 268453.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,648 INFO L168 Benchmark]: Witness Printer took 33.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-12-02 08:12:15,649 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 133.11 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 947.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.15 ms. Allocated memory is still 1.0 GB. Free memory is still 947.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 947.9 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268453.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 51.4 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * Witness Printer took 33.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 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)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((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, 268.4s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 25.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 35 SDslu, 1179 SDs, 0 SdLazy, 8515 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 681 GetRequests, 283 SyntacticMatches, 61 SemanticMatches, 337 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2402 ImplicationChecksByTransitivity, 263.3s 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.3s AbstIntTime, 2 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, 0.2s SatisfiabilityAnalysisTime, 241.4s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 808 ConstructedInterpolants, 48 QuantifiedInterpolants, 429930 SizeOfPredicates, 10 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 79/713 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...