./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/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 f756365182c9801d4a2ac186a40692687a86b469 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/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 f756365182c9801d4a2ac186a40692687a86b469 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:00:29,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:00:29,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:00:29,427 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:00:29,427 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:00:29,428 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:00:29,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:00:29,429 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:00:29,430 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:00:29,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:00:29,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:00:29,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:00:29,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:00:29,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:00:29,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:00:29,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:00:29,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:00:29,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:00:29,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:00:29,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:00:29,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:00:29,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:00:29,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:00:29,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:00:29,438 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:00:29,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:00:29,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:00:29,439 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:00:29,439 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:00:29,440 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:00:29,440 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:00:29,440 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:00:29,440 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:00:29,440 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:00:29,441 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:00:29,441 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:00:29,441 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 17:00:29,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:00:29,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:00:29,449 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:00:29,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 17:00:29,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:00:29,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:00:29,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:00:29,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:00:29,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:00:29,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:00:29,452 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 17:00:29,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:00:29,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 17:00:29,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 17:00:29,452 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_4666e7de-00d5-49b6-ae3e-132e56424742/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 -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-08 17:00:29,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:00:29,475 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:00:29,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:00:29,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:00:29,478 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:00:29,478 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:29,517 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/d83688013/bf5bff81804349a088eeb774474d7e46/FLAGd88f214eb [2018-12-08 17:00:29,822 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:00:29,823 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:29,827 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/d83688013/bf5bff81804349a088eeb774474d7e46/FLAGd88f214eb [2018-12-08 17:00:29,835 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/d83688013/bf5bff81804349a088eeb774474d7e46 [2018-12-08 17:00:29,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:00:29,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:00:29,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:00:29,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:00:29,841 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:00:29,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:00:29" (1/1) ... [2018-12-08 17:00:29,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550eb617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:29, skipping insertion in model container [2018-12-08 17:00:29,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:00:29" (1/1) ... [2018-12-08 17:00:29,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:00:29,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:00:29,966 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:00:29,968 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:00:29,992 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:00:30,031 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:00:30,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30 WrapperNode [2018-12-08 17:00:30,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:00:30,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:00:30,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:00:30,032 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:00:30,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:00:30,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:00:30,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:00:30,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:00:30,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... [2018-12-08 17:00:30,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:00:30,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:00:30,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:00:30,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:00:30,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:00:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:00:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:00:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-08 17:00:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-08 17:00:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:00:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:00:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:00:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:00:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-08 17:00:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-08 17:00:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 17:00:30,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 17:00:30,288 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:00:30,288 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:00:30,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:30 BoogieIcfgContainer [2018-12-08 17:00:30,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:00:30,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:00:30,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:00:30,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:00:30,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:00:29" (1/3) ... [2018-12-08 17:00:30,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32030ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:00:30, skipping insertion in model container [2018-12-08 17:00:30,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:30" (2/3) ... [2018-12-08 17:00:30,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32030ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:00:30, skipping insertion in model container [2018-12-08 17:00:30,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:30" (3/3) ... [2018-12-08 17:00:30,292 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:30,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:00:30,302 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:00:30,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:00:30,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:00:30,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:00:30,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:00:30,329 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:00:30,329 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:00:30,329 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:00:30,329 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:00:30,329 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:00:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-08 17:00:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:00:30,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:30,346 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:30,347 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:30,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-08 17:00:30,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:30,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:30,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:30,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:30,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:30,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:30,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:30,536 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-08 17:00:30,538 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [67], [69], [71], [73], [76], [89], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:30,565 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:30,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:30,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 17:00:30,642 INFO L272 AbstractInterpreter]: Visited 19 different actions 27 times. Never merged. Never widened. Performed 71 root evaluator evaluations with a maximum evaluation depth of 3. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-12-08 17:00:30,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:30,648 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 17:00:30,694 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 68.83% of their original sizes. [2018-12-08 17:00:30,694 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 17:00:30,761 INFO L418 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-12-08 17:00:30,761 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 17:00:30,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:00:30,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-12-08 17:00:30,762 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:00:30,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:00:30,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:00:30,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:00:30,770 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 12 states. [2018-12-08 17:00:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:31,428 INFO L93 Difference]: Finished difference Result 224 states and 366 transitions. [2018-12-08 17:00:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:00:31,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-12-08 17:00:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:31,437 INFO L225 Difference]: With dead ends: 224 [2018-12-08 17:00:31,437 INFO L226 Difference]: Without dead ends: 142 [2018-12-08 17:00:31,440 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:00:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-08 17:00:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2018-12-08 17:00:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-08 17:00:31,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 183 transitions. [2018-12-08 17:00:31,474 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 183 transitions. Word has length 36 [2018-12-08 17:00:31,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:31,475 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 183 transitions. [2018-12-08 17:00:31,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:00:31,475 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 183 transitions. [2018-12-08 17:00:31,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:00:31,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:31,477 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:31,477 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:31,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1149609499, now seen corresponding path program 1 times [2018-12-08 17:00:31,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:31,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:31,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:31,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:31,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:31,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:31,585 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-08 17:00:31,585 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:31,586 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:31,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:31,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 17:00:31,599 INFO L272 AbstractInterpreter]: Visited 27 different actions 35 times. Never merged. Never widened. Performed 95 root evaluator evaluations with a maximum evaluation depth of 3. Performed 95 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 29 variables. [2018-12-08 17:00:31,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:31,600 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 17:00:31,626 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 62.65% of their original sizes. [2018-12-08 17:00:31,626 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 17:00:31,714 INFO L418 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-12-08 17:00:31,714 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 17:00:31,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:00:31,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [9] total 24 [2018-12-08 17:00:31,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:00:31,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:00:31,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:00:31,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:00:31,716 INFO L87 Difference]: Start difference. First operand 130 states and 183 transitions. Second operand 17 states. [2018-12-08 17:00:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:32,423 INFO L93 Difference]: Finished difference Result 187 states and 264 transitions. [2018-12-08 17:00:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 17:00:32,423 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-08 17:00:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:32,424 INFO L225 Difference]: With dead ends: 187 [2018-12-08 17:00:32,424 INFO L226 Difference]: Without dead ends: 148 [2018-12-08 17:00:32,425 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-12-08 17:00:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-08 17:00:32,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2018-12-08 17:00:32,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-08 17:00:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2018-12-08 17:00:32,434 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 40 [2018-12-08 17:00:32,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:32,434 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2018-12-08 17:00:32,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:00:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2018-12-08 17:00:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:32,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:32,435 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:32,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:32,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:32,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1042420980, now seen corresponding path program 1 times [2018-12-08 17:00:32,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:32,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:32,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:32,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:32,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:32,532 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 17:00:32,532 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:32,533 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:32,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:32,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:00:32,571 INFO L272 AbstractInterpreter]: Visited 37 different actions 88 times. Merged at 13 different actions 25 times. Never widened. Performed 265 root evaluator evaluations with a maximum evaluation depth of 6. Performed 265 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-08 17:00:32,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:32,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:00:32,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:32,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:32,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:32,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:00:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:32,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 17:00:32,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:00:32,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2018-12-08 17:00:32,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:00:32,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:00:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:00:32,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:00:32,767 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand 12 states. [2018-12-08 17:00:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:33,006 INFO L93 Difference]: Finished difference Result 214 states and 304 transitions. [2018-12-08 17:00:33,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:00:33,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-12-08 17:00:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:33,008 INFO L225 Difference]: With dead ends: 214 [2018-12-08 17:00:33,008 INFO L226 Difference]: Without dead ends: 176 [2018-12-08 17:00:33,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-12-08 17:00:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-08 17:00:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2018-12-08 17:00:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-08 17:00:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 208 transitions. [2018-12-08 17:00:33,022 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 208 transitions. Word has length 44 [2018-12-08 17:00:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:33,023 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 208 transitions. [2018-12-08 17:00:33,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:00:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 208 transitions. [2018-12-08 17:00:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:33,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:33,024 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:33,024 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:33,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:33,025 INFO L82 PathProgramCache]: Analyzing trace with hash -985162678, now seen corresponding path program 1 times [2018-12-08 17:00:33,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:33,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:33,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:33,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 17:00:33,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:33,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:33,164 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 17:00:33,164 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [199], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:33,165 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:33,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:33,194 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:00:33,194 INFO L272 AbstractInterpreter]: Visited 37 different actions 92 times. Merged at 13 different actions 28 times. Never widened. Performed 281 root evaluator evaluations with a maximum evaluation depth of 6. Performed 281 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 29 variables. [2018-12-08 17:00:33,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:33,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:00:33,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:33,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:33,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:00:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 17:00:33,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:33,611 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 17:00:33,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:00:33,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 31 [2018-12-08 17:00:33,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:00:33,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 17:00:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 17:00:33,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2018-12-08 17:00:33,626 INFO L87 Difference]: Start difference. First operand 150 states and 208 transitions. Second operand 19 states. [2018-12-08 17:00:34,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:34,110 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2018-12-08 17:00:34,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 17:00:34,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-12-08 17:00:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:34,112 INFO L225 Difference]: With dead ends: 315 [2018-12-08 17:00:34,112 INFO L226 Difference]: Without dead ends: 242 [2018-12-08 17:00:34,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1691, Unknown=0, NotChecked=0, Total=1892 [2018-12-08 17:00:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-08 17:00:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 208. [2018-12-08 17:00:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-08 17:00:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2018-12-08 17:00:34,124 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 44 [2018-12-08 17:00:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:34,124 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2018-12-08 17:00:34,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 17:00:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2018-12-08 17:00:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:34,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:34,125 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:34,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:34,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1720292238, now seen corresponding path program 1 times [2018-12-08 17:00:34,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:34,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:34,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:34,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:34,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:34,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:34,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:34,218 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 17:00:34,218 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [50], [60], [62], [63], [67], [69], [71], [73], [78], [83], [85], [91], [96], [98], [194], [199], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:34,219 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:34,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:34,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:00:34,248 INFO L272 AbstractInterpreter]: Visited 37 different actions 113 times. Merged at 13 different actions 35 times. Never widened. Performed 341 root evaluator evaluations with a maximum evaluation depth of 6. Performed 341 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2018-12-08 17:00:34,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:34,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:00:34,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:34,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:34,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:34,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:00:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:34,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 17:00:34,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:34,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:00:34,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 22 [2018-12-08 17:00:34,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:00:34,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:00:34,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:00:34,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-12-08 17:00:34,510 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand 17 states. [2018-12-08 17:00:34,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:34,906 INFO L93 Difference]: Finished difference Result 359 states and 519 transitions. [2018-12-08 17:00:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-08 17:00:34,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-08 17:00:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:34,907 INFO L225 Difference]: With dead ends: 359 [2018-12-08 17:00:34,908 INFO L226 Difference]: Without dead ends: 295 [2018-12-08 17:00:34,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 17:00:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-08 17:00:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 222. [2018-12-08 17:00:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-08 17:00:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 306 transitions. [2018-12-08 17:00:34,922 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 306 transitions. Word has length 44 [2018-12-08 17:00:34,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:34,922 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 306 transitions. [2018-12-08 17:00:34,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:00:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 306 transitions. [2018-12-08 17:00:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:34,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:34,924 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:34,924 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:34,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash 770276810, now seen corresponding path program 1 times [2018-12-08 17:00:34,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:34,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:34,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:34,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:34,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:34,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:34,988 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 17:00:34,988 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [54], [62], [63], [67], [69], [71], [73], [78], [81], [85], [91], [94], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:34,989 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:34,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:35,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:00:35,018 INFO L272 AbstractInterpreter]: Visited 37 different actions 84 times. Merged at 11 different actions 23 times. Never widened. Performed 242 root evaluator evaluations with a maximum evaluation depth of 6. Performed 242 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 29 variables. [2018-12-08 17:00:35,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:35,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:00:35,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:35,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:35,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:35,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:00:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:35,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-08 17:00:35,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:35,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:00:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 18 [2018-12-08 17:00:35,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:00:35,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:00:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:00:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:00:35,214 INFO L87 Difference]: Start difference. First operand 222 states and 306 transitions. Second operand 6 states. [2018-12-08 17:00:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:35,274 INFO L93 Difference]: Finished difference Result 311 states and 440 transitions. [2018-12-08 17:00:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:00:35,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-08 17:00:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:35,276 INFO L225 Difference]: With dead ends: 311 [2018-12-08 17:00:35,276 INFO L226 Difference]: Without dead ends: 268 [2018-12-08 17:00:35,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:00:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-12-08 17:00:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2018-12-08 17:00:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-08 17:00:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 313 transitions. [2018-12-08 17:00:35,284 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 313 transitions. Word has length 44 [2018-12-08 17:00:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:35,284 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 313 transitions. [2018-12-08 17:00:35,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:00:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 313 transitions. [2018-12-08 17:00:35,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:35,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:35,285 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:35,285 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:35,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:35,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1063865541, now seen corresponding path program 2 times [2018-12-08 17:00:35,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:35,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:35,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:35,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:00:35,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:35,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 17:00:35,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 17:00:35,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:00:35,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:00:35,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:00:35,464 INFO L87 Difference]: Start difference. First operand 228 states and 313 transitions. Second operand 14 states. [2018-12-08 17:00:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:35,706 INFO L93 Difference]: Finished difference Result 399 states and 574 transitions. [2018-12-08 17:00:35,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:00:35,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-12-08 17:00:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:35,707 INFO L225 Difference]: With dead ends: 399 [2018-12-08 17:00:35,707 INFO L226 Difference]: Without dead ends: 333 [2018-12-08 17:00:35,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:00:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-08 17:00:35,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-12-08 17:00:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-08 17:00:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 439 transitions. [2018-12-08 17:00:35,717 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 439 transitions. Word has length 48 [2018-12-08 17:00:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:35,718 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 439 transitions. [2018-12-08 17:00:35,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:00:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 439 transitions. [2018-12-08 17:00:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:35,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:35,719 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:35,719 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:35,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1641589375, now seen corresponding path program 1 times [2018-12-08 17:00:35,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:35,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:00:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:35,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:35,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:35,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 17:00:35,772 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-08 17:00:35,773 INFO L205 CegarAbsIntRunner]: [0], [1], [4], [6], [35], [44], [48], [50], [54], [60], [62], [63], [67], [69], [71], [73], [78], [81], [85], [91], [94], [98], [194], [197], [205], [229], [232], [234], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [258] [2018-12-08 17:00:35,774 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 17:00:35,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 17:00:35,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 17:00:35,801 INFO L272 AbstractInterpreter]: Visited 39 different actions 128 times. Merged at 12 different actions 49 times. Never widened. Performed 332 root evaluator evaluations with a maximum evaluation depth of 6. Performed 332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-08 17:00:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:35,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 17:00:35,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:35,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:35,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:35,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 17:00:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:35,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:35,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:36,048 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_main_~a~0 4294967296))) is different from false [2018-12-08 17:00:36,257 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_main_#t~ret5| 4294967296))) is different from false [2018-12-08 17:00:36,468 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod |c_base2flt_#res| 4294967296))) is different from false [2018-12-08 17:00:36,671 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~b~0 Int)) (<= (mod main_~b~0 4294967296) (mod c_base2flt_~__retres4~0 4294967296))) is different from false [2018-12-08 17:00:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:36,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:00:36,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-12-08 17:00:36,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 17:00:36,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:00:36,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:00:36,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=75, Unknown=4, NotChecked=76, Total=182 [2018-12-08 17:00:36,691 INFO L87 Difference]: Start difference. First operand 316 states and 439 transitions. Second operand 8 states. [2018-12-08 17:00:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:36,762 INFO L93 Difference]: Finished difference Result 388 states and 541 transitions. [2018-12-08 17:00:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:00:36,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-08 17:00:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:36,763 INFO L225 Difference]: With dead ends: 388 [2018-12-08 17:00:36,763 INFO L226 Difference]: Without dead ends: 349 [2018-12-08 17:00:36,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2018-12-08 17:00:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-08 17:00:36,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-08 17:00:36,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-08 17:00:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 462 transitions. [2018-12-08 17:00:36,772 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 462 transitions. Word has length 48 [2018-12-08 17:00:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:36,772 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 462 transitions. [2018-12-08 17:00:36,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:00:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 462 transitions. [2018-12-08 17:00:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:36,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:36,773 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:36,773 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:36,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-08 17:00:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 17:00:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:36,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:36,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 17:00:36,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 17:00:36,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:00:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 17:00:36,797 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 17:00:36,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:00:36 BoogieIcfgContainer [2018-12-08 17:00:36,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:00:36,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:00:36,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:00:36,815 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:00:36,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:30" (3/4) ... [2018-12-08 17:00:36,818 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 17:00:36,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:00:36,819 INFO L168 Benchmark]: Toolchain (without parser) took 6981.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:00:36,819 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:00:36,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 192.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:00:36,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:00:36,820 INFO L168 Benchmark]: Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:00:36,820 INFO L168 Benchmark]: RCFGBuilder took 224.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:00:36,821 INFO L168 Benchmark]: TraceAbstraction took 6526.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.2 MB). Peak memory consumption was 116.8 MB. Max. memory is 11.5 GB. [2018-12-08 17:00:36,821 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:00:36,823 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 192.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 224.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6526.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -55.2 MB). Peak memory consumption was 116.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-72057589726183425, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L257] COND TRUE b > zero [L258] tmp___0 = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L262] sb = tmp___0 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L265] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777215] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. UNSAFE Result, 6.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 943 SDtfs, 1124 SDslu, 8072 SDs, 0 SdLazy, 2425 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 633 GetRequests, 441 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 7 AbstIntIterations, 2 AbstIntStrong, 0.6614543114543113 AbsIntWeakeningRatio, 2.0 AbsIntAvgWeakeningVarsNumRemoved, 0.918918918918919 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 228 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 620 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 778 ConstructedInterpolants, 37 QuantifiedInterpolants, 122450 SizeOfPredicates, 24 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 203/283 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 17:00:38,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 17:00:38,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 17:00:38,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 17:00:38,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 17:00:38,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 17:00:38,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 17:00:38,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 17:00:38,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 17:00:38,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 17:00:38,126 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 17:00:38,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 17:00:38,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 17:00:38,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 17:00:38,128 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 17:00:38,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 17:00:38,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 17:00:38,129 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 17:00:38,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 17:00:38,131 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 17:00:38,132 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 17:00:38,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 17:00:38,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 17:00:38,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 17:00:38,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 17:00:38,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 17:00:38,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 17:00:38,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 17:00:38,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 17:00:38,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 17:00:38,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 17:00:38,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 17:00:38,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 17:00:38,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 17:00:38,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 17:00:38,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 17:00:38,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 17:00:38,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 17:00:38,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 17:00:38,145 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 17:00:38,146 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 17:00:38,146 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 17:00:38,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 17:00:38,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 17:00:38,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 17:00:38,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 17:00:38,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 17:00:38,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 17:00:38,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 17:00:38,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:00:38,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 17:00:38,149 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 17:00:38,150 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 17:00:38,150 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 17:00:38,150 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 17:00:38,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/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 -> f756365182c9801d4a2ac186a40692687a86b469 [2018-12-08 17:00:38,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 17:00:38,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 17:00:38,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 17:00:38,179 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 17:00:38,179 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 17:00:38,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:38,216 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/60d4c3f24/6ed1f0e6f5f6426ea5e52e336199a8fa/FLAG79b8e96b6 [2018-12-08 17:00:38,619 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 17:00:38,619 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:38,625 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/60d4c3f24/6ed1f0e6f5f6426ea5e52e336199a8fa/FLAG79b8e96b6 [2018-12-08 17:00:38,636 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/data/60d4c3f24/6ed1f0e6f5f6426ea5e52e336199a8fa [2018-12-08 17:00:38,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 17:00:38,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 17:00:38,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 17:00:38,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 17:00:38,643 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 17:00:38,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3832628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38, skipping insertion in model container [2018-12-08 17:00:38,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 17:00:38,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 17:00:38,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:00:38,782 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 17:00:38,809 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 17:00:38,818 INFO L195 MainTranslator]: Completed translation [2018-12-08 17:00:38,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38 WrapperNode [2018-12-08 17:00:38,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 17:00:38,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 17:00:38,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 17:00:38,819 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 17:00:38,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 17:00:38,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 17:00:38,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 17:00:38,834 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 17:00:38,840 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... [2018-12-08 17:00:38,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 17:00:38,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 17:00:38,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 17:00:38,888 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 17:00:38,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 17:00:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 17:00:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 17:00:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-08 17:00:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-08 17:00:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 17:00:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 17:00:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 17:00:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 17:00:38,921 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-08 17:00:38,921 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-08 17:00:38,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 17:00:38,922 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 17:00:39,150 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 17:00:39,150 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 17:00:39,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:39 BoogieIcfgContainer [2018-12-08 17:00:39,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 17:00:39,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 17:00:39,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 17:00:39,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 17:00:39,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 05:00:38" (1/3) ... [2018-12-08 17:00:39,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:00:39, skipping insertion in model container [2018-12-08 17:00:39,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 05:00:38" (2/3) ... [2018-12-08 17:00:39,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 05:00:39, skipping insertion in model container [2018-12-08 17:00:39,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:39" (3/3) ... [2018-12-08 17:00:39,155 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-08 17:00:39,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 17:00:39,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 17:00:39,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 17:00:39,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 17:00:39,191 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 17:00:39,192 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 17:00:39,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 17:00:39,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 17:00:39,192 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 17:00:39,192 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 17:00:39,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 17:00:39,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 17:00:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-08 17:00:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-08 17:00:39,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:39,207 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:39,208 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:39,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-08 17:00:39,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:39,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:39,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:39,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:39,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:39,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:00:39,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 9 [2018-12-08 17:00:39,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:00:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:00:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:00:39,459 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 9 states. [2018-12-08 17:00:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:39,671 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2018-12-08 17:00:39,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:00:39,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-08 17:00:39,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:39,681 INFO L225 Difference]: With dead ends: 199 [2018-12-08 17:00:39,681 INFO L226 Difference]: Without dead ends: 120 [2018-12-08 17:00:39,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:00:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-08 17:00:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-12-08 17:00:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 17:00:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2018-12-08 17:00:39,720 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 36 [2018-12-08 17:00:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:39,720 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2018-12-08 17:00:39,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:00:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2018-12-08 17:00:39,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 17:00:39,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:39,723 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:39,723 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:39,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:39,724 INFO L82 PathProgramCache]: Analyzing trace with hash 306755114, now seen corresponding path program 1 times [2018-12-08 17:00:39,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:39,724 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:39,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:39,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:39,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:39,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:39,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 17:00:39,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:40,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:00:40,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10, 6] total 14 [2018-12-08 17:00:40,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:00:40,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:00:40,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:00:40,032 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 14 states. [2018-12-08 17:00:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:40,325 INFO L93 Difference]: Finished difference Result 344 states and 546 transitions. [2018-12-08 17:00:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:00:40,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-12-08 17:00:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:40,328 INFO L225 Difference]: With dead ends: 344 [2018-12-08 17:00:40,328 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 17:00:40,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-12-08 17:00:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 17:00:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 156. [2018-12-08 17:00:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-08 17:00:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2018-12-08 17:00:40,346 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 40 [2018-12-08 17:00:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:40,346 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2018-12-08 17:00:40,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:00:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2018-12-08 17:00:40,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:40,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:40,348 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:40,348 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:40,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash 377249800, now seen corresponding path program 1 times [2018-12-08 17:00:40,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:40,349 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:40,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:40,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:40,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:40,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:40,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:40,450 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:40,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 17:00:40,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:40,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:40,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-08 17:00:40,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8, 12] total 18 [2018-12-08 17:00:40,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 17:00:40,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 17:00:40,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:00:40,660 INFO L87 Difference]: Start difference. First operand 156 states and 237 transitions. Second operand 18 states. [2018-12-08 17:00:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:41,805 INFO L93 Difference]: Finished difference Result 377 states and 566 transitions. [2018-12-08 17:00:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 17:00:41,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 44 [2018-12-08 17:00:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:41,807 INFO L225 Difference]: With dead ends: 377 [2018-12-08 17:00:41,807 INFO L226 Difference]: Without dead ends: 301 [2018-12-08 17:00:41,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 154 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2018-12-08 17:00:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-08 17:00:41,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 251. [2018-12-08 17:00:41,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-08 17:00:41,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 362 transitions. [2018-12-08 17:00:41,820 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 362 transitions. Word has length 44 [2018-12-08 17:00:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:41,821 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 362 transitions. [2018-12-08 17:00:41,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 17:00:41,821 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 362 transitions. [2018-12-08 17:00:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 17:00:41,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:41,822 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:41,822 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:41,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1751112318, now seen corresponding path program 1 times [2018-12-08 17:00:41,823 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:41,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:41,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:41,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:00:41,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:41,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:00:41,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:00:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:00:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:00:41,879 INFO L87 Difference]: Start difference. First operand 251 states and 362 transitions. Second operand 8 states. [2018-12-08 17:00:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:41,970 INFO L93 Difference]: Finished difference Result 351 states and 509 transitions. [2018-12-08 17:00:41,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:00:41,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-08 17:00:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:41,972 INFO L225 Difference]: With dead ends: 351 [2018-12-08 17:00:41,972 INFO L226 Difference]: Without dead ends: 286 [2018-12-08 17:00:41,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:00:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-08 17:00:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2018-12-08 17:00:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-08 17:00:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 393 transitions. [2018-12-08 17:00:41,984 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 393 transitions. Word has length 44 [2018-12-08 17:00:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:41,984 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 393 transitions. [2018-12-08 17:00:41,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:00:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 393 transitions. [2018-12-08 17:00:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:41,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:41,986 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:41,986 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:41,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1399634249, now seen corresponding path program 1 times [2018-12-08 17:00:41,986 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:41,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:42,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:42,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:00:42,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:42,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:42,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:00:42,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:00:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:00:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:00:42,053 INFO L87 Difference]: Start difference. First operand 273 states and 393 transitions. Second operand 7 states. [2018-12-08 17:00:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:42,173 INFO L93 Difference]: Finished difference Result 522 states and 772 transitions. [2018-12-08 17:00:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:00:42,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-08 17:00:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:42,176 INFO L225 Difference]: With dead ends: 522 [2018-12-08 17:00:42,176 INFO L226 Difference]: Without dead ends: 428 [2018-12-08 17:00:42,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:00:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-12-08 17:00:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 358. [2018-12-08 17:00:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-12-08 17:00:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 515 transitions. [2018-12-08 17:00:42,196 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 515 transitions. Word has length 48 [2018-12-08 17:00:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:42,197 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 515 transitions. [2018-12-08 17:00:42,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:00:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 515 transitions. [2018-12-08 17:00:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:42,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:42,199 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:42,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1006607239, now seen corresponding path program 1 times [2018-12-08 17:00:42,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:42,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:00:42,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:42,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:42,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:00:42,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:00:42,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:00:42,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:00:42,330 INFO L87 Difference]: Start difference. First operand 358 states and 515 transitions. Second operand 13 states. [2018-12-08 17:00:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:42,644 INFO L93 Difference]: Finished difference Result 425 states and 606 transitions. [2018-12-08 17:00:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 17:00:42,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-12-08 17:00:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:42,646 INFO L225 Difference]: With dead ends: 425 [2018-12-08 17:00:42,646 INFO L226 Difference]: Without dead ends: 392 [2018-12-08 17:00:42,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:00:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-12-08 17:00:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 375. [2018-12-08 17:00:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-08 17:00:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2018-12-08 17:00:42,659 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 48 [2018-12-08 17:00:42,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:42,659 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2018-12-08 17:00:42,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:00:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2018-12-08 17:00:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:42,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:42,661 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:42,661 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:42,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1305820667, now seen corresponding path program 1 times [2018-12-08 17:00:42,661 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:42,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:42,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:42,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:42,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:42,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:42,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:42,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:00:42,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 9 [2018-12-08 17:00:42,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:00:42,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:00:42,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:00:42,827 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand 9 states. [2018-12-08 17:00:42,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:42,986 INFO L93 Difference]: Finished difference Result 810 states and 1190 transitions. [2018-12-08 17:00:42,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:00:42,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-12-08 17:00:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:42,990 INFO L225 Difference]: With dead ends: 810 [2018-12-08 17:00:42,990 INFO L226 Difference]: Without dead ends: 695 [2018-12-08 17:00:42,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:00:42,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-12-08 17:00:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 438. [2018-12-08 17:00:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-08 17:00:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 621 transitions. [2018-12-08 17:00:43,023 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 621 transitions. Word has length 48 [2018-12-08 17:00:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:43,024 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 621 transitions. [2018-12-08 17:00:43,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:00:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 621 transitions. [2018-12-08 17:00:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:43,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:43,025 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:43,026 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:43,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:43,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-08 17:00:43,026 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:43,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:43,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:43,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:43,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:43,327 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:43,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:43,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:43,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:43,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:00:43,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-08 17:00:43,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:00:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:00:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:00:43,375 INFO L87 Difference]: Start difference. First operand 438 states and 621 transitions. Second operand 11 states. [2018-12-08 17:00:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:43,632 INFO L93 Difference]: Finished difference Result 492 states and 695 transitions. [2018-12-08 17:00:43,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:00:43,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-12-08 17:00:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:43,634 INFO L225 Difference]: With dead ends: 492 [2018-12-08 17:00:43,634 INFO L226 Difference]: Without dead ends: 459 [2018-12-08 17:00:43,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-08 17:00:43,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-08 17:00:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2018-12-08 17:00:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-08 17:00:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 623 transitions. [2018-12-08 17:00:43,659 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 623 transitions. Word has length 48 [2018-12-08 17:00:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:43,660 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 623 transitions. [2018-12-08 17:00:43,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:00:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 623 transitions. [2018-12-08 17:00:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:43,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:43,661 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:43,661 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:43,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:43,662 INFO L82 PathProgramCache]: Analyzing trace with hash -294368905, now seen corresponding path program 1 times [2018-12-08 17:00:43,662 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:43,662 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:43,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:43,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:43,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:43,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:00:43,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:00:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:00:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:00:43,822 INFO L87 Difference]: Start difference. First operand 442 states and 623 transitions. Second operand 12 states. [2018-12-08 17:00:44,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:44,114 INFO L93 Difference]: Finished difference Result 545 states and 757 transitions. [2018-12-08 17:00:44,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 17:00:44,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-08 17:00:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:44,115 INFO L225 Difference]: With dead ends: 545 [2018-12-08 17:00:44,116 INFO L226 Difference]: Without dead ends: 446 [2018-12-08 17:00:44,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-08 17:00:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-08 17:00:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 411. [2018-12-08 17:00:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-08 17:00:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 575 transitions. [2018-12-08 17:00:44,129 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 575 transitions. Word has length 48 [2018-12-08 17:00:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:44,129 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 575 transitions. [2018-12-08 17:00:44,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:00:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 575 transitions. [2018-12-08 17:00:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:44,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:44,130 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:44,130 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:44,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1883881285, now seen corresponding path program 1 times [2018-12-08 17:00:44,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:44,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:44,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:00:44,227 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:44,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:44,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:00:44,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:00:44,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:00:44,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:00:44,230 INFO L87 Difference]: Start difference. First operand 411 states and 575 transitions. Second operand 6 states. [2018-12-08 17:00:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:45,190 INFO L93 Difference]: Finished difference Result 452 states and 624 transitions. [2018-12-08 17:00:45,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:00:45,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-08 17:00:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:45,192 INFO L225 Difference]: With dead ends: 452 [2018-12-08 17:00:45,192 INFO L226 Difference]: Without dead ends: 450 [2018-12-08 17:00:45,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:00:45,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-08 17:00:45,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 417. [2018-12-08 17:00:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-08 17:00:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 582 transitions. [2018-12-08 17:00:45,205 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 582 transitions. Word has length 48 [2018-12-08 17:00:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:45,205 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 582 transitions. [2018-12-08 17:00:45,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:00:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 582 transitions. [2018-12-08 17:00:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 17:00:45,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:45,206 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:45,206 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:45,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:45,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1826622983, now seen corresponding path program 1 times [2018-12-08 17:00:45,206 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:45,206 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:45,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:45,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:00:45,294 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:45,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:45,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:00:45,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:00:45,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:00:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:00:45,296 INFO L87 Difference]: Start difference. First operand 417 states and 582 transitions. Second operand 6 states. [2018-12-08 17:00:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:49,420 INFO L93 Difference]: Finished difference Result 436 states and 601 transitions. [2018-12-08 17:00:49,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:00:49,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-08 17:00:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:49,422 INFO L225 Difference]: With dead ends: 436 [2018-12-08 17:00:49,422 INFO L226 Difference]: Without dead ends: 434 [2018-12-08 17:00:49,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:00:49,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-12-08 17:00:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 415. [2018-12-08 17:00:49,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-08 17:00:49,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 578 transitions. [2018-12-08 17:00:49,443 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 578 transitions. Word has length 48 [2018-12-08 17:00:49,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:49,443 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 578 transitions. [2018-12-08 17:00:49,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:00:49,443 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 578 transitions. [2018-12-08 17:00:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:00:49,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:49,444 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:49,444 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:49,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:49,444 INFO L82 PathProgramCache]: Analyzing trace with hash 609641055, now seen corresponding path program 1 times [2018-12-08 17:00:49,444 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:49,445 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:49,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:49,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:00:49,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:49,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:49,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 17:00:49,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 17:00:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 17:00:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:00:49,494 INFO L87 Difference]: Start difference. First operand 415 states and 578 transitions. Second operand 7 states. [2018-12-08 17:00:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:49,623 INFO L93 Difference]: Finished difference Result 632 states and 907 transitions. [2018-12-08 17:00:49,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:00:49,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-08 17:00:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:49,625 INFO L225 Difference]: With dead ends: 632 [2018-12-08 17:00:49,625 INFO L226 Difference]: Without dead ends: 537 [2018-12-08 17:00:49,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:00:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-08 17:00:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 410. [2018-12-08 17:00:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-12-08 17:00:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 569 transitions. [2018-12-08 17:00:49,642 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 569 transitions. Word has length 49 [2018-12-08 17:00:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:49,642 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 569 transitions. [2018-12-08 17:00:49,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 17:00:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 569 transitions. [2018-12-08 17:00:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:00:49,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:49,643 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:49,643 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:49,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash 666899357, now seen corresponding path program 1 times [2018-12-08 17:00:49,643 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:49,643 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:49,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:49,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:00:49,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:49,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:49,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:00:49,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:00:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:00:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:00:49,704 INFO L87 Difference]: Start difference. First operand 410 states and 569 transitions. Second operand 4 states. [2018-12-08 17:00:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:49,736 INFO L93 Difference]: Finished difference Result 663 states and 957 transitions. [2018-12-08 17:00:49,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:00:49,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-08 17:00:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:49,738 INFO L225 Difference]: With dead ends: 663 [2018-12-08 17:00:49,738 INFO L226 Difference]: Without dead ends: 530 [2018-12-08 17:00:49,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:00:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-12-08 17:00:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 474. [2018-12-08 17:00:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-12-08 17:00:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 655 transitions. [2018-12-08 17:00:49,768 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 655 transitions. Word has length 49 [2018-12-08 17:00:49,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:49,768 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 655 transitions. [2018-12-08 17:00:49,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:00:49,768 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 655 transitions. [2018-12-08 17:00:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 17:00:49,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:49,770 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:49,770 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:49,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -855742356, now seen corresponding path program 1 times [2018-12-08 17:00:49,770 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:49,770 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:49,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:49,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-08 17:00:49,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:49,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:49,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:00:49,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:00:49,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:00:49,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:00:49,806 INFO L87 Difference]: Start difference. First operand 474 states and 655 transitions. Second operand 4 states. [2018-12-08 17:00:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:49,864 INFO L93 Difference]: Finished difference Result 849 states and 1159 transitions. [2018-12-08 17:00:49,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:00:49,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-08 17:00:49,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:49,866 INFO L225 Difference]: With dead ends: 849 [2018-12-08 17:00:49,866 INFO L226 Difference]: Without dead ends: 381 [2018-12-08 17:00:49,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:00:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-12-08 17:00:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 369. [2018-12-08 17:00:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 17:00:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 487 transitions. [2018-12-08 17:00:49,884 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 487 transitions. Word has length 49 [2018-12-08 17:00:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:49,885 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 487 transitions. [2018-12-08 17:00:49,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:00:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 487 transitions. [2018-12-08 17:00:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 17:00:49,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:49,886 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:49,886 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:49,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:49,886 INFO L82 PathProgramCache]: Analyzing trace with hash 849971633, now seen corresponding path program 1 times [2018-12-08 17:00:49,886 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:49,886 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:49,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:49,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:00:49,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:49,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:49,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:00:49,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:00:49,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:00:49,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:00:49,925 INFO L87 Difference]: Start difference. First operand 369 states and 487 transitions. Second operand 5 states. [2018-12-08 17:00:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:49,953 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2018-12-08 17:00:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:00:49,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-08 17:00:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:49,954 INFO L225 Difference]: With dead ends: 376 [2018-12-08 17:00:49,954 INFO L226 Difference]: Without dead ends: 369 [2018-12-08 17:00:49,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:00:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-08 17:00:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-12-08 17:00:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-12-08 17:00:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 483 transitions. [2018-12-08 17:00:49,972 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 483 transitions. Word has length 50 [2018-12-08 17:00:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:49,972 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 483 transitions. [2018-12-08 17:00:49,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:00:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 483 transitions. [2018-12-08 17:00:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 17:00:49,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:49,973 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:49,973 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:49,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:49,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1699165264, now seen corresponding path program 1 times [2018-12-08 17:00:49,974 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:49,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:50,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:50,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:00:50,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:50,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:50,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:00:50,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:00:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:00:50,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:00:50,037 INFO L87 Difference]: Start difference. First operand 369 states and 483 transitions. Second operand 4 states. [2018-12-08 17:00:50,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:50,070 INFO L93 Difference]: Finished difference Result 411 states and 536 transitions. [2018-12-08 17:00:50,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:00:50,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-08 17:00:50,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:50,071 INFO L225 Difference]: With dead ends: 411 [2018-12-08 17:00:50,071 INFO L226 Difference]: Without dead ends: 386 [2018-12-08 17:00:50,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:00:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-12-08 17:00:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 361. [2018-12-08 17:00:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-08 17:00:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 471 transitions. [2018-12-08 17:00:50,086 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 471 transitions. Word has length 53 [2018-12-08 17:00:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 471 transitions. [2018-12-08 17:00:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:00:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 471 transitions. [2018-12-08 17:00:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 17:00:50,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:50,087 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:50,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:50,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1987036572, now seen corresponding path program 1 times [2018-12-08 17:00:50,088 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:50,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:50,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:00:50,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:50,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:50,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:00:50,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:00:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:00:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:00:50,132 INFO L87 Difference]: Start difference. First operand 361 states and 471 transitions. Second operand 4 states. [2018-12-08 17:00:50,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:50,153 INFO L93 Difference]: Finished difference Result 378 states and 490 transitions. [2018-12-08 17:00:50,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:00:50,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-08 17:00:50,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:50,154 INFO L225 Difference]: With dead ends: 378 [2018-12-08 17:00:50,154 INFO L226 Difference]: Without dead ends: 305 [2018-12-08 17:00:50,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:00:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-08 17:00:50,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-12-08 17:00:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-08 17:00:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 384 transitions. [2018-12-08 17:00:50,166 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 384 transitions. Word has length 54 [2018-12-08 17:00:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:50,167 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 384 transitions. [2018-12-08 17:00:50,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:00:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 384 transitions. [2018-12-08 17:00:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:00:50,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:50,168 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:50,168 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:50,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:50,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1813382670, now seen corresponding path program 1 times [2018-12-08 17:00:50,168 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:50,168 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:50,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:50,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:00:50,308 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:50,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:50,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 17:00:50,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 17:00:50,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 17:00:50,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:00:50,310 INFO L87 Difference]: Start difference. First operand 303 states and 384 transitions. Second operand 13 states. [2018-12-08 17:00:50,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:50,542 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2018-12-08 17:00:50,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:00:50,543 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-08 17:00:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:50,544 INFO L225 Difference]: With dead ends: 366 [2018-12-08 17:00:50,544 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 17:00:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:00:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 17:00:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-12-08 17:00:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-08 17:00:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 376 transitions. [2018-12-08 17:00:50,560 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 376 transitions. Word has length 56 [2018-12-08 17:00:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:50,560 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 376 transitions. [2018-12-08 17:00:50,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 17:00:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 376 transitions. [2018-12-08 17:00:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:00:50,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:50,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:50,561 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:50,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -848138954, now seen corresponding path program 1 times [2018-12-08 17:00:50,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:50,562 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:50,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:50,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:52,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:52,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:00:52,805 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:00:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:52,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:52,867 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:52,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:00:52,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:00:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-08 17:00:52,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 17:00:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 17:00:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2018-12-08 17:00:52,931 INFO L87 Difference]: Start difference. First operand 298 states and 376 transitions. Second operand 11 states. [2018-12-08 17:00:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:55,250 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2018-12-08 17:00:55,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 17:00:55,250 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-12-08 17:00:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:55,251 INFO L225 Difference]: With dead ends: 350 [2018-12-08 17:00:55,251 INFO L226 Difference]: Without dead ends: 319 [2018-12-08 17:00:55,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=63, Invalid=277, Unknown=2, NotChecked=0, Total=342 [2018-12-08 17:00:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-08 17:00:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-12-08 17:00:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-08 17:00:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 372 transitions. [2018-12-08 17:00:55,263 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 372 transitions. Word has length 56 [2018-12-08 17:00:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:55,263 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 372 transitions. [2018-12-08 17:00:55,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 17:00:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 372 transitions. [2018-12-08 17:00:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 17:00:55,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:55,264 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:55,264 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:55,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:55,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1591720731, now seen corresponding path program 1 times [2018-12-08 17:00:55,264 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:55,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 17:00:55,318 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:55,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:55,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:00:55,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:00:55,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:00:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:00:55,320 INFO L87 Difference]: Start difference. First operand 296 states and 372 transitions. Second operand 6 states. [2018-12-08 17:00:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:00:55,420 INFO L93 Difference]: Finished difference Result 378 states and 489 transitions. [2018-12-08 17:00:55,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:00:55,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-08 17:00:55,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:00:55,422 INFO L225 Difference]: With dead ends: 378 [2018-12-08 17:00:55,422 INFO L226 Difference]: Without dead ends: 331 [2018-12-08 17:00:55,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:00:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-08 17:00:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2018-12-08 17:00:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-12-08 17:00:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2018-12-08 17:00:55,434 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 55 [2018-12-08 17:00:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:00:55,434 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2018-12-08 17:00:55,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:00:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2018-12-08 17:00:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:00:55,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:00:55,435 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:00:55,435 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:00:55,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:00:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1440743184, now seen corresponding path program 1 times [2018-12-08 17:00:55,436 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:00:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:00:55,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:00:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:00:55,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:00:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 17:00:55,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:00:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:00:55,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:00:55,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:00:55,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:00:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:00:55,616 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand 12 states. [2018-12-08 17:01:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:01,056 INFO L93 Difference]: Finished difference Result 349 states and 438 transitions. [2018-12-08 17:01:01,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:01:01,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-08 17:01:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:01,058 INFO L225 Difference]: With dead ends: 349 [2018-12-08 17:01:01,058 INFO L226 Difference]: Without dead ends: 313 [2018-12-08 17:01:01,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2018-12-08 17:01:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-08 17:01:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2018-12-08 17:01:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-08 17:01:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2018-12-08 17:01:01,072 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 56 [2018-12-08 17:01:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:01,072 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2018-12-08 17:01:01,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:01:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2018-12-08 17:01:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:01:01,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:01,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:01,073 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:01,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:01,073 INFO L82 PathProgramCache]: Analyzing trace with hash -475499468, now seen corresponding path program 1 times [2018-12-08 17:01:01,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:01,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:01,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:01:05,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:05,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:05,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:01:05,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:01:05,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:01:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2018-12-08 17:01:05,638 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 8 states. [2018-12-08 17:01:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:09,386 INFO L93 Difference]: Finished difference Result 323 states and 400 transitions. [2018-12-08 17:01:09,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:01:09,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-08 17:01:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:09,387 INFO L225 Difference]: With dead ends: 323 [2018-12-08 17:01:09,387 INFO L226 Difference]: Without dead ends: 321 [2018-12-08 17:01:09,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2018-12-08 17:01:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-08 17:01:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 305. [2018-12-08 17:01:09,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-08 17:01:09,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 379 transitions. [2018-12-08 17:01:09,399 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 379 transitions. Word has length 56 [2018-12-08 17:01:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:09,400 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 379 transitions. [2018-12-08 17:01:09,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:01:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 379 transitions. [2018-12-08 17:01:09,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:01:09,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:09,400 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:09,400 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:09,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:09,401 INFO L82 PathProgramCache]: Analyzing trace with hash -695289963, now seen corresponding path program 1 times [2018-12-08 17:01:09,401 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:09,401 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:09,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:09,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:09,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 17:01:09,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:09,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:09,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:01:09,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:01:09,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:01:09,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:01:09,507 INFO L87 Difference]: Start difference. First operand 305 states and 379 transitions. Second operand 12 states. [2018-12-08 17:01:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:09,748 INFO L93 Difference]: Finished difference Result 377 states and 476 transitions. [2018-12-08 17:01:09,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:01:09,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-08 17:01:09,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:09,749 INFO L225 Difference]: With dead ends: 377 [2018-12-08 17:01:09,749 INFO L226 Difference]: Without dead ends: 352 [2018-12-08 17:01:09,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-08 17:01:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-12-08 17:01:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 321. [2018-12-08 17:01:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-08 17:01:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 402 transitions. [2018-12-08 17:01:09,763 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 402 transitions. Word has length 56 [2018-12-08 17:01:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:09,763 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 402 transitions. [2018-12-08 17:01:09,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:01:09,763 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 402 transitions. [2018-12-08 17:01:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 17:01:09,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:09,764 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:09,764 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:09,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1684269273, now seen corresponding path program 1 times [2018-12-08 17:01:09,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:09,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:01:09,843 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:09,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:09,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:01:09,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:01:09,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:01:09,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:09,845 INFO L87 Difference]: Start difference. First operand 321 states and 402 transitions. Second operand 8 states. [2018-12-08 17:01:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:10,018 INFO L93 Difference]: Finished difference Result 392 states and 498 transitions. [2018-12-08 17:01:10,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:01:10,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-08 17:01:10,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:10,019 INFO L225 Difference]: With dead ends: 392 [2018-12-08 17:01:10,019 INFO L226 Difference]: Without dead ends: 373 [2018-12-08 17:01:10,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:01:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-12-08 17:01:10,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 323. [2018-12-08 17:01:10,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-08 17:01:10,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 413 transitions. [2018-12-08 17:01:10,032 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 413 transitions. Word has length 56 [2018-12-08 17:01:10,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:10,033 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 413 transitions. [2018-12-08 17:01:10,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:01:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 413 transitions. [2018-12-08 17:01:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:01:10,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:10,034 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:10,034 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:10,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:10,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2092005707, now seen corresponding path program 1 times [2018-12-08 17:01:10,034 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:10,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:10,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:01:19,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:19,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:19,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:01:19,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:01:19,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:01:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=38, Unknown=4, NotChecked=0, Total=56 [2018-12-08 17:01:19,426 INFO L87 Difference]: Start difference. First operand 323 states and 413 transitions. Second operand 8 states. [2018-12-08 17:01:36,238 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-08 17:01:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:47,552 INFO L93 Difference]: Finished difference Result 339 states and 429 transitions. [2018-12-08 17:01:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:01:47,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-08 17:01:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:47,553 INFO L225 Difference]: With dead ends: 339 [2018-12-08 17:01:47,553 INFO L226 Difference]: Without dead ends: 337 [2018-12-08 17:01:47,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22, Invalid=63, Unknown=5, NotChecked=0, Total=90 [2018-12-08 17:01:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-12-08 17:01:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 322. [2018-12-08 17:01:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-08 17:01:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 411 transitions. [2018-12-08 17:01:47,576 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 411 transitions. Word has length 57 [2018-12-08 17:01:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:47,576 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 411 transitions. [2018-12-08 17:01:47,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:01:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 411 transitions. [2018-12-08 17:01:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 17:01:47,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:47,577 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:47,577 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:47,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -364789831, now seen corresponding path program 1 times [2018-12-08 17:01:47,578 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:47,578 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:47,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:47,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 17:01:47,618 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:47,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:47,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:01:47,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:01:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:01:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:01:47,619 INFO L87 Difference]: Start difference. First operand 322 states and 411 transitions. Second operand 5 states. [2018-12-08 17:01:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:47,683 INFO L93 Difference]: Finished difference Result 357 states and 453 transitions. [2018-12-08 17:01:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:01:47,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-08 17:01:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:47,684 INFO L225 Difference]: With dead ends: 357 [2018-12-08 17:01:47,684 INFO L226 Difference]: Without dead ends: 334 [2018-12-08 17:01:47,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:47,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-08 17:01:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 322. [2018-12-08 17:01:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-12-08 17:01:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 409 transitions. [2018-12-08 17:01:47,698 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 409 transitions. Word has length 57 [2018-12-08 17:01:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:47,698 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 409 transitions. [2018-12-08 17:01:47,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:01:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 409 transitions. [2018-12-08 17:01:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 17:01:47,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:47,698 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:47,699 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:47,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:47,699 INFO L82 PathProgramCache]: Analyzing trace with hash 306992977, now seen corresponding path program 1 times [2018-12-08 17:01:47,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:47,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:47,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:47,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-08 17:01:47,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:47,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:01:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:01:47,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:01:47,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:01:47,736 INFO L87 Difference]: Start difference. First operand 322 states and 409 transitions. Second operand 4 states. [2018-12-08 17:01:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:47,763 INFO L93 Difference]: Finished difference Result 331 states and 417 transitions. [2018-12-08 17:01:47,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:01:47,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-08 17:01:47,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:47,764 INFO L225 Difference]: With dead ends: 331 [2018-12-08 17:01:47,764 INFO L226 Difference]: Without dead ends: 280 [2018-12-08 17:01:47,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:01:47,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-12-08 17:01:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 270. [2018-12-08 17:01:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-08 17:01:47,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 336 transitions. [2018-12-08 17:01:47,776 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 336 transitions. Word has length 58 [2018-12-08 17:01:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:47,777 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 336 transitions. [2018-12-08 17:01:47,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:01:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 336 transitions. [2018-12-08 17:01:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 17:01:47,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:47,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:47,777 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:47,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:47,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1560523616, now seen corresponding path program 1 times [2018-12-08 17:01:47,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:47,778 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:47,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:47,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:01:47,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:47,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:47,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 17:01:47,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 17:01:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 17:01:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:47,854 INFO L87 Difference]: Start difference. First operand 270 states and 336 transitions. Second operand 8 states. [2018-12-08 17:01:48,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:48,048 INFO L93 Difference]: Finished difference Result 370 states and 474 transitions. [2018-12-08 17:01:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 17:01:48,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-08 17:01:48,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:48,049 INFO L225 Difference]: With dead ends: 370 [2018-12-08 17:01:48,050 INFO L226 Difference]: Without dead ends: 330 [2018-12-08 17:01:48,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:01:48,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-08 17:01:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 308. [2018-12-08 17:01:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-12-08 17:01:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 389 transitions. [2018-12-08 17:01:48,075 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 389 transitions. Word has length 62 [2018-12-08 17:01:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:48,075 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 389 transitions. [2018-12-08 17:01:48,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 17:01:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 389 transitions. [2018-12-08 17:01:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:01:48,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:48,076 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:48,076 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1628619175, now seen corresponding path program 1 times [2018-12-08 17:01:48,077 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:48,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:01:48,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:48,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:48,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:01:48,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:01:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:01:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:48,130 INFO L87 Difference]: Start difference. First operand 308 states and 389 transitions. Second operand 6 states. [2018-12-08 17:01:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:48,191 INFO L93 Difference]: Finished difference Result 402 states and 521 transitions. [2018-12-08 17:01:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:01:48,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 17:01:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:48,192 INFO L225 Difference]: With dead ends: 402 [2018-12-08 17:01:48,192 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 17:01:48,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:01:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 17:01:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 279. [2018-12-08 17:01:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-12-08 17:01:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 337 transitions. [2018-12-08 17:01:48,204 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 337 transitions. Word has length 64 [2018-12-08 17:01:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:48,204 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 337 transitions. [2018-12-08 17:01:48,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:01:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 337 transitions. [2018-12-08 17:01:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:01:48,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:48,205 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:48,205 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:48,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1905751366, now seen corresponding path program 1 times [2018-12-08 17:01:48,205 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:48,205 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:48,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 17:01:48,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:48,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:48,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:01:48,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:01:48,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:01:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:48,278 INFO L87 Difference]: Start difference. First operand 279 states and 337 transitions. Second operand 6 states. [2018-12-08 17:01:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:48,320 INFO L93 Difference]: Finished difference Result 320 states and 389 transitions. [2018-12-08 17:01:48,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:01:48,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 17:01:48,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:48,321 INFO L225 Difference]: With dead ends: 320 [2018-12-08 17:01:48,321 INFO L226 Difference]: Without dead ends: 318 [2018-12-08 17:01:48,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-12-08 17:01:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 288. [2018-12-08 17:01:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-12-08 17:01:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 348 transitions. [2018-12-08 17:01:48,337 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 348 transitions. Word has length 64 [2018-12-08 17:01:48,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:48,337 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 348 transitions. [2018-12-08 17:01:48,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:01:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 348 transitions. [2018-12-08 17:01:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 17:01:48,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:48,338 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:48,338 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:48,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:48,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1397816770, now seen corresponding path program 1 times [2018-12-08 17:01:48,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:48,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:48,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:48,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:48,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 17:01:48,411 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:48,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:48,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:01:48,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:01:48,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:01:48,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:48,413 INFO L87 Difference]: Start difference. First operand 288 states and 348 transitions. Second operand 6 states. [2018-12-08 17:01:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:48,456 INFO L93 Difference]: Finished difference Result 317 states and 380 transitions. [2018-12-08 17:01:48,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:01:48,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 17:01:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:48,457 INFO L225 Difference]: With dead ends: 317 [2018-12-08 17:01:48,457 INFO L226 Difference]: Without dead ends: 315 [2018-12-08 17:01:48,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-08 17:01:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 292. [2018-12-08 17:01:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-08 17:01:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 351 transitions. [2018-12-08 17:01:48,469 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 351 transitions. Word has length 64 [2018-12-08 17:01:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:48,470 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 351 transitions. [2018-12-08 17:01:48,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:01:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 351 transitions. [2018-12-08 17:01:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 17:01:48,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:48,470 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:48,470 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:48,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:48,470 INFO L82 PathProgramCache]: Analyzing trace with hash -186874661, now seen corresponding path program 1 times [2018-12-08 17:01:48,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:48,471 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:48,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 17:01:49,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:01:49,467 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-08 17:01:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 17:01:51,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:01:51,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:01:51,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:51,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 17:01:51,155 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:51,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 17:01:51,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 15] total 26 [2018-12-08 17:01:51,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-08 17:01:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-08 17:01:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-08 17:01:51,170 INFO L87 Difference]: Start difference. First operand 292 states and 351 transitions. Second operand 26 states. [2018-12-08 17:01:51,572 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-08 17:01:52,770 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-08 17:01:53,424 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-08 17:01:55,275 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-08 17:01:56,030 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-12-08 17:01:56,734 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-12-08 17:01:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:57,722 INFO L93 Difference]: Finished difference Result 392 states and 484 transitions. [2018-12-08 17:01:57,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-08 17:01:57,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-12-08 17:01:57,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:57,724 INFO L225 Difference]: With dead ends: 392 [2018-12-08 17:01:57,724 INFO L226 Difference]: Without dead ends: 364 [2018-12-08 17:01:57,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 177 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 17:01:57,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-08 17:01:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 314. [2018-12-08 17:01:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-12-08 17:01:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 381 transitions. [2018-12-08 17:01:57,742 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 381 transitions. Word has length 69 [2018-12-08 17:01:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:57,742 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 381 transitions. [2018-12-08 17:01:57,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-08 17:01:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 381 transitions. [2018-12-08 17:01:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:01:57,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:57,743 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:57,743 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:57,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash 457791470, now seen corresponding path program 1 times [2018-12-08 17:01:57,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:57,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:57,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:57,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:01:57,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:01:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:01:57,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:01:57,942 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:01:57,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:57,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:01:57,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:01:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:01:58,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:01:58,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 14 [2018-12-08 17:01:58,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 17:01:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 17:01:58,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:01:58,060 INFO L87 Difference]: Start difference. First operand 314 states and 381 transitions. Second operand 14 states. [2018-12-08 17:01:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:58,371 INFO L93 Difference]: Finished difference Result 341 states and 413 transitions. [2018-12-08 17:01:58,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 17:01:58,372 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-08 17:01:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:58,372 INFO L225 Difference]: With dead ends: 341 [2018-12-08 17:01:58,373 INFO L226 Difference]: Without dead ends: 334 [2018-12-08 17:01:58,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 261 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-12-08 17:01:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-08 17:01:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 311. [2018-12-08 17:01:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-08 17:01:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 378 transitions. [2018-12-08 17:01:58,391 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 378 transitions. Word has length 70 [2018-12-08 17:01:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:58,391 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 378 transitions. [2018-12-08 17:01:58,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 17:01:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 378 transitions. [2018-12-08 17:01:58,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:01:58,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:58,392 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:58,392 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:58,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:58,392 INFO L82 PathProgramCache]: Analyzing trace with hash -297341722, now seen corresponding path program 2 times [2018-12-08 17:01:58,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:58,392 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:58,405 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 17:01:58,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 17:01:58,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 17:01:58,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:01:58,514 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:58,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:01:58,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:01:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:01:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:01:58,516 INFO L87 Difference]: Start difference. First operand 311 states and 378 transitions. Second operand 12 states. [2018-12-08 17:01:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:58,762 INFO L93 Difference]: Finished difference Result 334 states and 403 transitions. [2018-12-08 17:01:58,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 17:01:58,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-08 17:01:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:58,763 INFO L225 Difference]: With dead ends: 334 [2018-12-08 17:01:58,763 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 17:01:58,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-08 17:01:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 17:01:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 303. [2018-12-08 17:01:58,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-08 17:01:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 368 transitions. [2018-12-08 17:01:58,781 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 368 transitions. Word has length 70 [2018-12-08 17:01:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:58,782 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 368 transitions. [2018-12-08 17:01:58,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:01:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 368 transitions. [2018-12-08 17:01:58,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:01:58,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:58,782 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:58,782 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:58,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:58,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1221744938, now seen corresponding path program 1 times [2018-12-08 17:01:58,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:58,783 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:58,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 17:01:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:58,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 17:01:58,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:58,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:58,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:01:58,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:01:58,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:01:58,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:58,851 INFO L87 Difference]: Start difference. First operand 303 states and 368 transitions. Second operand 6 states. [2018-12-08 17:01:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:59,089 INFO L93 Difference]: Finished difference Result 407 states and 501 transitions. [2018-12-08 17:01:59,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 17:01:59,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-08 17:01:59,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:59,091 INFO L225 Difference]: With dead ends: 407 [2018-12-08 17:01:59,091 INFO L226 Difference]: Without dead ends: 388 [2018-12-08 17:01:59,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-08 17:01:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 299. [2018-12-08 17:01:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-08 17:01:59,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 365 transitions. [2018-12-08 17:01:59,113 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 365 transitions. Word has length 70 [2018-12-08 17:01:59,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:59,113 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 365 transitions. [2018-12-08 17:01:59,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:01:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 365 transitions. [2018-12-08 17:01:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 17:01:59,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:59,114 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:59,114 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:59,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1115137352, now seen corresponding path program 1 times [2018-12-08 17:01:59,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:59,114 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:59,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:59,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-08 17:01:59,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:59,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:59,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 17:01:59,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 17:01:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 17:01:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 17:01:59,312 INFO L87 Difference]: Start difference. First operand 299 states and 365 transitions. Second operand 9 states. [2018-12-08 17:01:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:59,755 INFO L93 Difference]: Finished difference Result 349 states and 425 transitions. [2018-12-08 17:01:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 17:01:59,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-12-08 17:01:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:59,756 INFO L225 Difference]: With dead ends: 349 [2018-12-08 17:01:59,757 INFO L226 Difference]: Without dead ends: 308 [2018-12-08 17:01:59,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-12-08 17:01:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-08 17:01:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 277. [2018-12-08 17:01:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-08 17:01:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 330 transitions. [2018-12-08 17:01:59,776 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 330 transitions. Word has length 70 [2018-12-08 17:01:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:59,777 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 330 transitions. [2018-12-08 17:01:59,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 17:01:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 330 transitions. [2018-12-08 17:01:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 17:01:59,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:59,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:59,777 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:59,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -40698028, now seen corresponding path program 1 times [2018-12-08 17:01:59,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:59,778 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:59,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:59,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:01:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 17:01:59,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:01:59,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:01:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 17:01:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 17:01:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 17:01:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 17:01:59,858 INFO L87 Difference]: Start difference. First operand 277 states and 330 transitions. Second operand 6 states. [2018-12-08 17:01:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:01:59,903 INFO L93 Difference]: Finished difference Result 298 states and 352 transitions. [2018-12-08 17:01:59,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 17:01:59,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-08 17:01:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:01:59,904 INFO L225 Difference]: With dead ends: 298 [2018-12-08 17:01:59,904 INFO L226 Difference]: Without dead ends: 294 [2018-12-08 17:01:59,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 17:01:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-08 17:01:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 264. [2018-12-08 17:01:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-08 17:01:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-12-08 17:01:59,923 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 72 [2018-12-08 17:01:59,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:01:59,923 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-12-08 17:01:59,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 17:01:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-12-08 17:01:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-08 17:01:59,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:01:59,924 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:01:59,924 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:01:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:01:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash 16560274, now seen corresponding path program 1 times [2018-12-08 17:01:59,924 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:01:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:01:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:01:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:01:59,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-08 17:02:00,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:02:00,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:02:00,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:02:00,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:00,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 17:02:00,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:02:00,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 17:02:00,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-12-08 17:02:00,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 17:02:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 17:02:00,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-12-08 17:02:00,770 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 17 states. [2018-12-08 17:02:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:01,748 INFO L93 Difference]: Finished difference Result 313 states and 365 transitions. [2018-12-08 17:02:01,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 17:02:01,749 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-12-08 17:02:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:01,749 INFO L225 Difference]: With dead ends: 313 [2018-12-08 17:02:01,750 INFO L226 Difference]: Without dead ends: 169 [2018-12-08 17:02:01,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-12-08 17:02:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-08 17:02:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2018-12-08 17:02:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-08 17:02:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2018-12-08 17:02:01,761 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 72 [2018-12-08 17:02:01,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:01,761 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2018-12-08 17:02:01,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 17:02:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2018-12-08 17:02:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 17:02:01,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:01,762 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:01,762 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:01,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1073890760, now seen corresponding path program 1 times [2018-12-08 17:02:01,762 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:02:01,762 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:02:01,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:01,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:02:01,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:02:01,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:01,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 17:02:01,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 17:02:01,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 17:02:01,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 17:02:01,803 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand 4 states. [2018-12-08 17:02:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:01,827 INFO L93 Difference]: Finished difference Result 187 states and 225 transitions. [2018-12-08 17:02:01,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 17:02:01,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-08 17:02:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:01,828 INFO L225 Difference]: With dead ends: 187 [2018-12-08 17:02:01,828 INFO L226 Difference]: Without dead ends: 163 [2018-12-08 17:02:01,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-08 17:02:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2018-12-08 17:02:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-08 17:02:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2018-12-08 17:02:01,847 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 71 [2018-12-08 17:02:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:01,847 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2018-12-08 17:02:01,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 17:02:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2018-12-08 17:02:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 17:02:01,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:01,848 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:01,848 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:01,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:01,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1468257546, now seen corresponding path program 1 times [2018-12-08 17:02:01,849 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:02:01,849 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:02:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:01,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:02:01,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:02:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:02:02,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 17:02:02,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 17:02:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:02,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:02:02,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 17:02:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 17:02:02,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 17:02:02,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 12 [2018-12-08 17:02:02,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:02:02,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:02:02,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-08 17:02:02,121 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand 12 states. [2018-12-08 17:02:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:02,269 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2018-12-08 17:02:02,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:02:02,269 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-12-08 17:02:02,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:02,270 INFO L225 Difference]: With dead ends: 172 [2018-12-08 17:02:02,270 INFO L226 Difference]: Without dead ends: 141 [2018-12-08 17:02:02,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 266 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-12-08 17:02:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-08 17:02:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2018-12-08 17:02:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-08 17:02:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-12-08 17:02:02,280 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 71 [2018-12-08 17:02:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:02,281 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-12-08 17:02:02,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:02:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-12-08 17:02:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-08 17:02:02,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:02,281 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:02,281 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:02,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1571950312, now seen corresponding path program 1 times [2018-12-08 17:02:02,281 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:02:02,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:02:02,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:02,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 17:02:02,322 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:02:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:02,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 17:02:02,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 17:02:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 17:02:02,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 17:02:02,323 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 5 states. [2018-12-08 17:02:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:02,357 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-12-08 17:02:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 17:02:02,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-08 17:02:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:02,357 INFO L225 Difference]: With dead ends: 148 [2018-12-08 17:02:02,357 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 17:02:02,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 17:02:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 17:02:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-08 17:02:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 17:02:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-12-08 17:02:02,362 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 73 [2018-12-08 17:02:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:02,363 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-12-08 17:02:02,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 17:02:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-12-08 17:02:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-08 17:02:02,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:02,363 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:02,363 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:02,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1289345495, now seen corresponding path program 1 times [2018-12-08 17:02:02,363 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:02:02,363 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:02:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:02,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 17:02:04,862 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:02:04,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:04,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 17:02:04,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 17:02:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 17:02:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=109, Unknown=1, NotChecked=0, Total=132 [2018-12-08 17:02:04,864 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-12-08 17:02:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:09,128 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-12-08 17:02:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 17:02:09,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-08 17:02:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:09,129 INFO L225 Difference]: With dead ends: 90 [2018-12-08 17:02:09,129 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 17:02:09,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=52, Invalid=253, Unknown=1, NotChecked=0, Total=306 [2018-12-08 17:02:09,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 17:02:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-08 17:02:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-08 17:02:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-12-08 17:02:09,133 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 77 [2018-12-08 17:02:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:09,133 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-12-08 17:02:09,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 17:02:09,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-12-08 17:02:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-08 17:02:09,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 17:02:09,134 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 17:02:09,134 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 17:02:09,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 17:02:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1480434104, now seen corresponding path program 1 times [2018-12-08 17:02:09,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 17:02:09,134 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/cvc4 Starting monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 17:02:09,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 17:02:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 17:02:09,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 17:02:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-08 17:02:09,354 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 17:02:09,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 17:02:09,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 17:02:09,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 17:02:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 17:02:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-08 17:02:09,356 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 10 states. [2018-12-08 17:02:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 17:02:09,614 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-08 17:02:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 17:02:09,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-08 17:02:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 17:02:09,615 INFO L225 Difference]: With dead ends: 72 [2018-12-08 17:02:09,615 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 17:02:09,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-08 17:02:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 17:02:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 17:02:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 17:02:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 17:02:09,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-08 17:02:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 17:02:09,615 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 17:02:09,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 17:02:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 17:02:09,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 17:02:09,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 17:02:09,723 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 163 [2018-12-08 17:02:09,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:09,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:09,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:09,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:09,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:09,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:10,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:10,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:10,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 17:02:11,564 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 160 DAG size of output: 95 [2018-12-08 17:02:25,236 WARN L180 SmtUtils]: Spent 13.67 s on a formula simplification. DAG size of input: 148 DAG size of output: 65 [2018-12-08 17:02:26,297 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 131 DAG size of output: 53 [2018-12-08 17:02:26,510 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2018-12-08 17:02:49,870 WARN L180 SmtUtils]: Spent 23.35 s on a formula simplification. DAG size of input: 359 DAG size of output: 215 [2018-12-08 17:04:18,305 WARN L180 SmtUtils]: Spent 1.47 m on a formula simplification. DAG size of input: 192 DAG size of output: 143 [2018-12-08 17:04:18,307 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= (_ bv0 32) |base2flt_#in~m|)) (and (= (_ bv0 32) base2flt_~__retres4~0) (= base2flt_~m |base2flt_#in~m|))) [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-08 17:04:18,307 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-08 17:04:18,307 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 17:04:18,308 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L444 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-12-08 17:04:18,308 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L444 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse20 (bvult main_~a~0 main_~r_add~0)) (.cse12 (= (_ bv1 32) main_~tmp___2~0)) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse13 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse14 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse6 (= main_~tmp___1~0 (_ bv0 32))) (.cse7 (not (bvult main_~r_add~0 main_~a~0))) (.cse8 (= main_~tmp___2~0 (_ bv0 32))) (.cse11 (and .cse20 .cse12 .cse9 .cse13 .cse14))) (let ((.cse0 (or (and .cse6 .cse7 .cse8 .cse9 .cse13) .cse11)) (.cse1 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv0 32) main_~zero~0)) (.cse5 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse15 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32))) (.cse10 (not (bvult main_~a~0 main_~b~0)))) (or (and .cse0 (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse1 .cse2 .cse3 (exists ((v_addflt_~ma~0_91 (_ BitVec 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_91) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse4 .cse5) (and .cse1 .cse2 (or (and .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse10) (and .cse12 .cse9 .cse13 .cse14 .cse15)) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse18 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse17 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse19 (bvneg .cse18))) (let ((.cse16 (bvadd .cse17 .cse19))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse16)) (not (= (bvadd .cse17 .cse18 .cse19) (_ bv0 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse16) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and .cse12 .cse14 (or (and .cse13 .cse15 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (and (= main_~b~0 main_~r_add~0) .cse20 .cse13))) (and .cse6 (= main_~a~0 main_~r_add~0) .cse8 .cse9 .cse10))))) [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L444 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse1 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0)))) (or (and (= (_ bv4294967295 32) main_~a~0) .cse0) (and (= main_~tmp___0~0 (_ bv0 32)) (= main_~b~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 (= (_ bv0 32) main_~zero~0) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~a~0 (_ bv0 32)) .cse0 (= (_ bv0 32) main_~sa~0) (= main_~tmp~2 (_ bv0 32))) (and .cse1 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))))) [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L444 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-12-08 17:04:18,309 INFO L444 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (and (= main_~b~0 main_~r_add~0) (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (= main_~a~0 main_~r_add~0)) [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L451 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L444 ceAbstractionStarter]: At program point L282-1(lines 282 291) the Hoare annotation is: (let ((.cse6 (exists ((main_~a~0 (_ BitVec 32))) (and (not (bvult main_~r_add~0 main_~a~0)) (not (bvult main_~a~0 main_~b~0))))) (.cse7 (not (bvult main_~r_add~0 main_~a~0))) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)))) (let ((.cse0 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv1 32) main_~tmp___4~0)) (.cse1 (and .cse6 (and .cse7 (or (and (= main_~b~0 main_~r_add~0) .cse9) (and (= main_~a~0 main_~r_add~0) .cse8))))) (.cse4 (= main_~tmp___3~0 (_ bv0 32))) (.cse5 (= main_~tmp___4~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (and .cse6 (and .cse7 .cse8 .cse9)))) (or (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse2))) (= (_ bv0 32) main_~zero~0) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse4 .cse5)))) [2018-12-08 17:04:18,310 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L451 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-12-08 17:04:18,310 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-12-08 17:04:18,311 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (let ((.cse1 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32)))) (let ((.cse0 (and (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) |addflt_#in~a|)) (= addflt_~b |addflt_#in~b|) (= .cse1 addflt_~mb~0) (exists ((addflt_~a (_ BitVec 32))) (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (not (bvult |addflt_#in~a| |addflt_#in~b|)) (= addflt_~a |addflt_#in~a|) (= .cse2 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) (and (or (and (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) (exists ((addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (and (= (bvadd addflt_~eb~0 (_ bv128 32)) (bvlshr addflt_~b (_ bv24 32))) (not (bvult addflt_~a addflt_~b)) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (bvult |addflt_#in~a| addflt_~a) (= addflt_~a |addflt_#in~b|)) .cse0) (not (= (_ bv0 32) |addflt_#in~b|)) (or (and (= .cse1 addflt_~ma~0) (= .cse2 addflt_~ea~0)) .cse0) (not (= (_ bv0 32) |addflt_#in~a|))))) [2018-12-08 17:04:18,311 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-12-08 17:04:18,311 INFO L444 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse14 (= (_ bv4294967295 32) |addflt_#in~b|)) (.cse34 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse0 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvadd (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (_ bv33554431 32)) addflt_~ma~0))) (.cse1 (let ((.cse36 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse36) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse36) .cse34) |addflt_#in~a|))))) (.cse2 (let ((.cse35 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse35) .cse34) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse35) (_ bv0 32)))))) (.cse4 (= (_ bv0 32) |addflt_#in~b|)) (.cse3 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse34) |addflt_#in~a|))) (.cse8 (= (_ bv0 32) |addflt_#in~a|)) (.cse13 (= addflt_~a |addflt_#in~a|)) (.cse6 (= addflt_~__retres10~0 |addflt_#in~a|)) (.cse33 (not (bvult addflt_~a addflt_~b))) (.cse12 (= addflt_~b |addflt_#in~a|)) (.cse23 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse9 (= addflt_~a |addflt_#in~b|)) (.cse7 (not .cse14)) (.cse5 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))) (and (or (or .cse0 (and .cse1 .cse2 .cse3)) .cse4 .cse5) (or (not .cse4) .cse6) (or .cse7 (and .cse8 .cse9) (let ((.cse10 (let ((.cse11 (and .cse14 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))))) (or (and .cse11 .cse12) (and .cse11 .cse13))))) (or (and .cse0 (not (= (_ bv33554431 32) addflt_~ma~0)) .cse10) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) addflt_~mb~0)) (= (bvadd addflt_~ma~0 (_ bv4261412865 32)) (_ bv0 32)) .cse10)))) (let ((.cse20 (= addflt_~b |addflt_#in~b|)) (.cse31 (bvlshr |addflt_#in~a| (_ bv24 32)))) (let ((.cse16 (bvadd .cse31 (_ bv4294967168 32))) (.cse18 (let ((.cse32 (or (and .cse33 .cse12) (and .cse33 .cse13)))) (or (and .cse32 .cse20) (and .cse32 .cse9))))) (let ((.cse15 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse19 (and .cse3 (not (bvult addflt_~__retres10~0 |addflt_#in~a|)) .cse18)) (.cse17 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse21 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse16) addflt_~ea~0))) (.cse22 (bvult |addflt_#in~a| addflt_~a))) (or (and (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)) (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg (bvadd .cse15 (_ bv4294967168 32))) (_ bv4294967168 32))) addflt_~mb~0) (= .cse16 addflt_~ea~0) (or (and .cse17 .cse13 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0))) .cse18) (and .cse13 .cse19)) .cse20) (and (exists ((addflt_~a (_ BitVec 32))) (and (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (= .cse21 addflt_~mb~0) .cse12 .cse22 .cse23 .cse9) .cse8 (and (exists ((addflt_~a (_ BitVec 32))) (let ((.cse25 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse26 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse25 (_ bv4294967168 32))))) (let ((.cse24 (bvadd (bvneg (bvneg .cse26)) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse24) (bvshl .cse25 (_ bv24 32)))) (bvult |addflt_#in~a| addflt_~a) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse24)) (not (= .cse26 (_ bv0 32)))))))) .cse1 .cse2 .cse3 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse27 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))))) (let ((.cse29 (bvneg .cse27)) (.cse28 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (let ((.cse30 (bvadd .cse29 .cse28))) (and (not (= (bvadd .cse27 .cse28 .cse29) (_ bv0 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse30) (bvshl (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv24 32)))) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse30))))))) .cse18) (and (= (bvadd .cse15 (_ bv4294967169 32)) addflt_~ea~0) (exists ((v_addflt_~ma~0_91 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_91) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse12 (not (= (bvadd .cse15 (_ bv4294967041 32)) (_ bv0 32))) .cse9 .cse19) (or (and (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) .cse17 .cse18 (not (= (_ bv0 32) .cse21)) .cse22) (and (exists ((addflt_~ma~0 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor addflt_~ma~0 (bvshl (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) (not (= (bvadd .cse31 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse31 (_ bv4294967169 32)) addflt_~ea~0) .cse13 .cse20 .cse18)) (and .cse13 .cse4 .cse20))))) (or (not .cse8) (and .cse13 .cse6 .cse33) (and .cse12 .cse23 .cse9)) (or (and (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) (= (_ bv127 32) addflt_~eb~0)) .cse7 .cse5)))) [2018-12-08 17:04:18,311 INFO L448 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-12-08 17:04:18,311 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-12-08 17:04:18,311 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-12-08 17:04:18,311 INFO L448 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-12-08 17:04:18,312 INFO L444 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (let ((.cse4 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse12 (= addflt_~b |addflt_#in~b|)) (.cse5 (= addflt_~a |addflt_#in~b|)) (.cse11 (= addflt_~a |addflt_#in~a|)) (.cse0 (= addflt_~b |addflt_#in~a|))) (let ((.cse13 (let ((.cse18 (let ((.cse19 (let ((.cse21 (not (bvult addflt_~a addflt_~b)))) (or (and .cse11 .cse21) (and .cse0 .cse21))))) (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (let ((.cse20 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse19 .cse20 .cse5) (and .cse19 .cse20 .cse12)))) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvlshr (bvadd (bvneg (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (_ bv1 32)) addflt_~ma~0)) (or (and .cse19 .cse12) (and .cse19 .cse5))))))) (or .cse18 .cse18))) (.cse10 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse8 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse6 (bvadd .cse4 (_ bv4294967168 32)))) (let ((.cse9 (= (bvlshr .cse8 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse6) (_ bv4294967168 32))) addflt_~mb~0)) (.cse7 (bvadd .cse10 (_ bv4294967168 32))) (.cse1 (let ((.cse16 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse14 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse16) |addflt_#in~a|)))) (or (and .cse11 .cse14 .cse13) (and (let ((.cse15 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse15) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse15) .cse16) |addflt_#in~a|)))) (let ((.cse17 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse17) .cse16) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse17) (_ bv0 32))))) .cse14 .cse13)))))) (let ((.cse2 (and .cse9 (= .cse7 addflt_~ea~0) .cse11 .cse12 .cse1)) (.cse3 (and .cse9 (not (= (bvadd .cse10 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse10 (_ bv4294967169 32)) addflt_~ea~0) .cse11 .cse12 .cse13))) (and (not (= (_ bv0 32) |addflt_#in~b|)) (or (and .cse0 .cse1) .cse2 .cse3) (or (and (= (bvadd .cse4 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse4 (_ bv4294967041 32)) (_ bv0 32))) .cse5) .cse2 (and (= .cse6 addflt_~ea~0) (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (not (= (_ bv0 32) (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse7) addflt_~ea~0)))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (bvadd (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) addflt_~ma~0))) (not (= (_ bv0 32) (bvadd (bvneg .cse8) addflt_~ma~0)))) .cse3) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))) (not (= (_ bv0 32) |addflt_#in~a|))))))) [2018-12-08 17:04:18,312 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-08 17:04:18,312 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-08 17:04:18,312 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-08 17:04:18,312 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-08 17:04:18,312 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-08 17:04:18,312 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-08 17:04:18,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-08 17:04:18,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-08 17:04:18,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,323 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] [2018-12-08 17:04:18,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-08 17:04:18,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] [2018-12-08 17:04:18,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,333 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-08 17:04:18,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 05:04:18 BoogieIcfgContainer [2018-12-08 17:04:18,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 17:04:18,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 17:04:18,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 17:04:18,336 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 17:04:18,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 05:00:39" (3/4) ... [2018-12-08 17:04:18,339 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 17:04:18,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 17:04:18,343 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-08 17:04:18,344 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 17:04:18,344 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-12-08 17:04:18,344 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-08 17:04:18,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-08 17:04:18,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-08 17:04:18,347 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 17:04:18,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-12-08 17:04:18,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-08 17:04:18,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-08 17:04:18,365 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-08 17:04:18,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) || a == r_add [2018-12-08 17:04:18,366 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) && (!(0bv32 == \old(b)) || __retres10 == \old(a))) && ((!(4294967295bv32 == \old(b)) || (0bv32 == \old(a) && a == \old(b))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))))) && (((((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && ((((~bvadd64(__retres10, 1bv32) == 0bv32 && a == \old(a)) && !(0bv32 == ~bvand64(33554432bv32, ma))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))) || (a == \old(a) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))))) && b == \old(b)) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b))) || 0bv32 == \old(a)) || ((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || (((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_91 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_91), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && b == \old(a)) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvadd64(__retres10, 1bv32) == 0bv32) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a)) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || ((a == \old(a) && 0bv32 == \old(b)) && b == \old(b)))) && ((!(0bv32 == \old(a)) || ((a == \old(a) && __retres10 == \old(a)) && !~bvult64(a, b))) || ((b == \old(a) && __retres10 == \old(b)) && a == \old(b)))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) [2018-12-08 17:04:18,381 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4666e7de-00d5-49b6-ae3e-132e56424742/bin-2019/utaipan/witness.graphml [2018-12-08 17:04:18,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 17:04:18,381 INFO L168 Benchmark]: Toolchain (without parser) took 219742.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 81.9 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.88 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.05 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: RCFGBuilder took 262.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: TraceAbstraction took 219184.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.3 MB). Peak memory consumption was 442.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,382 INFO L168 Benchmark]: Witness Printer took 44.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-12-08 17:04:18,383 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.88 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.05 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -206.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 262.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 219184.79 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.3 MB). Peak memory consumption was 442.7 MB. Max. memory is 11.5 GB. * Witness Printer took 44.62 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 25]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 301]: Loop Invariant [2018-12-08 17:04:18,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-08 17:04:18,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] Derived loop invariant: (b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) || a == r_add - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-12-08 17:04:18,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_91,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-08 17:04:18,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] Derived loop invariant: ((((((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) && (!(0bv32 == \old(b)) || __retres10 == \old(a))) && ((!(4294967295bv32 == \old(b)) || (0bv32 == \old(a) && a == \old(b))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))) || (((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) && (((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && b == \old(a)) || ((4294967295bv32 == \old(b) && ~bvadd64(a, 1bv32) == 0bv32) && a == \old(a)))))) && (((((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && ((((~bvadd64(__retres10, 1bv32) == 0bv32 && a == \old(a)) && !(0bv32 == ~bvand64(33554432bv32, ma))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))) || (a == \old(a) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))))) && b == \old(b)) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && ~bvult64(\old(a), a)) && __retres10 == \old(b)) && a == \old(b))) || 0bv32 == \old(a)) || ((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || (((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_91 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_91), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && b == \old(a)) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b)) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && !~bvult64(__retres10, \old(a))) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvadd64(__retres10, 1bv32) == 0bv32) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b)))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a)) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)) && ((((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && b == \old(b)) || (((!~bvult64(a, b) && b == \old(a)) || (!~bvult64(a, b) && a == \old(a))) && a == \old(b))))) || ((a == \old(a) && 0bv32 == \old(b)) && b == \old(b)))) && ((!(0bv32 == \old(a)) || ((a == \old(a) && __retres10 == \old(a)) && !~bvult64(a, b))) || ((b == \old(a) && __retres10 == \old(b)) && a == \old(b)))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. SAFE Result, 219.1s OverallTime, 43 OverallIterations, 4 TraceHistogramMax, 62.7s AutomataDifference, 0.0s DeadEndRemovalTime, 128.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4779 SDtfs, 2642 SDslu, 28255 SDs, 0 SdLazy, 7608 SolverSat, 427 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 43.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3898 GetRequests, 3399 SyntacticMatches, 29 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 40.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=474occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 43 MinimizatonAttempts, 1486 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 452 PreInvPairs, 595 NumberOfFragments, 4571 HoareAnnotationTreeSize, 452 FomulaSimplifications, 11799560 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 531238 FormulaSimplificationTreeSizeReductionInter, 128.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 3038 NumberOfCodeBlocks, 3038 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 3659 ConstructedInterpolants, 104 QuantifiedInterpolants, 672614 SizeOfPredicates, 269 NumberOfNonLiveVariables, 5248 ConjunctsInSsa, 493 ConjunctsInUnsatCore, 66 InterpolantComputations, 36 PerfectInterpolantSequences, 1196/1316 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...