./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_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:44:42,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:44:42,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:44:42,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:44:42,750 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:44:42,751 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:44:42,752 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:44:42,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:44:42,754 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:44:42,755 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:44:42,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:44:42,756 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:44:42,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:44:42,757 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:44:42,758 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:44:42,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:44:42,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:44:42,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:44:42,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:44:42,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:44:42,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:44:42,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:44:42,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:44:42,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:44:42,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:44:42,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:44:42,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:44:42,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:44:42,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:44:42,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:44:42,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:44:42,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:44:42,770 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:44:42,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:44:42,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:44:42,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:44:42,771 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 14:44:42,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:44:42,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:44:42,782 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:44:42,782 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:44:42,782 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 14:44:42,782 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 14:44:42,782 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 14:44:42,783 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 14:44:42,784 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 14:44:42,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 14:44:42,785 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:44:42,785 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:44:42,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:44:42,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 14:44:42,787 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 14:44:42,787 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_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:44:42,809 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:44:42,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:44:42,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:44:42,818 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:44:42,819 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:44:42,819 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-09 14:44:42,854 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/data/a985d93e9/4fd7a99cd4d44e549898d88c8aa5a820/FLAG5fb408b05 [2018-12-09 14:44:43,233 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:44:43,233 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-09 14:44:43,237 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/data/a985d93e9/4fd7a99cd4d44e549898d88c8aa5a820/FLAG5fb408b05 [2018-12-09 14:44:43,246 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/data/a985d93e9/4fd7a99cd4d44e549898d88c8aa5a820 [2018-12-09 14:44:43,249 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:44:43,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 14:44:43,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:44:43,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:44:43,252 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:44:43,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43, skipping insertion in model container [2018-12-09 14:44:43,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:44:43,268 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:44:43,356 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:44:43,359 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:44:43,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:44:43,379 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:44:43,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43 WrapperNode [2018-12-09 14:44:43,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:44:43,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 14:44:43,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 14:44:43,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 14:44:43,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 14:44:43,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:44:43,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:44:43,392 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:44:43,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... [2018-12-09 14:44:43,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:44:43,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:44:43,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:44:43,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:44:43,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:44:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 14:44:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 14:44:43,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:44:43,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:44:43,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 14:44:43,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 14:44:43,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 14:44:43,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 14:44:43,599 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:44:43,599 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 14:44:43,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:44:43 BoogieIcfgContainer [2018-12-09 14:44:43,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:44:43,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:44:43,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:44:43,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:44:43,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:44:43" (1/3) ... [2018-12-09 14:44:43,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a54f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:44:43, skipping insertion in model container [2018-12-09 14:44:43,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:44:43" (2/3) ... [2018-12-09 14:44:43,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a54f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:44:43, skipping insertion in model container [2018-12-09 14:44:43,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:44:43" (3/3) ... [2018-12-09 14:44:43,604 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-12-09 14:44:43,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:44:43,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 14:44:43,628 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 14:44:43,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:44:43,646 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 14:44:43,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:44:43,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:44:43,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:44:43,647 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:44:43,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:44:43,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:44:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 14:44:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:44:43,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:43,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:44:43,661 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:43,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:43,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-12-09 14:44:43,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:43,729 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-09 14:44:43,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:43,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 14:44:43,730 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:43,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 14:44:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 14:44:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 14:44:43,741 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-09 14:44:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:43,755 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-09 14:44:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 14:44:43,756 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-09 14:44:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:43,761 INFO L225 Difference]: With dead ends: 38 [2018-12-09 14:44:43,761 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 14:44:43,763 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-09 14:44:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 14:44:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 14:44:43,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 14:44:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-12-09 14:44:43,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-12-09 14:44:43,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:43,783 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-12-09 14:44:43,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 14:44:43,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-12-09 14:44:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 14:44:43,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:43,784 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:44:43,785 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:43,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-12-09 14:44:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:43,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:43,853 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-09 14:44:43,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:43,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:43,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:43,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:43,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:44:43,855 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-12-09 14:44:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:43,897 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-12-09 14:44:43,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:43,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 14:44:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:43,899 INFO L225 Difference]: With dead ends: 28 [2018-12-09 14:44:43,899 INFO L226 Difference]: Without dead ends: 23 [2018-12-09 14:44:43,899 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-09 14:44:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-09 14:44:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-09 14:44:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-09 14:44:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-09 14:44:43,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-12-09 14:44:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:43,903 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-09 14:44:43,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-09 14:44:43,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:43,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:43,903 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-09 14:44:43,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:43,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-12-09 14:44:43,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:43,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:43,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:45,961 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-12-09 14:44:45,962 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-09 14:44:45,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:45,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:45,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:45,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:45,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:45,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:44:45,963 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-09 14:44:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:46,023 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-12-09 14:44:46,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:46,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:44:46,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:46,024 INFO L225 Difference]: With dead ends: 50 [2018-12-09 14:44:46,024 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 14:44:46,025 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-09 14:44:46,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 14:44:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 14:44:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 14:44:46,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-09 14:44:46,028 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-12-09 14:44:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:46,029 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-09 14:44:46,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-09 14:44:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:46,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:46,029 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-09 14:44:46,029 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:46,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:46,030 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-12-09 14:44:46,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:46,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:46,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:46,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:46,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:46,172 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-09 14:44:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:44:46,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:44:46,173 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 14:44:46,175 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-09 14:44:46,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 14:44:46,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 14:44:46,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 14:44:46,419 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-09 14:44:46,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:46,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 14:44:46,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:44:46,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:44:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:46,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 14:44:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:46,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:44:46,511 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-09 14:44:46,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:44:47,345 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-09 14:44:47,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:44:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-09 14:44:47,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:44:47,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 14:44:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 14:44:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-09 14:44:47,362 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-12-09 14:44:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:47,504 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-09 14:44:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 14:44:47,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-12-09 14:44:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:47,505 INFO L225 Difference]: With dead ends: 51 [2018-12-09 14:44:47,505 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 14:44:47,506 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-09 14:44:47,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 14:44:47,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-09 14:44:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:44:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-09 14:44:47,511 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-12-09 14:44:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:47,511 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-09 14:44:47,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 14:44:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-09 14:44:47,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:47,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:47,512 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-09 14:44:47,512 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:47,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:47,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-12-09 14:44:47,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:47,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:47,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:47,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:47,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:49,537 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-09 14:44:49,541 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-09 14:44:49,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:49,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:49,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:49,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 14:44:49,542 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-12-09 14:44:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:49,545 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-12-09 14:44:49,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:49,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:44:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:49,546 INFO L225 Difference]: With dead ends: 60 [2018-12-09 14:44:49,546 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 14:44:49,546 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-09 14:44:49,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 14:44:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 14:44:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:44:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-12-09 14:44:49,551 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-12-09 14:44:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:49,551 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-09 14:44:49,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-12-09 14:44:49,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:49,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:49,552 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-09 14:44:49,552 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:49,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-12-09 14:44:49,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:49,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:49,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:49,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:51,578 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-09 14:44:51,581 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-09 14:44:51,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:51,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:51,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:51,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:51,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:51,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 14:44:51,582 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-12-09 14:44:51,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:51,585 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-09 14:44:51,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:51,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:44:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:51,586 INFO L225 Difference]: With dead ends: 60 [2018-12-09 14:44:51,586 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 14:44:51,587 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-09 14:44:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 14:44:51,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 14:44:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:44:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-09 14:44:51,591 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-12-09 14:44:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:51,591 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-09 14:44:51,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-12-09 14:44:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:51,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:51,592 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-09 14:44:51,593 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:51,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-12-09 14:44:51,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:51,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:51,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:51,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:53,619 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-09 14:44:53,622 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-09 14:44:53,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:53,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:53,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:53,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-09 14:44:53,623 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-12-09 14:44:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:53,626 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-12-09 14:44:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:53,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:44:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:53,627 INFO L225 Difference]: With dead ends: 60 [2018-12-09 14:44:53,627 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 14:44:53,627 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-09 14:44:53,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 14:44:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 14:44:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:44:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-09 14:44:53,631 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-09 14:44:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:53,632 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-09 14:44:53,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-09 14:44:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:53,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:53,633 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-09 14:44:53,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:53,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-12-09 14:44:53,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:53,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:53,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:53,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:53,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:44:55,670 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-12-09 14:44:55,671 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-09 14:44:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:44:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:44:55,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:44:55,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:44:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:44:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:44:55,672 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-12-09 14:44:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:44:55,706 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-09 14:44:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:44:55,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 14:44:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:44:55,707 INFO L225 Difference]: With dead ends: 61 [2018-12-09 14:44:55,707 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 14:44:55,708 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-09 14:44:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 14:44:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-09 14:44:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:44:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 14:44:55,711 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-12-09 14:44:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:44:55,711 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 14:44:55,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:44:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 14:44:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 14:44:55,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:44:55,712 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-09 14:44:55,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:44:55,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:44:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-12-09 14:44:55,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:44:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:55,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:44:55,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:44:55,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:44:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:01,882 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-09 14:45:03,894 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-09 14:45:15,988 WARN L180 SmtUtils]: Spent 10.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 19 [2018-12-09 14:45:18,004 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse36 (div c_main_~x~0 2))) (let ((.cse0 (+ .cse36 3)) (.cse1 (+ c_main_~x~0 5))) (and (or (< 0 .cse0) (let ((.cse37 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse36)) (.cse12 (* 2 .cse37)) (.cse34 (* (- 2) .cse37)) (.cse35 (* (- 2) .cse36))) (let ((.cse4 (div (+ c_main_~x~0 .cse35 (- 2)) 4294967296)) (.cse30 (div (+ c_main_~y~0 .cse34 (- 2)) 4294967296)) (.cse6 (div (+ c_main_~x~0 .cse35) 4294967296)) (.cse31 (div (+ c_main_~y~0 .cse34) 4294967296)) (.cse16 (= c_main_~y~0 .cse12)) (.cse7 (= .cse11 c_main_~x~0)) (.cse33 (* 4294967296 (div c_main_~x~0 4294967296))) (.cse32 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse17 (<= .cse32 c_main_~y~0)) (.cse8 (<= .cse33 c_main_~x~0)) (.cse2 (not .cse7)) (.cse3 (< c_main_~x~0 .cse33)) (.cse22 (not .cse16)) (.cse23 (< c_main_~y~0 .cse32)) (.cse21 (* 4294967296 .cse31)) (.cse20 (* 4294967296 .cse6)) (.cse13 (* 4294967296 .cse30)) (.cse10 (* 4294967296 .cse4))) (let ((.cse26 (+ c_main_~y~0 .cse10 .cse11)) (.cse9 (+ .cse12 c_main_~x~0 .cse13)) (.cse25 (+ .cse12 c_main_~x~0 .cse13 2)) (.cse27 (+ c_main_~y~0 .cse10 .cse11 2)) (.cse14 (+ c_main_~y~0 .cse11 .cse20)) (.cse19 (+ .cse12 c_main_~x~0 .cse21)) (.cse18 (and .cse22 .cse23)) (.cse15 (and .cse2 .cse3)) (.cse5 (or .cse7 .cse8)) (.cse24 (or .cse16 .cse17))) (and (<= 0 .cse1) (or (and .cse2 .cse3 (<= (+ .cse4 1) 0)) (and .cse5 (<= (+ .cse6 1) 0)) (and (or (and (or .cse7 .cse8 (< .cse9 (+ c_main_~y~0 .cse10 .cse11 1))) (or (< (+ .cse12 c_main_~x~0 .cse13 1) .cse14) .cse15)) .cse16 .cse17) (or .cse18 (and (or .cse15 (< .cse19 (+ c_main_~y~0 .cse11 .cse20 1))) (or (< .cse19 (+ c_main_~y~0 .cse10 .cse11 3)) .cse7 .cse8)))) (and (or (< (+ .cse12 .cse13 2) c_main_~y~0) .cse16 .cse17) (or .cse18 (< (+ .cse12 .cse21) c_main_~y~0))) (and (<= (+ .cse12 .cse13 3) c_main_~y~0) .cse22 .cse23) (and .cse24 (<= (+ .cse12 .cse21 1) c_main_~y~0)) (and (or (and (or (< .cse25 .cse14) .cse15) (or (< .cse9 .cse26) .cse7 .cse8)) .cse16 .cse17) (or .cse18 (and (or .cse7 .cse8 (< .cse19 .cse27)) (or (< .cse19 .cse14) .cse15))))) (or (and .cse22 .cse23 (or (and (<= .cse26 .cse9) .cse2 .cse3) (and .cse5 (<= .cse14 .cse25)))) (and (or (and .cse2 (<= .cse27 .cse19) .cse3) (and .cse5 (<= .cse14 .cse19))) .cse24) (and (or (< 0 .cse6) .cse15) (or (< 0 .cse4) .cse7 .cse8)) (let ((.cse29 (+ .cse30 1)) (.cse28 (+ .cse31 1))) (and (or (and (or .cse18 (and (or .cse15 (< .cse6 .cse28)) (or (< .cse4 .cse28) .cse7 .cse8))) (or (and (or (< .cse6 .cse29) .cse15) (or .cse7 (< .cse4 .cse29) .cse8)) .cse16 .cse17)) (and .cse22 .cse23 (<= 0 .cse30)) (and (<= 0 .cse31) .cse24)) (or (and (<= c_main_~y~0 (+ .cse12 3)) .cse22 .cse23) (and (or (and .cse5 (<= .cse29 .cse6)) (and .cse2 (<= .cse29 .cse4) .cse3)) .cse22 .cse23) (and (<= c_main_~y~0 (+ .cse12 1)) .cse24) (and (or (and .cse2 (<= .cse28 .cse4) .cse3) (and .cse5 (<= .cse28 .cse6))) .cse24) (<= c_main_~x~0 .cse11)))))))))))) (or (<= .cse0 0) (<= .cse1 0))))) is different from false [2018-12-09 14:45:26,161 WARN L180 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 170 DAG size of output: 21 [2018-12-09 14:45:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-09 14:45:26,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:26,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:45:26,177 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-09 14:45:26,177 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-09 14:45:26,178 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 14:45:26,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 14:45:26,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 14:45:26,244 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-09 14:45:26,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:45:26,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 14:45:26,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:26,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:45:26,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:45:26,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 14:45:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:26,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:45:26,429 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-09 14:45:26,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:45:26,536 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-09 14:45:26,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:45:26,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 19 [2018-12-09 14:45:26,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:45:26,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 14:45:26,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 14:45:26,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=201, Unknown=6, NotChecked=90, Total=342 [2018-12-09 14:45:26,553 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2018-12-09 14:45:28,630 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)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-09 14:45:30,645 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-09 14:45:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:45:30,700 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-09 14:45:30,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 14:45:30,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-09 14:45:30,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:45:30,701 INFO L225 Difference]: With dead ends: 62 [2018-12-09 14:45:30,701 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 14:45:30,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=55, Invalid=229, Unknown=8, NotChecked=170, Total=462 [2018-12-09 14:45:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 14:45:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 14:45:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 14:45:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-09 14:45:30,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-12-09 14:45:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:45:30,703 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-09 14:45:30,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 14:45:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-09 14:45:30,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 14:45:30,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:45:30,704 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-09 14:45:30,704 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:45:30,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:45:30,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-12-09 14:45:30,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:45:30,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:30,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:45:30,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:30,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:45:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:30,914 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-09 14:45:30,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:30,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:45:30,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 14:45:30,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 14:45:30,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:30,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:45:30,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 14:45:30,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 14:45:30,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 14:45:30,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 14:45:30,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:45:30,962 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-09 14:45:30,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:45:33,974 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-09 14:45:33,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:45:33,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-09 14:45:33,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:45:33,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 14:45:33,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 14:45:33,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 14:45:33,990 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-12-09 14:45:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:45:34,179 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-09 14:45:34,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 14:45:34,180 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-12-09 14:45:34,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:45:34,180 INFO L225 Difference]: With dead ends: 50 [2018-12-09 14:45:34,180 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 14:45:34,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 14:45:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 14:45:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-09 14:45:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 14:45:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-09 14:45:34,184 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-12-09 14:45:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:45:34,184 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-09 14:45:34,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 14:45:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-09 14:45:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 14:45:34,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:45:34,185 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-09 14:45:34,185 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:45:34,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:45:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-12-09 14:45:34,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:45:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:34,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:45:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:34,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:45:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:34,578 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-09 14:45:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:34,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:45:34,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 14:45:34,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 14:45:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:34,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:45:34,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 14:45:34,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 14:45:34,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 14:45:34,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 14:45:34,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:45:34,628 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-09 14:45:34,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:45:37,693 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-09 14:45:37,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:45:37,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-09 14:45:37,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:45:37,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-09 14:45:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-09 14:45:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-12-09 14:45:37,710 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-12-09 14:45:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:45:38,082 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-09 14:45:38,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 14:45:38,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-12-09 14:45:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:45:38,083 INFO L225 Difference]: With dead ends: 61 [2018-12-09 14:45:38,083 INFO L226 Difference]: Without dead ends: 56 [2018-12-09 14:45:38,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-12-09 14:45:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-09 14:45:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-09 14:45:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 14:45:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-09 14:45:38,086 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-12-09 14:45:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:45:38,086 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-09 14:45:38,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-09 14:45:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-09 14:45:38,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 14:45:38,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:45:38,087 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-09 14:45:38,087 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:45:38,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:45:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-12-09 14:45:38,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:45:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:38,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 14:45:38,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:38,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:45:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:38,764 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-09 14:45:38,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:38,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:45:38,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 14:45:38,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 14:45:38,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:45:38,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:45:38,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:45:38,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 14:45:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:38,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:45:38,834 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-09 14:45:38,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:45:41,107 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-09 14:45:41,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:45:41,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-09 14:45:41,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:45:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 14:45:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 14:45:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-12-09 14:45:41,133 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-12-09 14:45:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:45:41,754 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-09 14:45:41,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-09 14:45:41,754 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-12-09 14:45:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:45:41,754 INFO L225 Difference]: With dead ends: 72 [2018-12-09 14:45:41,754 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 14:45:41,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-12-09 14:45:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 14:45:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-09 14:45:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 14:45:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-09 14:45:41,758 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-12-09 14:45:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:45:41,758 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-09 14:45:41,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 14:45:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-09 14:45:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 14:45:41,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:45:41,759 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-09 14:45:41,759 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:45:41,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:45:41,759 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-12-09 14:45:41,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:45:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:41,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:45:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:45:41,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:45:41,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:45:43,875 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 ((.cse3 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse4 (not .cse7)) (.cse5 (< c_main_~y~0 .cse8)) (.cse2 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= (+ .cse0 c_main_~x~0 .cse1) (+ c_main_~y~0 4)) .cse2) (and (<= (+ .cse0 c_main_~x~0 .cse3) (+ c_main_~y~0 2)) .cse4 .cse5)) (<= 4 c_main_~x~0) (or (and (= (+ .cse0 .cse3 2) c_main_~y~0) .cse4 .cse5) (and .cse2 (= (+ .cse0 .cse1) c_main_~y~0)))))))) is different from true [2018-12-09 14:45:47,958 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:45:52,081 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:45:54,135 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:45:58,202 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:02,271 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:06,337 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:08,400 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:12,472 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:14,546 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:20,646 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:24,730 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:28,817 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:32,903 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:37,002 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:43,114 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:45,210 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:49,330 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:53,443 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:46:57,557 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:03,678 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:07,786 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:11,908 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:14,004 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:16,256 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:20,404 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:22,516 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:28,650 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:32,795 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:34,909 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:39,071 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:43,216 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:47,357 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:49,627 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:51,763 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:54,025 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:47:58,675 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:48:02,836 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:48:06,999 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-09 14:48:09,010 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse29 (div c_main_~x~0 2))) (and (let ((.cse7 (* 2 .cse29)) (.cse31 (* 4294967296 (div c_main_~x~0 4294967296)))) (let ((.cse4 (<= .cse31 c_main_~x~0)) (.cse30 (* (- 2) .cse29)) (.cse3 (= .cse7 c_main_~x~0))) (let ((.cse0 (not .cse3)) (.cse1 (< c_main_~x~0 .cse31)) (.cse2 (div (+ c_main_~x~0 .cse30 (- 2)) 4294967296)) (.cse23 (or .cse3 .cse4)) (.cse27 (div (+ c_main_~x~0 .cse30) 4294967296))) (or (and .cse0 .cse1 (<= (+ .cse2 1) 0)) (let ((.cse28 (div c_main_~y~0 2))) (let ((.cse26 (* (- 2) .cse28)) (.cse25 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse8 (* 2 .cse28))) (let ((.cse12 (= c_main_~y~0 .cse8)) (.cse13 (<= .cse25 c_main_~y~0)) (.cse24 (* 4294967296 (div (+ c_main_~y~0 .cse26) 4294967296))) (.cse16 (* 4294967296 .cse27)) (.cse9 (* 4294967296 (div (+ c_main_~y~0 .cse26 (- 2)) 4294967296))) (.cse6 (* 4294967296 .cse2))) (let ((.cse21 (+ c_main_~y~0 .cse6 .cse7)) (.cse5 (+ .cse8 c_main_~x~0 .cse9)) (.cse20 (+ .cse8 c_main_~x~0 .cse9 2)) (.cse22 (+ c_main_~y~0 .cse6 .cse7 2)) (.cse10 (+ c_main_~y~0 .cse7 .cse16)) (.cse15 (+ .cse8 c_main_~x~0 .cse24)) (.cse17 (or .cse12 .cse13)) (.cse18 (not .cse12)) (.cse19 (< c_main_~y~0 .cse25))) (and (let ((.cse14 (and .cse18 .cse19)) (.cse11 (and .cse0 .cse1))) (or (and (or (and (or .cse3 .cse4 (< .cse5 (+ c_main_~y~0 .cse6 .cse7 1))) (or (< (+ .cse8 c_main_~x~0 .cse9 1) .cse10) .cse11)) .cse12 .cse13) (or .cse14 (and (or .cse11 (< .cse15 (+ c_main_~y~0 .cse7 .cse16 1))) (or (< .cse15 (+ c_main_~y~0 .cse6 .cse7 3)) .cse3 .cse4)))) (and (<= .cse15 (+ c_main_~y~0 100)) .cse17) (and (<= .cse5 (+ c_main_~y~0 98)) .cse18 .cse19) (and (or (and (or (< .cse20 .cse10) .cse11) (or (< .cse5 .cse21) .cse3 .cse4)) .cse12 .cse13) (or .cse14 (and (or .cse3 .cse4 (< .cse15 .cse22)) (or (< .cse15 .cse10) .cse11)))))) (or (and .cse18 .cse19 (or (and (<= .cse21 .cse5) .cse0 .cse1) (and .cse23 (<= .cse10 .cse20)))) (and (or (and .cse0 (<= .cse22 .cse15) .cse1) (and .cse23 (<= .cse10 .cse15))) .cse17) (and (<= c_main_~y~0 (+ .cse8 .cse24)) .cse17) (and .cse18 .cse19 (<= c_main_~y~0 (+ .cse8 .cse9 2))))))))) (<= .cse29 49) (and .cse23 (<= (+ .cse27 1) 0)))))) (or (< 49 .cse29) (<= 100 c_main_~x~0)))) is different from false [2018-12-09 14:48:45,515 WARN L180 SmtUtils]: Spent 12.15 s on a formula simplification. DAG size of input: 122 DAG size of output: 27 [2018-12-09 14:48:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2018-12-09 14:48:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:48:45,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 14:48:45,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 14:48:45,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 14:48:45,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 14:48:45,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/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-09 14:48:45,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 14:48:45,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 14:48:45,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-09 14:48:45,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 14:48:45,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 14:48:48,164 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-09 14:48:48,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 14:48:53,640 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-09 14:48:53,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 14:48:53,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 6] total 101 [2018-12-09 14:48:53,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 14:48:53,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-09 14:48:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-09 14:48:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=9315, Unknown=14, NotChecked=390, Total=10100 [2018-12-09 14:48:53,658 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 97 states. [2018-12-09 14:48:55,774 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 ((.cse3 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse4 (not .cse7)) (.cse5 (< c_main_~y~0 .cse8)) (.cse2 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= (+ .cse0 c_main_~x~0 .cse1) (+ c_main_~y~0 4)) .cse2) (and (<= (+ .cse0 c_main_~x~0 .cse3) (+ c_main_~y~0 2)) .cse4 .cse5)) (<= 4 c_main_~x~0) (<= c_main_~x~0 4) (or (and (= (+ .cse0 .cse3 2) c_main_~y~0) .cse4 .cse5) (and .cse2 (= (+ .cse0 .cse1) c_main_~y~0)))))))) is different from true [2018-12-09 14:48:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:48:59,501 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-09 14:48:59,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-09 14:48:59,501 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 65 [2018-12-09 14:48:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:48:59,501 INFO L225 Difference]: With dead ends: 80 [2018-12-09 14:48:59,502 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 14:48:59,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 43 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 195.9s TimeCoverageRelationStatistics Valid=389, Invalid=9508, Unknown=15, NotChecked=594, Total=10506 [2018-12-09 14:48:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 14:48:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 14:48:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 14:48:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 14:48:59,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-12-09 14:48:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:48:59,503 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 14:48:59,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-09 14:48:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 14:48:59,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 14:48:59,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 14:48:59,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 14:48:59,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:48:59,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:48:59,594 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 14:48:59,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 14:48:59,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 14:48:59,594 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-09 14:48:59,594 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,594 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 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-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-12-09 14:48:59,595 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-12-09 14:48:59,595 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-09 14:48:59,596 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-09 14:48:59,596 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-09 14:48:59,596 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-09 14:48:59,596 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-09 14:48:59,596 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-09 14:48:59,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:48:59 BoogieIcfgContainer [2018-12-09 14:48:59,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:48:59,605 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:48:59,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:48:59,606 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:48:59,606 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:44:43" (3/4) ... [2018-12-09 14:48:59,608 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 14:48:59,611 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 14:48:59,612 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 14:48:59,612 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 14:48:59,614 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 14:48:59,614 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 14:48:59,614 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 14:48:59,639 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cda961b-8fff-4770-8f6b-075ebe6c4889/bin-2019/utaipan/witness.graphml [2018-12-09 14:48:59,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:48:59,640 INFO L168 Benchmark]: Toolchain (without parser) took 256391.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.4 MB in the beginning and 994.7 MB in the end (delta: -42.3 MB). Peak memory consumption was 85.6 MB. Max. memory is 11.5 GB. [2018-12-09 14:48:59,640 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:48:59,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:48:59,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.15 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:48:59,641 INFO L168 Benchmark]: Boogie Preprocessor took 43.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-09 14:48:59,641 INFO L168 Benchmark]: RCFGBuilder took 163.80 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: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-12-09 14:48:59,642 INFO L168 Benchmark]: TraceAbstraction took 256005.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.7 MB). Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 108.9 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2018-12-09 14:48:59,642 INFO L168 Benchmark]: Witness Printer took 33.94 ms. Allocated memory is still 1.2 GB. Free memory is still 994.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:48:59,643 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.35 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.15 ms. Allocated memory is still 1.0 GB. Free memory is still 941.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.80 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: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 256005.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.7 MB). Free memory was 1.1 GB in the beginning and 994.7 MB in the end (delta: 108.9 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. * Witness Printer took 33.94 ms. Allocated memory is still 1.2 GB. Free memory is still 994.7 MB. There was no memory consumed. 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, 255.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 35 SDslu, 1200 SDs, 0 SdLazy, 8436 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 682 GetRequests, 280 SyntacticMatches, 63 SemanticMatches, 339 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 251.1s 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, 243.4s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 808 ConstructedInterpolants, 48 QuantifiedInterpolants, 514490 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...