./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-aa41828 [2018-11-23 08:10:59,915 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 08:10:59,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 08:10:59,925 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 08:10:59,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 08:10:59,926 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 08:10:59,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 08:10:59,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 08:10:59,930 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 08:10:59,931 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 08:10:59,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 08:10:59,932 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 08:10:59,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 08:10:59,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 08:10:59,933 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 08:10:59,934 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 08:10:59,935 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 08:10:59,936 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 08:10:59,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 08:10:59,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 08:10:59,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 08:10:59,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 08:10:59,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 08:10:59,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 08:10:59,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 08:10:59,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 08:10:59,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 08:10:59,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 08:10:59,945 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 08:10:59,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 08:10:59,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 08:10:59,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 08:10:59,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 08:10:59,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 08:10:59,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 08:10:59,949 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 08:10:59,949 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 08:10:59,961 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 08:10:59,962 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 08:10:59,963 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 08:10:59,963 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 08:10:59,963 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 08:10:59,963 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 08:10:59,963 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 08:10:59,964 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 08:10:59,964 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 08:10:59,964 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 08:10:59,964 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 08:10:59,964 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 08:10:59,965 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 08:10:59,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 08:10:59,965 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 08:10:59,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 08:10:59,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 08:10:59,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 08:10:59,968 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 08:10:59,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 08:10:59,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 08:10:59,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 08:10:59,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 08:10:59,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 08:10:59,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 08:10:59,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 08:10:59,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 08:10:59,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 08:10:59,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 08:10:59,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 08:10:59,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 08:10:59,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 08:10:59,971 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_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:10:59,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 08:11:00,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 08:11:00,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 08:11:00,012 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 08:11:00,013 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 08:11:00,013 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-23 08:11:00,067 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/data/fb0a55ecf/dfdb8050d4a14de89cf3209841a5e115/FLAG27faaadd3 [2018-11-23 08:11:00,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 08:11:00,412 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-23 08:11:00,416 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/data/fb0a55ecf/dfdb8050d4a14de89cf3209841a5e115/FLAG27faaadd3 [2018-11-23 08:11:00,427 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/data/fb0a55ecf/dfdb8050d4a14de89cf3209841a5e115 [2018-11-23 08:11:00,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 08:11:00,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 08:11:00,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:00,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 08:11:00,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 08:11:00,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd21f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00, skipping insertion in model container [2018-11-23 08:11:00,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 08:11:00,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 08:11:00,607 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:00,609 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 08:11:00,623 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 08:11:00,634 INFO L195 MainTranslator]: Completed translation [2018-11-23 08:11:00,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00 WrapperNode [2018-11-23 08:11:00,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 08:11:00,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:00,635 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 08:11:00,635 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 08:11:00,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 08:11:00,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 08:11:00,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 08:11:00,649 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 08:11:00,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... [2018-11-23 08:11:00,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 08:11:00,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 08:11:00,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 08:11:00,666 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 08:11:00,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:11:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 08:11:00,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 08:11:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 08:11:00,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 08:11:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 08:11:00,753 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 08:11:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 08:11:00,754 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 08:11:00,918 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 08:11:00,919 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 08:11:00,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:00 BoogieIcfgContainer [2018-11-23 08:11:00,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 08:11:00,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 08:11:00,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 08:11:00,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 08:11:00,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:11:00" (1/3) ... [2018-11-23 08:11:00,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54610f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:00, skipping insertion in model container [2018-11-23 08:11:00,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:11:00" (2/3) ... [2018-11-23 08:11:00,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54610f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:11:00, skipping insertion in model container [2018-11-23 08:11:00,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:00" (3/3) ... [2018-11-23 08:11:00,926 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-23 08:11:00,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 08:11:00,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 08:11:00,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 08:11:00,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 08:11:00,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 08:11:00,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 08:11:00,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 08:11:00,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 08:11:00,973 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 08:11:00,973 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 08:11:00,973 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 08:11:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 08:11:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:11:00,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:00,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:00,990 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:00,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:00,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-23 08:11:00,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:01,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:01,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:01,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 08:11:01,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:01,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 08:11:01,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 08:11:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:11:01,083 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 08:11:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:01,097 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-23 08:11:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 08:11:01,099 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 08:11:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:01,104 INFO L225 Difference]: With dead ends: 38 [2018-11-23 08:11:01,105 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 08:11:01,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 08:11:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 08:11:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 08:11:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 08:11:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-23 08:11:01,140 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-23 08:11:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:01,140 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-23 08:11:01,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 08:11:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-23 08:11:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 08:11:01,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:01,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:01,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:01,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-23 08:11:01,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:01,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:01,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:01,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:01,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:01,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:01,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:01,229 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-23 08:11:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:01,274 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-23 08:11:01,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:01,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 08:11:01,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:01,276 INFO L225 Difference]: With dead ends: 28 [2018-11-23 08:11:01,277 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 08:11:01,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 08:11:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 08:11:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 08:11:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-23 08:11:01,281 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-23 08:11:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:01,281 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 08:11:01,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-23 08:11:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:01,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:01,282 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:01,283 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:01,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:01,286 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-23 08:11:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:01,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:01,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:01,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:03,371 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-11-23 08:11:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:03,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:03,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:03,376 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:03,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:03,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:03,377 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-23 08:11:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:03,467 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-23 08:11:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:03,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:11:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:03,468 INFO L225 Difference]: With dead ends: 50 [2018-11-23 08:11:03,469 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 08:11:03,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 08:11:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 08:11:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 08:11:03,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-23 08:11:03,475 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-23 08:11:03,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:03,476 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-23 08:11:03,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-23 08:11:03,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:03,477 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:03,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:03,477 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:03,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-23 08:11:03,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:03,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:03,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:03,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:03,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:03,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:03,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:11:03,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-23 08:11:03,775 INFO L202 CegarAbsIntRunner]: [0], [4], [11], [13], [16], [22], [28], [34], [40], [46], [52], [58], [64], [70], [79], [82], [84], [90], [91], [92], [94] [2018-11-23 08:11:03,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:11:03,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:11:04,088 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:11:04,089 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-11-23 08:11:04,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:04,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:11:04,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:04,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:11:04,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:04,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:11:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:04,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:11:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:04,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:11:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:05,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:11:05,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-23 08:11:05,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:11:05,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 08:11:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 08:11:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:11:05,214 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-11-23 08:11:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:05,389 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-23 08:11:05,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 08:11:05,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 08:11:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:05,390 INFO L225 Difference]: With dead ends: 51 [2018-11-23 08:11:05,390 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 08:11:05,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-11-23 08:11:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 08:11:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-23 08:11:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:11:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-23 08:11:05,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-23 08:11:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:05,397 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-23 08:11:05,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 08:11:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-23 08:11:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:05,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:05,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:05,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:05,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-11-23 08:11:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:05,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:07,430 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 08:11:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:07,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:07,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:07,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:07,435 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-23 08:11:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:07,440 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 08:11:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:11:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:07,441 INFO L225 Difference]: With dead ends: 60 [2018-11-23 08:11:07,441 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 08:11:07,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 08:11:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 08:11:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:11:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-23 08:11:07,447 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-11-23 08:11:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:07,447 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-23 08:11:07,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-23 08:11:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:07,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:07,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:07,449 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:07,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:07,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-11-23 08:11:07,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:07,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:07,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:09,480 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 08:11:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:09,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:09,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:09,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:09,485 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-23 08:11:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:09,487 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 08:11:09,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:09,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:11:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:09,488 INFO L225 Difference]: With dead ends: 60 [2018-11-23 08:11:09,488 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 08:11:09,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 08:11:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 08:11:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:11:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-23 08:11:09,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-11-23 08:11:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:09,493 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-23 08:11:09,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-23 08:11:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:09,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:09,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:09,494 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:09,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-11-23 08:11:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:09,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:09,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:11,527 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-11-23 08:11:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:11,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:11,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:11,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:11,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:11,532 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-23 08:11:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:11,535 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-23 08:11:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:11,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:11:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:11,536 INFO L225 Difference]: With dead ends: 60 [2018-11-23 08:11:11,537 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 08:11:11,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-23 08:11:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 08:11:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 08:11:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:11:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 08:11:11,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-23 08:11:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:11,543 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 08:11:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 08:11:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:11,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:11,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:11,544 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:11,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-11-23 08:11:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:11,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:11,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:11,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 08:11:11,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 08:11:11,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 08:11:11,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 08:11:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 08:11:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:11,600 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-23 08:11:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:11,660 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 08:11:11,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 08:11:11,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 08:11:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:11,661 INFO L225 Difference]: With dead ends: 61 [2018-11-23 08:11:11,661 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 08:11:11,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 08:11:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 08:11:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 08:11:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:11:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 08:11:11,665 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-11-23 08:11:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:11,665 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 08:11:11,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 08:11:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 08:11:11,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 08:11:11,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:11,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:11,666 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:11,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-23 08:11:11,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:11,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:11,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:17,892 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2018-11-23 08:11:19,910 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-11-23 08:11:34,024 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-11-23 08:11:36,037 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-23 08:11:38,064 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-11-23 08:11:48,264 WARN L180 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 170 DAG size of output: 21 [2018-11-23 08:11:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 08:11:48,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:48,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:11:48,285 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-23 08:11:48,286 INFO L202 CegarAbsIntRunner]: [0], [4], [11], [13], [18], [24], [30], [36], [42], [48], [54], [60], [66], [72], [79], [82], [84], [90], [91], [92], [94] [2018-11-23 08:11:48,287 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 08:11:48,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 08:11:48,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 08:11:48,378 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-11-23 08:11:48,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:48,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 08:11:48,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:48,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:11:48,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:48,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:11:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:48,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:11:48,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:48,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:11:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:48,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:11:48,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6] total 19 [2018-11-23 08:11:48,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:11:48,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 08:11:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 08:11:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=199, Unknown=8, NotChecked=90, Total=342 [2018-11-23 08:11:48,755 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2018-11-23 08:11:58,938 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-23 08:11:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:11:59,003 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 08:11:59,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 08:11:59,004 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 08:11:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:11:59,004 INFO L225 Difference]: With dead ends: 62 [2018-11-23 08:11:59,004 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 08:11:59,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=53, Invalid=226, Unknown=9, NotChecked=132, Total=420 [2018-11-23 08:11:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 08:11:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 08:11:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 08:11:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 08:11:59,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-11-23 08:11:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:11:59,007 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 08:11:59,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 08:11:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 08:11:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 08:11:59,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:11:59,008 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:11:59,009 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:11:59,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:11:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-11-23 08:11:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:11:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:11:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:11:59,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:11:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:11:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:59,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:59,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:11:59,267 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:11:59,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:11:59,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:11:59,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:11:59,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:11:59,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:11:59,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 08:11:59,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:11:59,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:11:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:11:59,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:12:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:02,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:12:02,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-11-23 08:12:02,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:12:02,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 08:12:02,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 08:12:02,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 08:12:02,499 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-23 08:12:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:12:02,734 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-23 08:12:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 08:12:02,735 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-23 08:12:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:12:02,735 INFO L225 Difference]: With dead ends: 50 [2018-11-23 08:12:02,735 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 08:12:02,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 08:12:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 08:12:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 08:12:02,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 08:12:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-23 08:12:02,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-11-23 08:12:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:12:02,740 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-23 08:12:02,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 08:12:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 08:12:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 08:12:02,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:12:02,741 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:12:02,742 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:12:02,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:12:02,742 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-11-23 08:12:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:12:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:02,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:12:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:02,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:12:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:12:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:03,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:12:03,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:12:03,198 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:12:03,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:12:03,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:12:03,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:12:03,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 08:12:03,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 08:12:03,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 08:12:03,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:12:03,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:12:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:03,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:12:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:06,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:12:06,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-11-23 08:12:06,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:12:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 08:12:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 08:12:06,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 08:12:06,889 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-11-23 08:12:07,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:12:07,286 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 08:12:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 08:12:07,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-23 08:12:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:12:07,287 INFO L225 Difference]: With dead ends: 61 [2018-11-23 08:12:07,288 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 08:12:07,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1073, Invalid=3087, Unknown=0, NotChecked=0, Total=4160 [2018-11-23 08:12:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 08:12:07,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 08:12:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 08:12:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-23 08:12:07,293 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-11-23 08:12:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:12:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-23 08:12:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 08:12:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-23 08:12:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 08:12:07,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:12:07,294 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:12:07,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:12:07,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:12:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-11-23 08:12:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:12:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:07,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 08:12:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:07,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:12:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:12:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:12:08,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:12:08,153 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:12:08,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:12:08,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:12:08,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:12:08,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:12:08,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 08:12:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:12:08,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:12:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:08,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:12:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:12:10,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:12:10,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-11-23 08:12:10,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:12:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 08:12:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 08:12:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 08:12:10,921 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-11-23 08:12:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:12:11,878 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-23 08:12:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 08:12:11,879 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-11-23 08:12:11,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:12:11,879 INFO L225 Difference]: With dead ends: 72 [2018-11-23 08:12:11,879 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 08:12:11,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1403, Invalid=5737, Unknown=0, NotChecked=0, Total=7140 [2018-11-23 08:12:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 08:12:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 08:12:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 08:12:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-23 08:12:11,884 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-11-23 08:12:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:12:11,885 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-23 08:12:11,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 08:12:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 08:12:11,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 08:12:11,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 08:12:11,886 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 08:12:11,886 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 08:12:11,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 08:12:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-11-23 08:12:11,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 08:12:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:11,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 08:12:11,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 08:12:11,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 08:12:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 08:12:14,135 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:18,202 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:22,373 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:26,448 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:28,527 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:30,731 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:36,825 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:38,901 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:47,012 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:49,173 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:51,273 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:12:55,390 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:01,514 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:03,624 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:11,764 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:15,878 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:17,988 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:22,110 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:26,227 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:30,364 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:34,488 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:38,628 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:42,779 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:46,924 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:51,058 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:53,181 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:57,485 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:13:59,638 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:05,815 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:07,950 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:16,121 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:22,301 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:24,444 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:30,634 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:34,790 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:37,103 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:41,278 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:45,470 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:51,660 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:14:55,835 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-23 08:15:22,360 WARN L180 SmtUtils]: Spent 14.18 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2018-11-23 08:15:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:15:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:40,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 08:15:40,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 08:15:40,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 08:15:40,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 08:15:40,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/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-11-23 08:15:40,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 08:15:40,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 08:15:40,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 08:15:40,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 08:15:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 08:15:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 08:15:43,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 08:15:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-23 08:15:49,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 08:15:49,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6] total 100 [2018-11-23 08:15:49,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 08:15:49,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 08:15:49,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 08:15:49,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9512, Unknown=6, NotChecked=0, Total=9900 [2018-11-23 08:15:49,354 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 96 states. [2018-11-23 08:15:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 08:15:51,077 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-23 08:15:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 08:15:51,077 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 65 [2018-11-23 08:15:51,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 08:15:51,077 INFO L225 Difference]: With dead ends: 80 [2018-11-23 08:15:51,077 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 08:15:51,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 43 SyntacticMatches, 44 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 217.1s TimeCoverageRelationStatistics Valid=388, Invalid=9706, Unknown=6, NotChecked=0, Total=10100 [2018-11-23 08:15:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 08:15:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 08:15:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 08:15:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 08:15:51,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-11-23 08:15:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 08:15:51,080 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 08:15:51,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 08:15:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 08:15:51,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 08:15:51,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 08:15:51,189 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 08:15:51,190 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 08:15:51,190 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-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,190 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-23 08:15:51,191 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 08:15:51,191 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 08:15:51,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:15:51 BoogieIcfgContainer [2018-11-23 08:15:51,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 08:15:51,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 08:15:51,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 08:15:51,204 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 08:15:51,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:11:00" (3/4) ... [2018-11-23 08:15:51,208 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 08:15:51,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 08:15:51,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 08:15:51,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 08:15:51,215 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 08:15:51,215 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 08:15:51,215 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 08:15:51,249 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6682550c-36f4-4380-8b76-0e4a7c879761/bin-2019/utaipan/witness.graphml [2018-11-23 08:15:51,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 08:15:51,250 INFO L168 Benchmark]: Toolchain (without parser) took 290820.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 960.2 MB in the beginning and 937.2 MB in the end (delta: 23.0 MB). Peak memory consumption was 219.1 MB. Max. memory is 11.5 GB. [2018-11-23 08:15:51,251 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:15:51,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:15:51,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.36 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 08:15:51,252 INFO L168 Benchmark]: Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:15:51,252 INFO L168 Benchmark]: RCFGBuilder took 253.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:15:51,252 INFO L168 Benchmark]: TraceAbstraction took 290284.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 937.2 MB in the end (delta: 188.1 MB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. [2018-11-23 08:15:51,253 INFO L168 Benchmark]: Witness Printer took 45.28 ms. Allocated memory is still 1.2 GB. Free memory is still 937.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 08:15:51,258 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.36 ms. Allocated memory is still 1.0 GB. Free memory was 949.5 MB in the beginning and 946.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.52 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 290284.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.1 GB in the beginning and 937.2 MB in the end (delta: 188.1 MB). Peak memory consumption was 238.4 MB. Max. memory is 11.5 GB. * Witness Printer took 45.28 ms. Allocated memory is still 1.2 GB. Free memory is still 937.2 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, 290.2s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 35 SDslu, 1184 SDs, 0 SdLazy, 8572 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 282 SyntacticMatches, 62 SemanticMatches, 336 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 284.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s 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.3s SatisfiabilityAnalysisTime, 274.9s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 808 ConstructedInterpolants, 48 QuantifiedInterpolants, 448778 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...