./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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-5842f4b [2018-11-18 14:58:59,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:58:59,389 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:58:59,397 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:58:59,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:58:59,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:58:59,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:58:59,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:58:59,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:58:59,401 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:58:59,401 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:58:59,402 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:58:59,402 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:58:59,403 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:58:59,404 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:58:59,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:58:59,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:58:59,406 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:58:59,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:58:59,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:58:59,409 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:58:59,410 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:58:59,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:58:59,412 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:58:59,412 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:58:59,413 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:58:59,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:58:59,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:58:59,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:58:59,415 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:58:59,415 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:58:59,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:58:59,416 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:58:59,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:58:59,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:58:59,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:58:59,417 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 14:58:59,428 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:58:59,428 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:58:59,429 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:58:59,429 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:58:59,429 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:58:59,429 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:58:59,429 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:58:59,429 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 14:58:59,429 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:58:59,430 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:58:59,430 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 14:58:59,430 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 14:58:59,430 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:58:59,430 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:58:59,431 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:58:59,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:58:59,432 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:58:59,433 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:58:59,433 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 14:58:59,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:58:59,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 14:58:59,434 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 14:58:59,434 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_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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-11-18 14:58:59,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:58:59,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:58:59,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:58:59,470 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:58:59,470 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:58:59,471 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:58:59,512 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/d72e7be57/5b18fd8e250f470396d12c7ca402860a/FLAG67ca1a52a [2018-11-18 14:58:59,931 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:58:59,932 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:58:59,937 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/d72e7be57/5b18fd8e250f470396d12c7ca402860a/FLAG67ca1a52a [2018-11-18 14:58:59,946 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/d72e7be57/5b18fd8e250f470396d12c7ca402860a [2018-11-18 14:58:59,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:58:59,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:58:59,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:58:59,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:58:59,952 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:58:59,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:58:59" (1/1) ... [2018-11-18 14:58:59,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228ed96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:58:59, skipping insertion in model container [2018-11-18 14:58:59,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:58:59" (1/1) ... [2018-11-18 14:58:59,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:58:59,988 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:59:00,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:00,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:59:00,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:00,163 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:59:00,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00 WrapperNode [2018-11-18 14:59:00,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:59:00,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:59:00,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:59:00,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:59:00,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:59:00,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:59:00,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:59:00,214 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:59:00,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... [2018-11-18 14:59:00,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:59:00,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:59:00,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:59:00,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:59:00,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:59:00,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:59:00,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:59:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 14:59:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 14:59:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:59:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:59:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:59:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:59:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-18 14:59:00,267 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-18 14:59:00,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 14:59:00,268 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 14:59:00,532 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:59:00,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:00 BoogieIcfgContainer [2018-11-18 14:59:00,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:59:00,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:59:00,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:59:00,535 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:59:00,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:58:59" (1/3) ... [2018-11-18 14:59:00,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694109a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:00, skipping insertion in model container [2018-11-18 14:59:00,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:00" (2/3) ... [2018-11-18 14:59:00,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694109a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:00, skipping insertion in model container [2018-11-18 14:59:00,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:00" (3/3) ... [2018-11-18 14:59:00,537 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:59:00,543 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:59:00,548 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:59:00,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:59:00,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:59:00,578 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:59:00,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:59:00,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:59:00,578 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:59:00,578 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:59:00,578 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:59:00,578 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:59:00,594 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-11-18 14:59:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 14:59:00,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:00,600 INFO L375 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-11-18 14:59:00,602 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:00,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1391936391, now seen corresponding path program 1 times [2018-11-18 14:59:00,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:00,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:00,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:00,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:00,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:00,832 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-18 14:59:00,834 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [64], [65], [69], [71], [73], [75], [78], [91], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:00,865 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:00,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:00,960 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:59:00,961 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-11-18 14:59:00,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:00,965 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:59:01,020 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 68.83% of their original sizes. [2018-11-18 14:59:01,020 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:59:01,088 INFO L415 sIntCurrentIteration]: We unified 35 AI predicates to 35 [2018-11-18 14:59:01,088 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:59:01,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:59:01,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-18 14:59:01,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:01,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:59:01,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:59:01,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:59:01,098 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 12 states. [2018-11-18 14:59:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:02,033 INFO L93 Difference]: Finished difference Result 228 states and 370 transitions. [2018-11-18 14:59:02,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 14:59:02,034 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-18 14:59:02,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:02,045 INFO L225 Difference]: With dead ends: 228 [2018-11-18 14:59:02,045 INFO L226 Difference]: Without dead ends: 144 [2018-11-18 14:59:02,048 INFO L604 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-11-18 14:59:02,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-18 14:59:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 132. [2018-11-18 14:59:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 14:59:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2018-11-18 14:59:02,094 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 36 [2018-11-18 14:59:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:02,095 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2018-11-18 14:59:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:59:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2018-11-18 14:59:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 14:59:02,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:02,097 INFO L375 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-11-18 14:59:02,098 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:02,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:02,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2027314087, now seen corresponding path program 1 times [2018-11-18 14:59:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:02,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:02,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:02,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:02,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:02,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:02,232 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-18 14:59:02,232 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [64], [65], [69], [71], [73], [75], [80], [85], [87], [93], [98], [100], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:02,234 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:02,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:02,254 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:59:02,254 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-11-18 14:59:02,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:02,256 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:59:02,284 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 62.65% of their original sizes. [2018-11-18 14:59:02,285 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:59:02,400 INFO L415 sIntCurrentIteration]: We unified 39 AI predicates to 39 [2018-11-18 14:59:02,400 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:59:02,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:59:02,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [9] total 24 [2018-11-18 14:59:02,401 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:02,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:59:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:59:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:59:02,402 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand 17 states. [2018-11-18 14:59:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:03,218 INFO L93 Difference]: Finished difference Result 189 states and 266 transitions. [2018-11-18 14:59:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 14:59:03,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-18 14:59:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:03,219 INFO L225 Difference]: With dead ends: 189 [2018-11-18 14:59:03,219 INFO L226 Difference]: Without dead ends: 150 [2018-11-18 14:59:03,220 INFO L604 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-11-18 14:59:03,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-18 14:59:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-11-18 14:59:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 14:59:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2018-11-18 14:59:03,232 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 40 [2018-11-18 14:59:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:03,233 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2018-11-18 14:59:03,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:59:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2018-11-18 14:59:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:03,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:03,234 INFO L375 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] [2018-11-18 14:59:03,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:03,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2056860995, now seen corresponding path program 1 times [2018-11-18 14:59:03,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:03,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:03,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:03,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:03,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:03,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:03,357 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-18 14:59:03,357 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [36], [40], [46], [50], [56], [64], [65], [69], [71], [73], [75], [80], [85], [87], [93], [96], [100], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:03,358 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:03,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:03,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-18 14:59:03,403 INFO L272 AbstractInterpreter]: Visited 34 different actions 91 times. Merged at 13 different actions 28 times. Never widened. Performed 277 root evaluator evaluations with a maximum evaluation depth of 4. Performed 277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 14:59:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:03,405 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-18 14:59:03,427 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 64.69% of their original sizes. [2018-11-18 14:59:03,427 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-18 14:59:03,597 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-11-18 14:59:03,598 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-18 14:59:03,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 14:59:03,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [9] total 29 [2018-11-18 14:59:03,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:03,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 14:59:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 14:59:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:59:03,599 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand 22 states. [2018-11-18 14:59:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:08,586 INFO L93 Difference]: Finished difference Result 385 states and 585 transitions. [2018-11-18 14:59:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 14:59:08,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-11-18 14:59:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:08,588 INFO L225 Difference]: With dead ends: 385 [2018-11-18 14:59:08,588 INFO L226 Difference]: Without dead ends: 333 [2018-11-18 14:59:08,589 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 14:59:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-18 14:59:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 178. [2018-11-18 14:59:08,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-18 14:59:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 250 transitions. [2018-11-18 14:59:08,609 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 250 transitions. Word has length 45 [2018-11-18 14:59:08,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:08,609 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 250 transitions. [2018-11-18 14:59:08,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 14:59:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 250 transitions. [2018-11-18 14:59:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:08,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:08,612 INFO L375 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] [2018-11-18 14:59:08,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:08,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1999602693, now seen corresponding path program 1 times [2018-11-18 14:59:08,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:08,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:08,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 14:59:08,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:08,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:08,765 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-18 14:59:08,765 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [36], [40], [46], [50], [56], [64], [65], [69], [71], [73], [75], [80], [85], [87], [93], [96], [100], [196], [201], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:08,767 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:08,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:08,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:59:08,790 INFO L272 AbstractInterpreter]: Visited 38 different actions 94 times. Merged at 13 different actions 28 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 6. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 14:59:08,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:08,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:59:08,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:08,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:08,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:08,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:59:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:08,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:59:08,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:09,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:59:09,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2018-11-18 14:59:09,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:59:09,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 14:59:09,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 14:59:09,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:59:09,193 INFO L87 Difference]: Start difference. First operand 178 states and 250 transitions. Second operand 17 states. [2018-11-18 14:59:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:09,799 INFO L93 Difference]: Finished difference Result 315 states and 453 transitions. [2018-11-18 14:59:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 14:59:09,799 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-11-18 14:59:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:09,802 INFO L225 Difference]: With dead ends: 315 [2018-11-18 14:59:09,802 INFO L226 Difference]: Without dead ends: 266 [2018-11-18 14:59:09,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 14:59:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-18 14:59:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 214. [2018-11-18 14:59:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-18 14:59:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 297 transitions. [2018-11-18 14:59:09,821 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 297 transitions. Word has length 45 [2018-11-18 14:59:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:09,821 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 297 transitions. [2018-11-18 14:59:09,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 14:59:09,821 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 297 transitions. [2018-11-18 14:59:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:09,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:09,824 INFO L375 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] [2018-11-18 14:59:09,824 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:09,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash -808054089, now seen corresponding path program 1 times [2018-11-18 14:59:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:09,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:09,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:09,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:09,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:09,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:09,920 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-18 14:59:09,920 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [36], [40], [46], [50], [56], [64], [65], [69], [71], [73], [75], [80], [83], [87], [93], [96], [100], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:09,921 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:09,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:09,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:59:09,946 INFO L272 AbstractInterpreter]: Visited 38 different actions 87 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-11-18 14:59:09,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:09,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:59:09,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:09,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:09,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:09,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:59:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:09,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:59:10,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:10,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:59:10,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 18 [2018-11-18 14:59:10,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:10,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:59:10,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:59:10,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:59:10,245 INFO L87 Difference]: Start difference. First operand 214 states and 297 transitions. Second operand 6 states. [2018-11-18 14:59:10,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:10,345 INFO L93 Difference]: Finished difference Result 356 states and 515 transitions. [2018-11-18 14:59:10,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:59:10,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-18 14:59:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:10,348 INFO L225 Difference]: With dead ends: 356 [2018-11-18 14:59:10,348 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 14:59:10,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-11-18 14:59:10,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 14:59:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2018-11-18 14:59:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 14:59:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 355 transitions. [2018-11-18 14:59:10,365 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 355 transitions. Word has length 45 [2018-11-18 14:59:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:10,365 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 355 transitions. [2018-11-18 14:59:10,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:59:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 355 transitions. [2018-11-18 14:59:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:10,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:10,367 INFO L375 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] [2018-11-18 14:59:10,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:10,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1201081099, now seen corresponding path program 1 times [2018-11-18 14:59:10,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:10,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:10,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:10,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:10,444 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-11-18 14:59:10,444 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [36], [40], [46], [50], [56], [64], [65], [69], [71], [73], [75], [80], [83], [87], [93], [98], [100], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:10,445 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:10,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:10,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:59:10,466 INFO L272 AbstractInterpreter]: Visited 38 different actions 81 times. Merged at 8 different actions 17 times. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 6. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 14:59:10,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:10,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:59:10,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:10,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:10,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:10,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:59:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:10,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:10,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 14:59:10,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:59:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 10] total 22 [2018-11-18 14:59:10,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:10,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-11-18 14:59:10,746 INFO L87 Difference]: Start difference. First operand 254 states and 355 transitions. Second operand 8 states. [2018-11-18 14:59:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:12,984 INFO L93 Difference]: Finished difference Result 338 states and 477 transitions. [2018-11-18 14:59:12,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:59:12,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-18 14:59:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:12,987 INFO L225 Difference]: With dead ends: 338 [2018-11-18 14:59:12,987 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 14:59:12,988 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-11-18 14:59:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 14:59:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 272. [2018-11-18 14:59:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-18 14:59:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 377 transitions. [2018-11-18 14:59:13,006 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 377 transitions. Word has length 45 [2018-11-18 14:59:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:13,006 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 377 transitions. [2018-11-18 14:59:13,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:59:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 377 transitions. [2018-11-18 14:59:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:13,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:13,008 INFO L375 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] [2018-11-18 14:59:13,008 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:13,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1143822797, now seen corresponding path program 1 times [2018-11-18 14:59:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:13,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:13,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:13,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 14:59:13,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:13,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:13,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:13,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:59:13,089 INFO L87 Difference]: Start difference. First operand 272 states and 377 transitions. Second operand 8 states. [2018-11-18 14:59:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:13,241 INFO L93 Difference]: Finished difference Result 343 states and 481 transitions. [2018-11-18 14:59:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:59:13,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-18 14:59:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:13,244 INFO L225 Difference]: With dead ends: 343 [2018-11-18 14:59:13,245 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 14:59:13,245 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:59:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 14:59:13,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 255. [2018-11-18 14:59:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-18 14:59:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 354 transitions. [2018-11-18 14:59:13,264 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 354 transitions. Word has length 45 [2018-11-18 14:59:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:13,265 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 354 transitions. [2018-11-18 14:59:13,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:59:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 354 transitions. [2018-11-18 14:59:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 14:59:13,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:13,266 INFO L375 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-11-18 14:59:13,267 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:13,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1766323997, now seen corresponding path program 1 times [2018-11-18 14:59:13,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:13,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:13,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:13,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:13,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:13,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:13,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:13,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:13,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:13,294 INFO L87 Difference]: Start difference. First operand 255 states and 354 transitions. Second operand 4 states. [2018-11-18 14:59:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:13,327 INFO L93 Difference]: Finished difference Result 381 states and 545 transitions. [2018-11-18 14:59:13,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:13,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 14:59:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:13,329 INFO L225 Difference]: With dead ends: 381 [2018-11-18 14:59:13,329 INFO L226 Difference]: Without dead ends: 298 [2018-11-18 14:59:13,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-18 14:59:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-18 14:59:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 254. [2018-11-18 14:59:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 14:59:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 344 transitions. [2018-11-18 14:59:13,344 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 344 transitions. Word has length 49 [2018-11-18 14:59:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:13,344 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 344 transitions. [2018-11-18 14:59:13,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 344 transitions. [2018-11-18 14:59:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:13,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:13,345 INFO L375 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-11-18 14:59:13,345 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:13,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1565508307, now seen corresponding path program 1 times [2018-11-18 14:59:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:13,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:13,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:13,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:13,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:13,383 INFO L87 Difference]: Start difference. First operand 254 states and 344 transitions. Second operand 4 states. [2018-11-18 14:59:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:13,401 INFO L93 Difference]: Finished difference Result 275 states and 371 transitions. [2018-11-18 14:59:13,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:59:13,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 14:59:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:13,410 INFO L225 Difference]: With dead ends: 275 [2018-11-18 14:59:13,410 INFO L226 Difference]: Without dead ends: 268 [2018-11-18 14:59:13,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-18 14:59:13,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-11-18 14:59:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2018-11-18 14:59:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-18 14:59:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 350 transitions. [2018-11-18 14:59:13,421 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 350 transitions. Word has length 50 [2018-11-18 14:59:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:13,421 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 350 transitions. [2018-11-18 14:59:13,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 350 transitions. [2018-11-18 14:59:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:13,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:13,422 INFO L375 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-11-18 14:59:13,422 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:13,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 209499055, now seen corresponding path program 1 times [2018-11-18 14:59:13,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:13,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:13,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:59:13,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:13,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:59:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:59:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:59:13,444 INFO L87 Difference]: Start difference. First operand 260 states and 350 transitions. Second operand 5 states. [2018-11-18 14:59:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:13,469 INFO L93 Difference]: Finished difference Result 267 states and 356 transitions. [2018-11-18 14:59:13,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:13,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 14:59:13,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:13,471 INFO L225 Difference]: With dead ends: 267 [2018-11-18 14:59:13,471 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 14:59:13,471 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-11-18 14:59:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 14:59:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2018-11-18 14:59:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 14:59:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 340 transitions. [2018-11-18 14:59:13,482 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 340 transitions. Word has length 50 [2018-11-18 14:59:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:13,483 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 340 transitions. [2018-11-18 14:59:13,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:59:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 340 transitions. [2018-11-18 14:59:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:13,484 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:13,484 INFO L375 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] [2018-11-18 14:59:13,484 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:13,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2106274525, now seen corresponding path program 2 times [2018-11-18 14:59:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:13,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:13,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 14:59:13,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:13,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 14:59:13,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:13,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:59:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:59:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:59:13,573 INFO L87 Difference]: Start difference. First operand 254 states and 340 transitions. Second operand 10 states. [2018-11-18 14:59:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:14,323 INFO L93 Difference]: Finished difference Result 403 states and 552 transitions. [2018-11-18 14:59:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 14:59:14,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-18 14:59:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:14,325 INFO L225 Difference]: With dead ends: 403 [2018-11-18 14:59:14,325 INFO L226 Difference]: Without dead ends: 336 [2018-11-18 14:59:14,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:59:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-18 14:59:14,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 319. [2018-11-18 14:59:14,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-18 14:59:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 427 transitions. [2018-11-18 14:59:14,344 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 427 transitions. Word has length 50 [2018-11-18 14:59:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:14,344 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 427 transitions. [2018-11-18 14:59:14,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:59:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 427 transitions. [2018-11-18 14:59:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:14,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:14,345 INFO L375 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] [2018-11-18 14:59:14,345 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:14,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2131434469, now seen corresponding path program 1 times [2018-11-18 14:59:14,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:14,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 14:59:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:14,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 14:59:14,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:14,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 14:59:14,546 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 14:59:14,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:59:14,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:59:14,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:59:14,547 INFO L87 Difference]: Start difference. First operand 319 states and 427 transitions. Second operand 13 states. [2018-11-18 14:59:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:14,993 INFO L93 Difference]: Finished difference Result 348 states and 458 transitions. [2018-11-18 14:59:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:59:14,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-18 14:59:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:14,995 INFO L225 Difference]: With dead ends: 348 [2018-11-18 14:59:14,995 INFO L226 Difference]: Without dead ends: 346 [2018-11-18 14:59:14,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:59:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-18 14:59:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 323. [2018-11-18 14:59:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-18 14:59:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 430 transitions. [2018-11-18 14:59:15,016 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 430 transitions. Word has length 50 [2018-11-18 14:59:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:15,016 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 430 transitions. [2018-11-18 14:59:15,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:59:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 430 transitions. [2018-11-18 14:59:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:15,017 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:15,017 INFO L375 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] [2018-11-18 14:59:15,017 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:15,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:15,017 INFO L82 PathProgramCache]: Analyzing trace with hash 516762145, now seen corresponding path program 1 times [2018-11-18 14:59:15,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:15,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:15,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:15,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:15,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:15,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 14:59:15,090 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-18 14:59:15,090 INFO L202 CegarAbsIntRunner]: [0], [1], [4], [6], [36], [40], [46], [50], [52], [56], [62], [64], [65], [69], [71], [73], [75], [80], [83], [87], [93], [96], [100], [196], [199], [207], [231], [234], [236], [242], [243], [244], [246], [247], [248], [249], [250], [251], [252], [260] [2018-11-18 14:59:15,091 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 14:59:15,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 14:59:15,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 14:59:15,132 INFO L272 AbstractInterpreter]: Visited 40 different actions 147 times. Merged at 14 different actions 57 times. Never widened. Performed 397 root evaluator evaluations with a maximum evaluation depth of 6. Performed 397 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 14:59:15,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:15,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 14:59:15,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:15,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:15,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:15,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 14:59:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:15,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:15,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:15,904 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-11-18 14:59:20,416 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-18 14:59:21,090 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-11-18 14:59:21,725 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-11-18 14:59:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:21,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:59:21,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2018-11-18 14:59:21,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 14:59:21,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:21,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:21,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=87, Unknown=7, NotChecked=60, Total=182 [2018-11-18 14:59:21,749 INFO L87 Difference]: Start difference. First operand 323 states and 430 transitions. Second operand 8 states. [2018-11-18 14:59:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:22,496 INFO L93 Difference]: Finished difference Result 403 states and 534 transitions. [2018-11-18 14:59:22,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:59:22,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 14:59:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:22,498 INFO L225 Difference]: With dead ends: 403 [2018-11-18 14:59:22,498 INFO L226 Difference]: Without dead ends: 362 [2018-11-18 14:59:22,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=38, Invalid=122, Unknown=8, NotChecked=72, Total=240 [2018-11-18 14:59:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-18 14:59:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 348. [2018-11-18 14:59:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-11-18 14:59:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 458 transitions. [2018-11-18 14:59:22,512 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 458 transitions. Word has length 50 [2018-11-18 14:59:22,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:22,512 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 458 transitions. [2018-11-18 14:59:22,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:59:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 458 transitions. [2018-11-18 14:59:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:22,513 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:22,513 INFO L375 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] [2018-11-18 14:59:22,513 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:22,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:22,513 INFO L82 PathProgramCache]: Analyzing trace with hash 574020447, now seen corresponding path program 1 times [2018-11-18 14:59:22,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 14:59:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:22,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 14:59:22,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 14:59:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:59:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 14:59:22,541 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 14:59:22,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:59:22 BoogieIcfgContainer [2018-11-18 14:59:22,562 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 14:59:22,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 14:59:22,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 14:59:22,563 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 14:59:22,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:00" (3/4) ... [2018-11-18 14:59:22,565 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 14:59:22,565 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 14:59:22,565 INFO L168 Benchmark]: Toolchain (without parser) took 22617.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 959.2 MB in the beginning and 896.4 MB in the end (delta: 62.9 MB). Peak memory consumption was 293.0 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,566 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:59:22,566 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,567 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,567 INFO L168 Benchmark]: Boogie Preprocessor took 18.44 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,568 INFO L168 Benchmark]: RCFGBuilder took 300.14 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,568 INFO L168 Benchmark]: TraceAbstraction took 22029.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 896.4 MB in the end (delta: 208.0 MB). Peak memory consumption was 299.8 MB. Max. memory is 11.5 GB. [2018-11-18 14:59:22,568 INFO L168 Benchmark]: Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 896.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 14:59:22,571 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 214.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.0 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.44 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 300.14 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: 28.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22029.41 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 91.8 MB). Free memory was 1.1 GB in the beginning and 896.4 MB in the end (delta: 208.0 MB). Peak memory consumption was 299.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.61 ms. Allocated memory is still 1.3 GB. Free memory is still 896.4 MB. 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] RET return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] 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] RET return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] 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=4278190080, e=0, res=4278190080] [L70] RET return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-36028797035741184, __retres4=4278190080, e=0, res=4278190080] [L242] EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-36028797035741184, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=4278190080, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=4278190080, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=4278190080, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=4278190080, 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=4278190080, 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=4278190080, 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)=4278190080] [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)=4278190080, a=4294967295, b=4278190080] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4278190080, a=4294967295, b=4278190080] [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)=4278190080, a=4294967295, b=4278190080, ea=127, eb=2147483519] [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, 79 locations, 1 error locations. UNSAFE Result, 21.9s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1502 SDtfs, 1191 SDslu, 10309 SDs, 0 SdLazy, 2070 SolverSat, 121 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 623 GetRequests, 419 SyntacticMatches, 4 SemanticMatches, 200 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 9.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 7 AbstIntIterations, 3 AbstIntStrong, 0.6402138821630345 AbsIntWeakeningRatio, 1.8898305084745763 AbsIntAvgWeakeningVarsNumRemoved, 0.864406779661017 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 390 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 949 ConstructedInterpolants, 51 QuantifiedInterpolants, 126648 SizeOfPredicates, 21 NumberOfNonLiveVariables, 525 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 277/337 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-5842f4b [2018-11-18 14:59:24,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 14:59:24,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 14:59:24,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 14:59:24,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 14:59:24,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 14:59:24,017 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 14:59:24,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 14:59:24,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 14:59:24,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 14:59:24,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 14:59:24,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 14:59:24,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 14:59:24,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 14:59:24,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 14:59:24,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 14:59:24,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 14:59:24,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 14:59:24,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 14:59:24,028 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 14:59:24,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 14:59:24,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 14:59:24,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 14:59:24,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 14:59:24,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 14:59:24,032 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 14:59:24,033 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 14:59:24,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 14:59:24,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 14:59:24,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 14:59:24,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 14:59:24,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 14:59:24,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 14:59:24,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 14:59:24,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 14:59:24,037 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 14:59:24,037 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 14:59:24,048 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 14:59:24,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 14:59:24,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 14:59:24,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 14:59:24,049 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 14:59:24,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 14:59:24,050 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 14:59:24,050 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 14:59:24,050 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 14:59:24,050 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 14:59:24,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 14:59:24,052 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 14:59:24,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 14:59:24,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 14:59:24,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:59:24,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 14:59:24,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 14:59:24,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 14:59:24,056 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 14:59:24,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 14:59:24,056 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 14:59:24,056 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 14:59:24,056 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_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/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-11-18 14:59:24,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 14:59:24,099 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 14:59:24,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 14:59:24,104 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 14:59:24,104 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 14:59:24,104 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:59:24,143 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/21f558198/ab7b90070a6f48899714323b90be989d/FLAG57ac5ab3d [2018-11-18 14:59:24,491 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 14:59:24,492 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:59:24,496 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/21f558198/ab7b90070a6f48899714323b90be989d/FLAG57ac5ab3d [2018-11-18 14:59:24,912 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/data/21f558198/ab7b90070a6f48899714323b90be989d [2018-11-18 14:59:24,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 14:59:24,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 14:59:24,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 14:59:24,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 14:59:24,919 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 14:59:24,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:59:24" (1/1) ... [2018-11-18 14:59:24,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3270a5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:24, skipping insertion in model container [2018-11-18 14:59:24,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:59:24" (1/1) ... [2018-11-18 14:59:24,927 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 14:59:24,948 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 14:59:25,096 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:25,100 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 14:59:25,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 14:59:25,145 INFO L195 MainTranslator]: Completed translation [2018-11-18 14:59:25,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25 WrapperNode [2018-11-18 14:59:25,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 14:59:25,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 14:59:25,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 14:59:25,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 14:59:25,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,157 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 14:59:25,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 14:59:25,163 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 14:59:25,163 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 14:59:25,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... [2018-11-18 14:59:25,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 14:59:25,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 14:59:25,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 14:59:25,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 14:59:25,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 14:59:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 14:59:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 14:59:25,257 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 14:59:25,257 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 14:59:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 14:59:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 14:59:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 14:59:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 14:59:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-18 14:59:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-18 14:59:25,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 14:59:25,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 14:59:25,531 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 14:59:25,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:25 BoogieIcfgContainer [2018-11-18 14:59:25,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 14:59:25,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 14:59:25,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 14:59:25,536 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 14:59:25,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:59:24" (1/3) ... [2018-11-18 14:59:25,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78744d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:25, skipping insertion in model container [2018-11-18 14:59:25,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:59:25" (2/3) ... [2018-11-18 14:59:25,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78744d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:59:25, skipping insertion in model container [2018-11-18 14:59:25,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:25" (3/3) ... [2018-11-18 14:59:25,539 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 14:59:25,547 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 14:59:25,552 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 14:59:25,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 14:59:25,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 14:59:25,581 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 14:59:25,581 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 14:59:25,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 14:59:25,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 14:59:25,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 14:59:25,582 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 14:59:25,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 14:59:25,582 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 14:59:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-11-18 14:59:25,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 14:59:25,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:25,597 INFO L375 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-11-18 14:59:25,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:25,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1391936391, now seen corresponding path program 1 times [2018-11-18 14:59:25,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:25,605 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:25,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:25,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:25,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:25,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:25,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:25,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:25,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:25,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:25,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 14:59:25,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 9 [2018-11-18 14:59:25,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 14:59:25,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 14:59:25,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 14:59:25,925 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 9 states. [2018-11-18 14:59:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:26,154 INFO L93 Difference]: Finished difference Result 203 states and 322 transitions. [2018-11-18 14:59:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:59:26,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-18 14:59:26,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:26,165 INFO L225 Difference]: With dead ends: 203 [2018-11-18 14:59:26,165 INFO L226 Difference]: Without dead ends: 122 [2018-11-18 14:59:26,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:59:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-18 14:59:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2018-11-18 14:59:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-18 14:59:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2018-11-18 14:59:26,208 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 36 [2018-11-18 14:59:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:26,208 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2018-11-18 14:59:26,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 14:59:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2018-11-18 14:59:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 14:59:26,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:26,211 INFO L375 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] [2018-11-18 14:59:26,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:26,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:26,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1181325591, now seen corresponding path program 1 times [2018-11-18 14:59:26,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:26,212 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:26,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:26,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:26,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:26,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:26,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:26,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:26,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 14:59:26,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:26,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 14:59:26,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 10, 6] total 14 [2018-11-18 14:59:26,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 14:59:26,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 14:59:26,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-18 14:59:26,620 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand 14 states. [2018-11-18 14:59:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:26,945 INFO L93 Difference]: Finished difference Result 346 states and 548 transitions. [2018-11-18 14:59:26,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:59:26,947 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 41 [2018-11-18 14:59:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:26,951 INFO L225 Difference]: With dead ends: 346 [2018-11-18 14:59:26,951 INFO L226 Difference]: Without dead ends: 276 [2018-11-18 14:59:26,952 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-11-18 14:59:26,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-11-18 14:59:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 158. [2018-11-18 14:59:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-18 14:59:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 239 transitions. [2018-11-18 14:59:26,975 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 239 transitions. Word has length 41 [2018-11-18 14:59:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:26,975 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 239 transitions. [2018-11-18 14:59:26,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 14:59:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 239 transitions. [2018-11-18 14:59:26,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:26,977 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:26,977 INFO L375 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] [2018-11-18 14:59:26,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:26,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:26,979 INFO L82 PathProgramCache]: Analyzing trace with hash -808054089, now seen corresponding path program 1 times [2018-11-18 14:59:26,979 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:26,979 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:27,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:27,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:27,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:27,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:59:27,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:59:27,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:59:27,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:59:27,039 INFO L87 Difference]: Start difference. First operand 158 states and 239 transitions. Second operand 6 states. [2018-11-18 14:59:27,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:27,101 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2018-11-18 14:59:27,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:59:27,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-18 14:59:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:27,104 INFO L225 Difference]: With dead ends: 330 [2018-11-18 14:59:27,104 INFO L226 Difference]: Without dead ends: 248 [2018-11-18 14:59:27,105 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-11-18 14:59:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-18 14:59:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-11-18 14:59:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-18 14:59:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 362 transitions. [2018-11-18 14:59:27,121 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 362 transitions. Word has length 45 [2018-11-18 14:59:27,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:27,121 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 362 transitions. [2018-11-18 14:59:27,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:59:27,121 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 362 transitions. [2018-11-18 14:59:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:27,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:27,123 INFO L375 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] [2018-11-18 14:59:27,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:27,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:27,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1201081099, now seen corresponding path program 1 times [2018-11-18 14:59:27,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:27,124 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:27,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:27,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:27,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:27,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:27,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:27,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 14:59:27,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:27,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:27,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-18 14:59:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8, 12] total 18 [2018-11-18 14:59:27,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 14:59:27,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 14:59:27,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-18 14:59:27,452 INFO L87 Difference]: Start difference. First operand 244 states and 362 transitions. Second operand 18 states. [2018-11-18 14:59:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:27,996 INFO L93 Difference]: Finished difference Result 393 states and 579 transitions. [2018-11-18 14:59:27,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 14:59:27,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2018-11-18 14:59:27,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:27,998 INFO L225 Difference]: With dead ends: 393 [2018-11-18 14:59:27,998 INFO L226 Difference]: Without dead ends: 303 [2018-11-18 14:59:27,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 158 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-11-18 14:59:28,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-18 14:59:28,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2018-11-18 14:59:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-18 14:59:28,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 408 transitions. [2018-11-18 14:59:28,018 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 408 transitions. Word has length 45 [2018-11-18 14:59:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:28,018 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 408 transitions. [2018-11-18 14:59:28,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 14:59:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 408 transitions. [2018-11-18 14:59:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 14:59:28,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:28,021 INFO L375 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] [2018-11-18 14:59:28,021 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:28,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:28,022 INFO L82 PathProgramCache]: Analyzing trace with hash 965524079, now seen corresponding path program 1 times [2018-11-18 14:59:28,022 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:28,022 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:28,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:28,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:28,084 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 14:59:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:59:28,086 INFO L87 Difference]: Start difference. First operand 282 states and 408 transitions. Second operand 8 states. [2018-11-18 14:59:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:28,175 INFO L93 Difference]: Finished difference Result 323 states and 463 transitions. [2018-11-18 14:59:28,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 14:59:28,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-18 14:59:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:28,180 INFO L225 Difference]: With dead ends: 323 [2018-11-18 14:59:28,180 INFO L226 Difference]: Without dead ends: 285 [2018-11-18 14:59:28,181 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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-11-18 14:59:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-18 14:59:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 275. [2018-11-18 14:59:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-11-18 14:59:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 395 transitions. [2018-11-18 14:59:28,196 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 395 transitions. Word has length 45 [2018-11-18 14:59:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:28,197 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 395 transitions. [2018-11-18 14:59:28,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:59:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 395 transitions. [2018-11-18 14:59:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 14:59:28,198 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:28,198 INFO L375 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-11-18 14:59:28,198 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:28,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:28,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1766323997, now seen corresponding path program 1 times [2018-11-18 14:59:28,199 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:28,199 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:28,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:28,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:28,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:28,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:28,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:28,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 14:59:28,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:59:28,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:59:28,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:59:28,251 INFO L87 Difference]: Start difference. First operand 275 states and 395 transitions. Second operand 7 states. [2018-11-18 14:59:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:28,406 INFO L93 Difference]: Finished difference Result 419 states and 614 transitions. [2018-11-18 14:59:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:59:28,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-18 14:59:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:28,409 INFO L225 Difference]: With dead ends: 419 [2018-11-18 14:59:28,409 INFO L226 Difference]: Without dead ends: 347 [2018-11-18 14:59:28,410 INFO L604 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-11-18 14:59:28,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-18 14:59:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2018-11-18 14:59:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-18 14:59:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 355 transitions. [2018-11-18 14:59:28,422 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 355 transitions. Word has length 49 [2018-11-18 14:59:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:28,422 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 355 transitions. [2018-11-18 14:59:28,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:59:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 355 transitions. [2018-11-18 14:59:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 14:59:28,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:28,423 INFO L375 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-11-18 14:59:28,424 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:28,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:28,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1709065695, now seen corresponding path program 1 times [2018-11-18 14:59:28,424 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:28,424 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:28,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:28,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:28,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:28,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:28,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:28,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:28,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:28,501 INFO L87 Difference]: Start difference. First operand 247 states and 355 transitions. Second operand 4 states. [2018-11-18 14:59:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:28,525 INFO L93 Difference]: Finished difference Result 400 states and 588 transitions. [2018-11-18 14:59:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:28,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 14:59:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:28,528 INFO L225 Difference]: With dead ends: 400 [2018-11-18 14:59:28,528 INFO L226 Difference]: Without dead ends: 321 [2018-11-18 14:59:28,528 INFO L604 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-11-18 14:59:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-18 14:59:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 285. [2018-11-18 14:59:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 14:59:28,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 407 transitions. [2018-11-18 14:59:28,541 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 407 transitions. Word has length 49 [2018-11-18 14:59:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:28,541 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 407 transitions. [2018-11-18 14:59:28,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 407 transitions. [2018-11-18 14:59:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:28,543 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:28,543 INFO L375 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-11-18 14:59:28,543 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:28,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash 209499055, now seen corresponding path program 1 times [2018-11-18 14:59:28,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:28,543 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:28,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:28,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:28,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:28,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 14:59:28,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 14:59:28,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 14:59:28,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 14:59:28,604 INFO L87 Difference]: Start difference. First operand 285 states and 407 transitions. Second operand 5 states. [2018-11-18 14:59:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:28,630 INFO L93 Difference]: Finished difference Result 292 states and 413 transitions. [2018-11-18 14:59:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:28,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 14:59:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:28,633 INFO L225 Difference]: With dead ends: 292 [2018-11-18 14:59:28,634 INFO L226 Difference]: Without dead ends: 285 [2018-11-18 14:59:28,634 INFO L604 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-11-18 14:59:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-18 14:59:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-11-18 14:59:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-18 14:59:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 404 transitions. [2018-11-18 14:59:28,646 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 404 transitions. Word has length 50 [2018-11-18 14:59:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:28,646 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 404 transitions. [2018-11-18 14:59:28,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 14:59:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 404 transitions. [2018-11-18 14:59:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:28,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:28,647 INFO L375 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] [2018-11-18 14:59:28,647 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:28,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2131434469, now seen corresponding path program 1 times [2018-11-18 14:59:28,648 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:28,648 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:28,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:28,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 14:59:28,786 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 14:59:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:59:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:59:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:59:28,789 INFO L87 Difference]: Start difference. First operand 285 states and 404 transitions. Second operand 13 states. [2018-11-18 14:59:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:29,201 INFO L93 Difference]: Finished difference Result 490 states and 689 transitions. [2018-11-18 14:59:29,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 14:59:29,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-18 14:59:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:29,203 INFO L225 Difference]: With dead ends: 490 [2018-11-18 14:59:29,203 INFO L226 Difference]: Without dead ends: 424 [2018-11-18 14:59:29,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 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-11-18 14:59:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-18 14:59:29,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 360. [2018-11-18 14:59:29,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-11-18 14:59:29,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 502 transitions. [2018-11-18 14:59:29,226 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 502 transitions. Word has length 50 [2018-11-18 14:59:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:29,227 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 502 transitions. [2018-11-18 14:59:29,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:59:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 502 transitions. [2018-11-18 14:59:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:29,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:29,228 INFO L375 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] [2018-11-18 14:59:29,229 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:29,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 574020447, now seen corresponding path program 1 times [2018-11-18 14:59:29,229 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:29,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:29,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:29,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:29,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:29,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:29,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:29,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:29,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:59:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 14:59:29,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:59:29,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:59:29,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 14:59:29,657 INFO L87 Difference]: Start difference. First operand 360 states and 502 transitions. Second operand 11 states. [2018-11-18 14:59:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:29,997 INFO L93 Difference]: Finished difference Result 468 states and 642 transitions. [2018-11-18 14:59:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:59:29,998 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-18 14:59:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:29,999 INFO L225 Difference]: With dead ends: 468 [2018-11-18 14:59:29,999 INFO L226 Difference]: Without dead ends: 432 [2018-11-18 14:59:29,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-11-18 14:59:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-11-18 14:59:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 364. [2018-11-18 14:59:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-18 14:59:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 504 transitions. [2018-11-18 14:59:30,013 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 504 transitions. Word has length 50 [2018-11-18 14:59:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:30,013 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 504 transitions. [2018-11-18 14:59:30,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:59:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 504 transitions. [2018-11-18 14:59:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:30,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:30,014 INFO L375 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] [2018-11-18 14:59:30,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:30,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:30,015 INFO L82 PathProgramCache]: Analyzing trace with hash 190866465, now seen corresponding path program 1 times [2018-11-18 14:59:30,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:30,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:30,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:30,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:30,147 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:30,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:30,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 14:59:30,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:59:30,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:59:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:59:30,149 INFO L87 Difference]: Start difference. First operand 364 states and 504 transitions. Second operand 12 states. [2018-11-18 14:59:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:30,470 INFO L93 Difference]: Finished difference Result 602 states and 849 transitions. [2018-11-18 14:59:30,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 14:59:30,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 14:59:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:30,472 INFO L225 Difference]: With dead ends: 602 [2018-11-18 14:59:30,472 INFO L226 Difference]: Without dead ends: 501 [2018-11-18 14:59:30,473 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 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-11-18 14:59:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2018-11-18 14:59:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 458. [2018-11-18 14:59:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-18 14:59:30,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 632 transitions. [2018-11-18 14:59:30,488 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 632 transitions. Word has length 50 [2018-11-18 14:59:30,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:30,488 INFO L480 AbstractCegarLoop]: Abstraction has 458 states and 632 transitions. [2018-11-18 14:59:30,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:59:30,488 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 632 transitions. [2018-11-18 14:59:30,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:30,489 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:30,489 INFO L375 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] [2018-11-18 14:59:30,490 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:30,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:30,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1398645915, now seen corresponding path program 1 times [2018-11-18 14:59:30,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:30,490 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:30,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:59:30,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:30,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:30,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:59:30,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:59:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:59:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:59:30,594 INFO L87 Difference]: Start difference. First operand 458 states and 632 transitions. Second operand 6 states. [2018-11-18 14:59:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:31,590 INFO L93 Difference]: Finished difference Result 488 states and 669 transitions. [2018-11-18 14:59:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:59:31,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 14:59:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:31,593 INFO L225 Difference]: With dead ends: 488 [2018-11-18 14:59:31,593 INFO L226 Difference]: Without dead ends: 486 [2018-11-18 14:59:31,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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-11-18 14:59:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-18 14:59:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 466. [2018-11-18 14:59:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-18 14:59:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 638 transitions. [2018-11-18 14:59:31,618 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 638 transitions. Word has length 50 [2018-11-18 14:59:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:31,618 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 638 transitions. [2018-11-18 14:59:31,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:59:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 638 transitions. [2018-11-18 14:59:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:31,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:31,619 INFO L375 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] [2018-11-18 14:59:31,620 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:31,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1341387613, now seen corresponding path program 1 times [2018-11-18 14:59:31,620 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:31,620 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:31,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:31,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:59:31,735 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:31,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:59:31,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:59:31,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:59:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:59:31,738 INFO L87 Difference]: Start difference. First operand 466 states and 638 transitions. Second operand 6 states. [2018-11-18 14:59:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:34,144 INFO L93 Difference]: Finished difference Result 486 states and 662 transitions. [2018-11-18 14:59:34,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:59:34,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 14:59:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:34,146 INFO L225 Difference]: With dead ends: 486 [2018-11-18 14:59:34,146 INFO L226 Difference]: Without dead ends: 484 [2018-11-18 14:59:34,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 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-11-18 14:59:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-11-18 14:59:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 470. [2018-11-18 14:59:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-11-18 14:59:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 641 transitions. [2018-11-18 14:59:34,172 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 641 transitions. Word has length 50 [2018-11-18 14:59:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:34,172 INFO L480 AbstractCegarLoop]: Abstraction has 470 states and 641 transitions. [2018-11-18 14:59:34,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:59:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 641 transitions. [2018-11-18 14:59:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 14:59:34,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:34,174 INFO L375 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] [2018-11-18 14:59:34,174 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:34,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash 107642843, now seen corresponding path program 1 times [2018-11-18 14:59:34,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:34,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:34,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:34,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 14:59:34,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:34,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:34,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:34,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:34,231 INFO L87 Difference]: Start difference. First operand 470 states and 641 transitions. Second operand 4 states. [2018-11-18 14:59:34,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:34,382 INFO L93 Difference]: Finished difference Result 857 states and 1155 transitions. [2018-11-18 14:59:34,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:34,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 14:59:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:34,385 INFO L225 Difference]: With dead ends: 857 [2018-11-18 14:59:34,386 INFO L226 Difference]: Without dead ends: 393 [2018-11-18 14:59:34,388 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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-11-18 14:59:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-11-18 14:59:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 379. [2018-11-18 14:59:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-11-18 14:59:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 495 transitions. [2018-11-18 14:59:34,412 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 495 transitions. Word has length 50 [2018-11-18 14:59:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:34,412 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 495 transitions. [2018-11-18 14:59:34,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 495 transitions. [2018-11-18 14:59:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 14:59:34,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:34,414 INFO L375 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-11-18 14:59:34,414 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:34,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2122494234, now seen corresponding path program 1 times [2018-11-18 14:59:34,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:34,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:34,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:34,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:34,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:34,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:34,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:34,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:34,499 INFO L87 Difference]: Start difference. First operand 379 states and 495 transitions. Second operand 4 states. [2018-11-18 14:59:34,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:34,547 INFO L93 Difference]: Finished difference Result 396 states and 514 transitions. [2018-11-18 14:59:34,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 14:59:34,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-18 14:59:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:34,549 INFO L225 Difference]: With dead ends: 396 [2018-11-18 14:59:34,549 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 14:59:34,549 INFO L604 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-11-18 14:59:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 14:59:34,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2018-11-18 14:59:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-18 14:59:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 427 transitions. [2018-11-18 14:59:34,567 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 427 transitions. Word has length 54 [2018-11-18 14:59:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:34,567 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 427 transitions. [2018-11-18 14:59:34,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 427 transitions. [2018-11-18 14:59:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 14:59:34,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:34,568 INFO L375 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] [2018-11-18 14:59:34,568 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:34,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:34,568 INFO L82 PathProgramCache]: Analyzing trace with hash 803035397, now seen corresponding path program 1 times [2018-11-18 14:59:34,569 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:34,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:34,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:34,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:34,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:34,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 14:59:34,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 14:59:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 14:59:34,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 14:59:34,659 INFO L87 Difference]: Start difference. First operand 335 states and 427 transitions. Second operand 4 states. [2018-11-18 14:59:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:34,691 INFO L93 Difference]: Finished difference Result 502 states and 661 transitions. [2018-11-18 14:59:34,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 14:59:34,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-18 14:59:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:34,694 INFO L225 Difference]: With dead ends: 502 [2018-11-18 14:59:34,694 INFO L226 Difference]: Without dead ends: 397 [2018-11-18 14:59:34,694 INFO L604 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-11-18 14:59:34,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-18 14:59:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 333. [2018-11-18 14:59:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-11-18 14:59:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 428 transitions. [2018-11-18 14:59:34,713 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 428 transitions. Word has length 54 [2018-11-18 14:59:34,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:34,714 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 428 transitions. [2018-11-18 14:59:34,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 14:59:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 428 transitions. [2018-11-18 14:59:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 14:59:34,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:34,715 INFO L375 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] [2018-11-18 14:59:34,715 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:34,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 767696004, now seen corresponding path program 1 times [2018-11-18 14:59:34,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:34,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:34,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 14:59:34,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:34,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:34,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 14:59:34,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:59:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:59:34,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:59:34,889 INFO L87 Difference]: Start difference. First operand 333 states and 428 transitions. Second operand 12 states. [2018-11-18 14:59:35,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:35,205 INFO L93 Difference]: Finished difference Result 409 states and 535 transitions. [2018-11-18 14:59:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:59:35,206 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-18 14:59:35,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:35,207 INFO L225 Difference]: With dead ends: 409 [2018-11-18 14:59:35,207 INFO L226 Difference]: Without dead ends: 384 [2018-11-18 14:59:35,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:59:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-18 14:59:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 352. [2018-11-18 14:59:35,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-18 14:59:35,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 456 transitions. [2018-11-18 14:59:35,223 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 456 transitions. Word has length 57 [2018-11-18 14:59:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:35,223 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 456 transitions. [2018-11-18 14:59:35,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:59:35,223 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 456 transitions. [2018-11-18 14:59:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 14:59:35,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:35,224 INFO L375 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] [2018-11-18 14:59:35,224 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:35,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1147712056, now seen corresponding path program 1 times [2018-11-18 14:59:35,225 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:35,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:35,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:35,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:35,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:35,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 14:59:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:35,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 14:59:35,306 INFO L87 Difference]: Start difference. First operand 352 states and 456 transitions. Second operand 8 states. [2018-11-18 14:59:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:35,489 INFO L93 Difference]: Finished difference Result 427 states and 561 transitions. [2018-11-18 14:59:35,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 14:59:35,489 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-18 14:59:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:35,491 INFO L225 Difference]: With dead ends: 427 [2018-11-18 14:59:35,491 INFO L226 Difference]: Without dead ends: 408 [2018-11-18 14:59:35,491 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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-11-18 14:59:35,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-11-18 14:59:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 357. [2018-11-18 14:59:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-11-18 14:59:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 471 transitions. [2018-11-18 14:59:35,511 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 471 transitions. Word has length 57 [2018-11-18 14:59:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:35,511 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 471 transitions. [2018-11-18 14:59:35,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 14:59:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 471 transitions. [2018-11-18 14:59:35,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:35,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:35,513 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 14:59:35,513 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:35,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:35,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1451811630, now seen corresponding path program 1 times [2018-11-18 14:59:35,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:35,513 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:35,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:35,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 14:59:35,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:35,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:35,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 14:59:35,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 14:59:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 14:59:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 14:59:35,631 INFO L87 Difference]: Start difference. First operand 357 states and 471 transitions. Second operand 7 states. [2018-11-18 14:59:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:35,779 INFO L93 Difference]: Finished difference Result 481 states and 610 transitions. [2018-11-18 14:59:35,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 14:59:35,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-11-18 14:59:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:35,780 INFO L225 Difference]: With dead ends: 481 [2018-11-18 14:59:35,780 INFO L226 Difference]: Without dead ends: 390 [2018-11-18 14:59:35,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 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-11-18 14:59:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-18 14:59:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 344. [2018-11-18 14:59:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-11-18 14:59:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 450 transitions. [2018-11-18 14:59:35,801 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 450 transitions. Word has length 58 [2018-11-18 14:59:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:35,801 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 450 transitions. [2018-11-18 14:59:35,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 14:59:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 450 transitions. [2018-11-18 14:59:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:35,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:35,802 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 14:59:35,802 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 542333076, now seen corresponding path program 1 times [2018-11-18 14:59:35,803 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:35,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:35,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 14:59:35,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:35,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:35,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 14:59:35,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 14:59:35,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 14:59:35,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-18 14:59:35,931 INFO L87 Difference]: Start difference. First operand 344 states and 450 transitions. Second operand 13 states. [2018-11-18 14:59:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:36,144 INFO L93 Difference]: Finished difference Result 408 states and 529 transitions. [2018-11-18 14:59:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:59:36,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-18 14:59:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:36,146 INFO L225 Difference]: With dead ends: 408 [2018-11-18 14:59:36,146 INFO L226 Difference]: Without dead ends: 365 [2018-11-18 14:59:36,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 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-11-18 14:59:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-18 14:59:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-11-18 14:59:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-11-18 14:59:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 442 transitions. [2018-11-18 14:59:36,159 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 442 transitions. Word has length 58 [2018-11-18 14:59:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:36,159 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 442 transitions. [2018-11-18 14:59:36,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 14:59:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 442 transitions. [2018-11-18 14:59:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:36,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:36,161 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:36,161 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:36,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1507576792, now seen corresponding path program 1 times [2018-11-18 14:59:36,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:36,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:36,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:36,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:38,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:38,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:38,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:38,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:38,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:38,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:38,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 14:59:38,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 14:59:38,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 14:59:38,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 14:59:38,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2018-11-18 14:59:38,514 INFO L87 Difference]: Start difference. First operand 339 states and 442 transitions. Second operand 11 states. [2018-11-18 14:59:42,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:42,451 INFO L93 Difference]: Finished difference Result 395 states and 515 transitions. [2018-11-18 14:59:42,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 14:59:42,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 14:59:42,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:42,452 INFO L225 Difference]: With dead ends: 395 [2018-11-18 14:59:42,453 INFO L226 Difference]: Without dead ends: 361 [2018-11-18 14:59:42,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=63, Invalid=277, Unknown=2, NotChecked=0, Total=342 [2018-11-18 14:59:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-18 14:59:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2018-11-18 14:59:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 14:59:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 438 transitions. [2018-11-18 14:59:42,472 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 438 transitions. Word has length 58 [2018-11-18 14:59:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:42,472 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 438 transitions. [2018-11-18 14:59:42,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 14:59:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 438 transitions. [2018-11-18 14:59:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:42,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:42,473 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:42,474 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:42,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:42,474 INFO L82 PathProgramCache]: Analyzing trace with hash -636789348, now seen corresponding path program 1 times [2018-11-18 14:59:42,474 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:42,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:42,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:42,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:42,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:42,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 14:59:42,638 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 14:59:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:42,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 14:59:42,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 14:59:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:42,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 14:59:42,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10] total 10 [2018-11-18 14:59:42,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 14:59:42,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 14:59:42,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 14:59:42,727 INFO L87 Difference]: Start difference. First operand 337 states and 438 transitions. Second operand 10 states. [2018-11-18 14:59:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:42,846 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2018-11-18 14:59:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 14:59:42,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-11-18 14:59:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:42,847 INFO L225 Difference]: With dead ends: 463 [2018-11-18 14:59:42,848 INFO L226 Difference]: Without dead ends: 365 [2018-11-18 14:59:42,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-18 14:59:42,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-18 14:59:42,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 318. [2018-11-18 14:59:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-18 14:59:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 413 transitions. [2018-11-18 14:59:42,860 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 413 transitions. Word has length 58 [2018-11-18 14:59:42,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:42,860 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 413 transitions. [2018-11-18 14:59:42,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 14:59:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 413 transitions. [2018-11-18 14:59:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:42,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:42,861 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 14:59:42,862 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:42,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:42,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1059491174, now seen corresponding path program 1 times [2018-11-18 14:59:42,862 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:42,862 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:42,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:42,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 14:59:43,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:43,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:43,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 14:59:43,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 14:59:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 14:59:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-11-18 14:59:43,381 INFO L87 Difference]: Start difference. First operand 318 states and 413 transitions. Second operand 12 states. [2018-11-18 14:59:47,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:47,806 INFO L93 Difference]: Finished difference Result 393 states and 501 transitions. [2018-11-18 14:59:47,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 14:59:47,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-18 14:59:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:47,807 INFO L225 Difference]: With dead ends: 393 [2018-11-18 14:59:47,808 INFO L226 Difference]: Without dead ends: 352 [2018-11-18 14:59:47,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2018-11-18 14:59:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-18 14:59:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 316. [2018-11-18 14:59:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 14:59:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 409 transitions. [2018-11-18 14:59:47,824 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 409 transitions. Word has length 58 [2018-11-18 14:59:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 409 transitions. [2018-11-18 14:59:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 14:59:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 409 transitions. [2018-11-18 14:59:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 14:59:47,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:47,826 INFO L375 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-11-18 14:59:47,826 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:47,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -443053905, now seen corresponding path program 1 times [2018-11-18 14:59:47,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:47,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:59:47,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:47,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:47,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 14:59:47,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 14:59:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 14:59:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 14:59:47,888 INFO L87 Difference]: Start difference. First operand 316 states and 409 transitions. Second operand 6 states. [2018-11-18 14:59:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 14:59:48,004 INFO L93 Difference]: Finished difference Result 388 states and 500 transitions. [2018-11-18 14:59:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 14:59:48,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 14:59:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 14:59:48,006 INFO L225 Difference]: With dead ends: 388 [2018-11-18 14:59:48,006 INFO L226 Difference]: Without dead ends: 337 [2018-11-18 14:59:48,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 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-11-18 14:59:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-11-18 14:59:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 316. [2018-11-18 14:59:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 14:59:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 407 transitions. [2018-11-18 14:59:48,026 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 407 transitions. Word has length 57 [2018-11-18 14:59:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 14:59:48,026 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 407 transitions. [2018-11-18 14:59:48,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 14:59:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 407 transitions. [2018-11-18 14:59:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 14:59:48,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 14:59:48,027 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 14:59:48,027 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 14:59:48,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 14:59:48,027 INFO L82 PathProgramCache]: Analyzing trace with hash -94247458, now seen corresponding path program 1 times [2018-11-18 14:59:48,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 14:59:48,028 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 14:59:48,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 14:59:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 14:59:48,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 14:59:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 14:59:54,260 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 14:59:54,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 14:59:54,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 14:59:54,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 14:59:54,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 14:59:54,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2018-11-18 14:59:54,262 INFO L87 Difference]: Start difference. First operand 316 states and 407 transitions. Second operand 8 states. [2018-11-18 15:00:05,233 WARN L180 SmtUtils]: Spent 5.95 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-18 15:00:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:05,369 INFO L93 Difference]: Finished difference Result 333 states and 425 transitions. [2018-11-18 15:00:05,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:00:05,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-18 15:00:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:05,371 INFO L225 Difference]: With dead ends: 333 [2018-11-18 15:00:05,371 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 15:00:05,371 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=26, Invalid=61, Unknown=3, NotChecked=0, Total=90 [2018-11-18 15:00:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 15:00:05,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 321. [2018-11-18 15:00:05,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 15:00:05,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 412 transitions. [2018-11-18 15:00:05,386 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 412 transitions. Word has length 58 [2018-11-18 15:00:05,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:05,386 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 412 transitions. [2018-11-18 15:00:05,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:00:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 412 transitions. [2018-11-18 15:00:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 15:00:05,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:05,387 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:00:05,387 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:05,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1136872013, now seen corresponding path program 1 times [2018-11-18 15:00:05,387 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:05,387 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:05,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:05,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:00:13,585 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:13,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:00:13,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:00:13,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:00:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=37, Unknown=4, NotChecked=0, Total=56 [2018-11-18 15:00:13,587 INFO L87 Difference]: Start difference. First operand 321 states and 412 transitions. Second operand 8 states. [2018-11-18 15:00:39,302 WARN L180 SmtUtils]: Spent 7.28 s on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-18 15:00:46,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:46,654 INFO L93 Difference]: Finished difference Result 337 states and 428 transitions. [2018-11-18 15:00:46,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:00:46,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-18 15:00:46,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:46,655 INFO L225 Difference]: With dead ends: 337 [2018-11-18 15:00:46,655 INFO L226 Difference]: Without dead ends: 335 [2018-11-18 15:00:46,655 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=29, Invalid=74, Unknown=7, NotChecked=0, Total=110 [2018-11-18 15:00:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-18 15:00:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 320. [2018-11-18 15:00:46,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-11-18 15:00:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 410 transitions. [2018-11-18 15:00:46,667 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 410 transitions. Word has length 59 [2018-11-18 15:00:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:46,667 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 410 transitions. [2018-11-18 15:00:46,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:00:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 410 transitions. [2018-11-18 15:00:46,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 15:00:46,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:46,668 INFO L375 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, 1] [2018-11-18 15:00:46,668 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:46,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1782201536, now seen corresponding path program 1 times [2018-11-18 15:00:46,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:46,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:46,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 15:00:46,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:46,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:00:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:00:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:00:46,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:00:46,701 INFO L87 Difference]: Start difference. First operand 320 states and 410 transitions. Second operand 4 states. [2018-11-18 15:00:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:46,720 INFO L93 Difference]: Finished difference Result 329 states and 418 transitions. [2018-11-18 15:00:46,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:00:46,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-18 15:00:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:46,721 INFO L225 Difference]: With dead ends: 329 [2018-11-18 15:00:46,721 INFO L226 Difference]: Without dead ends: 284 [2018-11-18 15:00:46,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-11-18 15:00:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-11-18 15:00:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 274. [2018-11-18 15:00:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-18 15:00:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 342 transitions. [2018-11-18 15:00:46,734 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 342 transitions. Word has length 59 [2018-11-18 15:00:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:46,734 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 342 transitions. [2018-11-18 15:00:46,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:00:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 342 transitions. [2018-11-18 15:00:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 15:00:46,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:46,735 INFO L375 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] [2018-11-18 15:00:46,735 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:46,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -352045735, now seen corresponding path program 1 times [2018-11-18 15:00:46,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:46,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 15:00:46,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:46,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:46,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:00:46,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:00:46,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:00:46,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:00:46,796 INFO L87 Difference]: Start difference. First operand 274 states and 342 transitions. Second operand 5 states. [2018-11-18 15:00:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:46,878 INFO L93 Difference]: Finished difference Result 323 states and 401 transitions. [2018-11-18 15:00:46,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:00:46,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-18 15:00:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:46,880 INFO L225 Difference]: With dead ends: 323 [2018-11-18 15:00:46,880 INFO L226 Difference]: Without dead ends: 300 [2018-11-18 15:00:46,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-11-18 15:00:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-18 15:00:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2018-11-18 15:00:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-18 15:00:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 340 transitions. [2018-11-18 15:00:46,898 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 340 transitions. Word has length 59 [2018-11-18 15:00:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:46,899 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 340 transitions. [2018-11-18 15:00:46,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:00:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 340 transitions. [2018-11-18 15:00:46,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 15:00:46,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:46,900 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 15:00:46,900 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:46,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:46,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1987146166, now seen corresponding path program 1 times [2018-11-18 15:00:46,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:46,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:46,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:00:46,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:46,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:46,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:00:46,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 15:00:46,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:00:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:00:46,978 INFO L87 Difference]: Start difference. First operand 274 states and 340 transitions. Second operand 8 states. [2018-11-18 15:00:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:47,158 INFO L93 Difference]: Finished difference Result 371 states and 475 transitions. [2018-11-18 15:00:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:00:47,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-18 15:00:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:47,160 INFO L225 Difference]: With dead ends: 371 [2018-11-18 15:00:47,160 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 15:00:47,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 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-11-18 15:00:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 15:00:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 309. [2018-11-18 15:00:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-18 15:00:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 390 transitions. [2018-11-18 15:00:47,173 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 390 transitions. Word has length 64 [2018-11-18 15:00:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:47,173 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 390 transitions. [2018-11-18 15:00:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 15:00:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 390 transitions. [2018-11-18 15:00:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 15:00:47,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:47,174 INFO L375 BasicCegarLoop]: trace histogram [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-11-18 15:00:47,174 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:47,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash -478381061, now seen corresponding path program 1 times [2018-11-18 15:00:47,174 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:47,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:47,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:00:47,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:47,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:47,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:00:47,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:00:47,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:00:47,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:00:47,231 INFO L87 Difference]: Start difference. First operand 309 states and 390 transitions. Second operand 6 states. [2018-11-18 15:00:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:47,288 INFO L93 Difference]: Finished difference Result 403 states and 523 transitions. [2018-11-18 15:00:47,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:00:47,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 15:00:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:47,290 INFO L225 Difference]: With dead ends: 403 [2018-11-18 15:00:47,290 INFO L226 Difference]: Without dead ends: 325 [2018-11-18 15:00:47,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-11-18 15:00:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-18 15:00:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 286. [2018-11-18 15:00:47,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-18 15:00:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 344 transitions. [2018-11-18 15:00:47,303 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 344 transitions. Word has length 66 [2018-11-18 15:00:47,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:47,303 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 344 transitions. [2018-11-18 15:00:47,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:00:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 344 transitions. [2018-11-18 15:00:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 15:00:47,304 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:47,304 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:00:47,304 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:47,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:47,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1238977816, now seen corresponding path program 1 times [2018-11-18 15:00:47,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:47,305 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:47,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:47,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 15:00:47,391 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:47,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:00:47,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:00:47,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:00:47,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:00:47,393 INFO L87 Difference]: Start difference. First operand 286 states and 344 transitions. Second operand 6 states. [2018-11-18 15:00:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:47,435 INFO L93 Difference]: Finished difference Result 327 states and 396 transitions. [2018-11-18 15:00:47,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:00:47,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 15:00:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:47,437 INFO L225 Difference]: With dead ends: 327 [2018-11-18 15:00:47,437 INFO L226 Difference]: Without dead ends: 325 [2018-11-18 15:00:47,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 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-11-18 15:00:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-11-18 15:00:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 295. [2018-11-18 15:00:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-18 15:00:47,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 355 transitions. [2018-11-18 15:00:47,451 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 355 transitions. Word has length 66 [2018-11-18 15:00:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:47,451 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 355 transitions. [2018-11-18 15:00:47,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:00:47,451 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 355 transitions. [2018-11-18 15:00:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 15:00:47,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:47,452 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:00:47,452 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:47,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:47,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2003777940, now seen corresponding path program 1 times [2018-11-18 15:00:47,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:47,452 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:47,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:47,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 15:00:47,554 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:47,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:47,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:00:47,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:00:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:00:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:00:47,556 INFO L87 Difference]: Start difference. First operand 295 states and 355 transitions. Second operand 6 states. [2018-11-18 15:00:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:47,604 INFO L93 Difference]: Finished difference Result 324 states and 387 transitions. [2018-11-18 15:00:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:00:47,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 15:00:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:47,605 INFO L225 Difference]: With dead ends: 324 [2018-11-18 15:00:47,605 INFO L226 Difference]: Without dead ends: 322 [2018-11-18 15:00:47,606 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 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-11-18 15:00:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-18 15:00:47,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 299. [2018-11-18 15:00:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-18 15:00:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 358 transitions. [2018-11-18 15:00:47,620 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 358 transitions. Word has length 66 [2018-11-18 15:00:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:47,620 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 358 transitions. [2018-11-18 15:00:47,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:00:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 358 transitions. [2018-11-18 15:00:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 15:00:47,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:47,621 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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-11-18 15:00:47,621 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:47,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1704020493, now seen corresponding path program 1 times [2018-11-18 15:00:47,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:47,622 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:47,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:47,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 15:00:48,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:00:48,719 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-18 15:00:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 15:00:50,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:00:50,171 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:00:50,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:50,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:00:50,316 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:50,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:00:50,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [14, 15] total 26 [2018-11-18 15:00:50,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 15:00:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 15:00:50,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-18 15:00:50,332 INFO L87 Difference]: Start difference. First operand 299 states and 358 transitions. Second operand 26 states. [2018-11-18 15:00:50,733 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-18 15:00:52,158 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 15:00:52,725 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-18 15:00:54,394 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-18 15:00:55,103 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-11-18 15:00:55,810 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-11-18 15:00:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:56,858 INFO L93 Difference]: Finished difference Result 395 states and 489 transitions. [2018-11-18 15:00:56,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 15:00:56,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-11-18 15:00:56,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:56,859 INFO L225 Difference]: With dead ends: 395 [2018-11-18 15:00:56,859 INFO L226 Difference]: Without dead ends: 367 [2018-11-18 15:00:56,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 182 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 15:00:56,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-18 15:00:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 321. [2018-11-18 15:00:56,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 15:00:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 389 transitions. [2018-11-18 15:00:56,877 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 389 transitions. Word has length 71 [2018-11-18 15:00:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:56,878 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 389 transitions. [2018-11-18 15:00:56,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 15:00:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 389 transitions. [2018-11-18 15:00:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:00:56,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:56,878 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 15:00:56,878 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:56,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:56,879 INFO L82 PathProgramCache]: Analyzing trace with hash -772856624, now seen corresponding path program 1 times [2018-11-18 15:00:56,879 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:56,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:56,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:56,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:00:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:57,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:00:57,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:00:57,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:57,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:57,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:00:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:57,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 15:00:57,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11] total 14 [2018-11-18 15:00:57,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 15:00:57,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:00:57,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:00:57,175 INFO L87 Difference]: Start difference. First operand 321 states and 389 transitions. Second operand 14 states. [2018-11-18 15:00:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:57,461 INFO L93 Difference]: Finished difference Result 348 states and 421 transitions. [2018-11-18 15:00:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:00:57,461 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 15:00:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:57,463 INFO L225 Difference]: With dead ends: 348 [2018-11-18 15:00:57,463 INFO L226 Difference]: Without dead ends: 341 [2018-11-18 15:00:57,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 269 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-11-18 15:00:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-18 15:00:57,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 318. [2018-11-18 15:00:57,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-11-18 15:00:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 386 transitions. [2018-11-18 15:00:57,485 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 386 transitions. Word has length 72 [2018-11-18 15:00:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:57,485 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 386 transitions. [2018-11-18 15:00:57,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 15:00:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 386 transitions. [2018-11-18 15:00:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:00:57,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:57,486 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-18 15:00:57,486 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:57,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:57,486 INFO L82 PathProgramCache]: Analyzing trace with hash -84222256, now seen corresponding path program 2 times [2018-11-18 15:00:57,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:57,487 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:57,498 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 15:00:57,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:00:57,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:00:57,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:57,661 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:57,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:57,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 15:00:57,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 15:00:57,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:00:57,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:00:57,663 INFO L87 Difference]: Start difference. First operand 318 states and 386 transitions. Second operand 12 states. [2018-11-18 15:00:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:57,920 INFO L93 Difference]: Finished difference Result 341 states and 411 transitions. [2018-11-18 15:00:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:00:57,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-11-18 15:00:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:57,921 INFO L225 Difference]: With dead ends: 341 [2018-11-18 15:00:57,922 INFO L226 Difference]: Without dead ends: 334 [2018-11-18 15:00:57,922 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 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-11-18 15:00:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-18 15:00:57,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2018-11-18 15:00:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-18 15:00:57,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 376 transitions. [2018-11-18 15:00:57,941 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 376 transitions. Word has length 72 [2018-11-18 15:00:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:57,941 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 376 transitions. [2018-11-18 15:00:57,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 15:00:57,942 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 376 transitions. [2018-11-18 15:00:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:00:57,942 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:57,942 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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-11-18 15:00:57,943 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:57,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1434864404, now seen corresponding path program 1 times [2018-11-18 15:00:57,943 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:57,943 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:57,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:00:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:57,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:00:58,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:58,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:58,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:00:58,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:00:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:00:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:00:58,011 INFO L87 Difference]: Start difference. First operand 310 states and 376 transitions. Second operand 6 states. [2018-11-18 15:00:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:58,214 INFO L93 Difference]: Finished difference Result 414 states and 511 transitions. [2018-11-18 15:00:58,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:00:58,215 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 15:00:58,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:58,215 INFO L225 Difference]: With dead ends: 414 [2018-11-18 15:00:58,215 INFO L226 Difference]: Without dead ends: 395 [2018-11-18 15:00:58,216 INFO L604 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-11-18 15:00:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-18 15:00:58,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 306. [2018-11-18 15:00:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-11-18 15:00:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 373 transitions. [2018-11-18 15:00:58,249 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 373 transitions. Word has length 72 [2018-11-18 15:00:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:58,249 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 373 transitions. [2018-11-18 15:00:58,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:00:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 373 transitions. [2018-11-18 15:00:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 15:00:58,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:58,250 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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-11-18 15:00:58,251 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:58,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -902017886, now seen corresponding path program 1 times [2018-11-18 15:00:58,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:58,251 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:58,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:58,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:00:58,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:00:58,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:00:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:00:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:00:58,449 INFO L87 Difference]: Start difference. First operand 306 states and 373 transitions. Second operand 9 states. [2018-11-18 15:00:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:58,833 INFO L93 Difference]: Finished difference Result 356 states and 433 transitions. [2018-11-18 15:00:58,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:00:58,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-18 15:00:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:58,835 INFO L225 Difference]: With dead ends: 356 [2018-11-18 15:00:58,835 INFO L226 Difference]: Without dead ends: 315 [2018-11-18 15:00:58,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:00:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-18 15:00:58,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 284. [2018-11-18 15:00:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-18 15:00:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 337 transitions. [2018-11-18 15:00:58,868 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 337 transitions. Word has length 72 [2018-11-18 15:00:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:58,868 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 337 transitions. [2018-11-18 15:00:58,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:00:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 337 transitions. [2018-11-18 15:00:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 15:00:58,869 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:58,869 INFO L375 BasicCegarLoop]: trace histogram [3, 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-11-18 15:00:58,869 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:58,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:58,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1577509898, now seen corresponding path program 1 times [2018-11-18 15:00:58,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:58,870 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:58,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:58,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:00:58,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:58,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:00:58,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:00:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:00:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:00:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:00:58,973 INFO L87 Difference]: Start difference. First operand 284 states and 337 transitions. Second operand 6 states. [2018-11-18 15:00:59,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:00:59,032 INFO L93 Difference]: Finished difference Result 305 states and 359 transitions. [2018-11-18 15:00:59,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:00:59,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-18 15:00:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:00:59,033 INFO L225 Difference]: With dead ends: 305 [2018-11-18 15:00:59,033 INFO L226 Difference]: Without dead ends: 301 [2018-11-18 15:00:59,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 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-11-18 15:00:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-18 15:00:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 271. [2018-11-18 15:00:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-18 15:00:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 320 transitions. [2018-11-18 15:00:59,066 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 320 transitions. Word has length 74 [2018-11-18 15:00:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:00:59,067 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 320 transitions. [2018-11-18 15:00:59,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:00:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 320 transitions. [2018-11-18 15:00:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 15:00:59,067 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:00:59,068 INFO L375 BasicCegarLoop]: trace histogram [3, 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-11-18 15:00:59,068 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:00:59,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:00:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1520251596, now seen corresponding path program 1 times [2018-11-18 15:00:59,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:00:59,068 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:00:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:59,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 15:00:59,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:00:59,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:00:59,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:00:59,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:00:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:00:59,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:00:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 15:00:59,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:00:59,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:00:59,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-11-18 15:00:59,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 15:00:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 15:00:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:00:59,943 INFO L87 Difference]: Start difference. First operand 271 states and 320 transitions. Second operand 17 states. [2018-11-18 15:01:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:00,881 INFO L93 Difference]: Finished difference Result 320 states and 372 transitions. [2018-11-18 15:01:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 15:01:00,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-11-18 15:01:00,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:00,882 INFO L225 Difference]: With dead ends: 320 [2018-11-18 15:01:00,882 INFO L226 Difference]: Without dead ends: 172 [2018-11-18 15:01:00,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 148 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-11-18 15:01:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-18 15:01:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2018-11-18 15:01:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 15:01:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2018-11-18 15:01:00,892 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 74 [2018-11-18 15:01:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:00,892 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2018-11-18 15:01:00,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 15:01:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2018-11-18 15:01:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 15:01:00,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:00,893 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 15:01:00,893 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:00,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1237845392, now seen corresponding path program 1 times [2018-11-18 15:01:00,893 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:00,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:00,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:00,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:01:00,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:01:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:01:00,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 15:01:00,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:01:00,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:01:00,933 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand 4 states. [2018-11-18 15:01:00,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:00,953 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions. [2018-11-18 15:01:00,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:01:00,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-18 15:01:00,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:00,954 INFO L225 Difference]: With dead ends: 176 [2018-11-18 15:01:00,954 INFO L226 Difference]: Without dead ends: 152 [2018-11-18 15:01:00,955 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-11-18 15:01:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-18 15:01:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-11-18 15:01:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-18 15:01:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2018-11-18 15:01:00,965 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 73 [2018-11-18 15:01:00,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:00,965 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2018-11-18 15:01:00,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 15:01:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2018-11-18 15:01:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 15:01:00,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:00,966 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:01:00,966 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:00,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash -491600208, now seen corresponding path program 1 times [2018-11-18 15:01:00,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:00,967 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:00,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:00,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:01,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:01:01,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:01:01,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:01:01,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:01:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:01:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:01:01,015 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand 5 states. [2018-11-18 15:01:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:01,045 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2018-11-18 15:01:01,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:01:01,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-18 15:01:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:01,046 INFO L225 Difference]: With dead ends: 180 [2018-11-18 15:01:01,046 INFO L226 Difference]: Without dead ends: 130 [2018-11-18 15:01:01,046 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 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-11-18 15:01:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-18 15:01:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-11-18 15:01:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 15:01:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2018-11-18 15:01:01,055 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 75 [2018-11-18 15:01:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:01,055 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2018-11-18 15:01:01,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:01:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2018-11-18 15:01:01,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 15:01:01,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:01,055 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:01:01,055 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:01,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1335605710, now seen corresponding path program 1 times [2018-11-18 15:01:01,056 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:01,056 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:01,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:01,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 15:01:01,117 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:01:01,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:01:01,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:01:01,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:01:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:01:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:01:01,119 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 6 states. [2018-11-18 15:01:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:01,230 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2018-11-18 15:01:01,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:01:01,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-11-18 15:01:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:01,231 INFO L225 Difference]: With dead ends: 146 [2018-11-18 15:01:01,231 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 15:01:01,232 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-11-18 15:01:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 15:01:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-18 15:01:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 15:01:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-18 15:01:01,241 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 75 [2018-11-18 15:01:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:01,241 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-18 15:01:01,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:01:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-11-18 15:01:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 15:01:01,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:01,242 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:01:01,242 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:01,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -634005836, now seen corresponding path program 1 times [2018-11-18 15:01:01,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:01,242 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:01,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:01,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 15:01:01,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:01:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 15:01:01,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:01:01,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:01:01,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:01,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 15:01:01,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:01:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 15:01:01,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 15:01:01,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 10 [2018-11-18 15:01:01,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 15:01:01,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:01:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:01:01,456 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 10 states. [2018-11-18 15:01:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:01,533 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-11-18 15:01:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:01:01,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-11-18 15:01:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:01,534 INFO L225 Difference]: With dead ends: 119 [2018-11-18 15:01:01,534 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 15:01:01,534 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 284 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:01:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 15:01:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 15:01:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 15:01:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-11-18 15:01:01,540 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 75 [2018-11-18 15:01:01,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:01,540 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-11-18 15:01:01,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 15:01:01,540 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-11-18 15:01:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 15:01:01,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:01,540 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-11-18 15:01:01,541 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:01,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:01,541 INFO L82 PathProgramCache]: Analyzing trace with hash -478715839, now seen corresponding path program 1 times [2018-11-18 15:01:01,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:01,541 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:01,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:01,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 15:01:01,977 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:01:01,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:01:01,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 15:01:01,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 15:01:01,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:01:01,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:01:01,979 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 12 states. [2018-11-18 15:01:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:04,287 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-18 15:01:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:01:04,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-18 15:01:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:04,288 INFO L225 Difference]: With dead ends: 92 [2018-11-18 15:01:04,288 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 15:01:04,289 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-18 15:01:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 15:01:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-18 15:01:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 15:01:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-18 15:01:04,293 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 79 [2018-11-18 15:01:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:04,293 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-18 15:01:04,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 15:01:04,294 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-18 15:01:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 15:01:04,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:01:04,294 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2018-11-18 15:01:04,294 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:01:04,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:01:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2120718542, now seen corresponding path program 1 times [2018-11-18 15:01:04,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:01:04,295 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:01:04,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:01:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:01:04,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:01:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 15:01:04,962 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:01:04,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:01:04,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 15:01:04,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 15:01:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 15:01:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:01:04,964 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 10 states. [2018-11-18 15:01:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:01:05,188 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-18 15:01:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:01:05,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-11-18 15:01:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:01:05,188 INFO L225 Difference]: With dead ends: 74 [2018-11-18 15:01:05,188 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:01:05,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:01:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:01:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:01:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:01:05,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:01:05,189 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-11-18 15:01:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:01:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:01:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 15:01:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:01:05,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:01:05,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:01:05,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,322 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 164 [2018-11-18 15:01:05,525 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 148 [2018-11-18 15:01:05,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:05,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 15:01:07,361 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 161 DAG size of output: 95 [2018-11-18 15:01:42,107 WARN L180 SmtUtils]: Spent 34.74 s on a formula simplification. DAG size of input: 150 DAG size of output: 65 [2018-11-18 15:01:43,340 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 143 DAG size of output: 54 [2018-11-18 15:01:43,580 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 40 [2018-11-18 15:03:15,386 WARN L180 SmtUtils]: Spent 1.53 m on a formula simplification. DAG size of input: 357 DAG size of output: 221 [2018-11-18 15:04:10,956 WARN L180 SmtUtils]: Spent 55.57 s on a formula simplification. DAG size of input: 189 DAG size of output: 141 [2018-11-18 15:04:10,959 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L421 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-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 15:04:10,959 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-18 15:04:10,959 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 15:04:10,960 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L421 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-11-18 15:04:10,960 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L421 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse20 (bvult main_~a~0 main_~r_add~0)) (.cse16 (= (_ bv1 32) main_~tmp___2~0)) (.cse2 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse17 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse3 (= (_ bv0 32) main_~zero~0)) (.cse18 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse0 (= main_~tmp___1~0 (_ bv0 32))) (.cse14 (not (bvult main_~r_add~0 main_~a~0))) (.cse1 (= main_~tmp___2~0 (_ bv0 32))) (.cse15 (and .cse20 .cse16 .cse2 .cse17 .cse3 .cse18))) (let ((.cse9 (or (and .cse0 .cse14 .cse1 .cse2 .cse17 .cse3) .cse15)) (.cse4 (not (bvult main_~a~0 main_~b~0))) (.cse5 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse7 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse8 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse19 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32)))) (or (and .cse0 (= main_~a~0 main_~r_add~0) .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse12 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse11 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse13 (bvneg .cse12))) (let ((.cse10 (bvadd .cse11 .cse13))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse10)) (not (= (bvadd .cse11 .cse12 .cse13) (_ bv0 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse10) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse5 .cse6 (exists ((v_addflt_~ma~0_93 (_ BitVec 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_93) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse7 .cse8 .cse9) (and (or (and .cse0 .cse14 .cse1 .cse2 .cse3 .cse4) (and .cse15 .cse4) (and .cse16 .cse2 .cse17 .cse3 .cse18 .cse19)) .cse5 .cse6 .cse7 .cse8) (and (or (and (= main_~b~0 main_~r_add~0) .cse20 .cse17 .cse3) (and .cse17 .cse3 .cse19 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32)))) .cse16 .cse18))))) [2018-11-18 15:04:10,961 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-11-18 15:04:10,961 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L421 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) main_~sa~0)) (.cse1 (= main_~tmp~2 (_ bv0 32))) (.cse2 (= main_~b~0 (_ bv0 32))) (.cse5 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse4 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse3 (= (_ bv0 32) main_~zero~0))) (or (and .cse0 .cse1 .cse2) (and (not (bvugt main_~a~0 (_ bv0 32))) .cse0 .cse3 .cse1) (and .cse4 .cse3 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (and (= (_ bv4294967295 32) main_~a~0) .cse5 .cse3) (and (= main_~tmp___0~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0) .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)) .cse5 .cse4 .cse3 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L421 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L425 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-11-18 15:04:10,962 INFO L421 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (= main_~a~0 main_~r_add~0) (and (= main_~b~0 main_~r_add~0) (= (_ bv0 32) main_~zero~0))) [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L428 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L425 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-11-18 15:04:10,963 INFO L421 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))) (.cse10 (= (_ bv0 32) main_~zero~0)) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)))) (let ((.cse1 (and .cse6 (and .cse7 (and (or (and (= main_~a~0 main_~r_add~0) .cse10) (and (= main_~b~0 main_~r_add~0) .cse9 .cse10)) .cse8)))) (.cse3 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) main_~tmp___4~0)) (.cse0 (= main_~tmp___3~0 (_ bv0 32))) (.cse2 (= main_~tmp___4~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4) (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 ((.cse5 (and .cse6 (and .cse7 .cse8 .cse9 .cse10)))) (or (and .cse5 .cse3 .cse4) (and .cse5 .cse0 .cse2))) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-11-18 15:04:10,964 INFO L421 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-18 15:04:10,964 INFO L428 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-11-18 15:04:10,964 INFO L421 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (let ((.cse1 (= addflt_~a |addflt_#in~a|))) (and (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32)))) (or (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|) (= .cse0 addflt_~mb~0) (exists ((addflt_~a (_ BitVec 32))) (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) .cse1 (= .cse2 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)) (and (= .cse0 addflt_~ma~0) (= .cse2 addflt_~ea~0) (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (bvult addflt_~b addflt_~a)))) (not (= (_ bv0 32) |addflt_#in~b|)) (let ((.cse3 (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))))) (or (and (not (bvult |addflt_#in~a| |addflt_#in~b|)) .cse3 .cse1) (and .cse3 (= addflt_~a |addflt_#in~b|)))) (bvugt |addflt_#in~a| (_ bv0 32)))) [2018-11-18 15:04:10,964 INFO L425 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-18 15:04:10,965 INFO L421 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse31 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse36 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) (.cse25 (= addflt_~b |addflt_#in~a|)) (.cse12 (= addflt_~a |addflt_#in~a|)) (.cse29 (= addflt_~a |addflt_#in~b|)) (.cse24 (= addflt_~b |addflt_#in~b|))) (let ((.cse32 (let ((.cse39 (let ((.cse40 (not (bvult addflt_~a addflt_~b)))) (or (and .cse40 .cse29) (and .cse24 .cse40))))) (or (and .cse39 .cse25) (and .cse39 .cse12)))) (.cse6 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse36) |addflt_#in~a|))) (.cse10 (bvult |addflt_#in~a| |addflt_#in~b|)) (.cse34 (bvadd .cse31 (_ bv4294967168 32)))) (let ((.cse26 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse34) addflt_~ea~0))) (.cse27 (bvult |addflt_#in~a| addflt_~a)) (.cse28 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse33 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse30 (not .cse10)) (.cse9 (and .cse32 .cse6 (not (bvult addflt_~__retres10~0 |addflt_#in~a|))))) (let ((.cse1 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse3 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse38 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (and (not (= .cse38 (_ bv0 32))) (= (_ bv33554431 32) (bvadd (bvneg .cse38) addflt_~ma~0)))))) (.cse0 (not (= (_ bv4294967295 32) |addflt_#in~b|))) (.cse4 (let ((.cse37 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse37) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse37) .cse36) |addflt_#in~a|))))) (.cse5 (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) .cse36) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse35) (_ bv0 32)))))) (.cse2 (= (_ bv0 32) |addflt_#in~b|)) (.cse8 (= (_ bv0 32) |addflt_#in~a|)) (.cse7 (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))) (.cse16 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse13 (and (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)) (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg (bvadd .cse28 (_ bv4294967168 32))) (_ bv4294967168 32))) addflt_~mb~0) (or (and .cse33 .cse30 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) .cse9) (= .cse34 addflt_~ea~0) .cse12 .cse24)) (.cse14 (and .cse32 (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))) .cse33 (not (= (_ bv0 32) .cse26)) .cse27)) (.cse15 (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))))) .cse30 (not (= (bvadd .cse31 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse31 (_ bv4294967169 32)) addflt_~ea~0) .cse12 .cse24))) (and (or .cse0 .cse1 (and (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) (= (_ bv127 32) addflt_~eb~0))) (or .cse2 (or (and (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))) .cse3) (and .cse4 .cse5 .cse6)) .cse1) (or (or .cse3 (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)) .cse7)) .cse0 .cse8) (let ((.cse11 (or .cse13 .cse14 .cse15))) (or (and .cse9 .cse10) (and .cse10 .cse11) (and .cse12 (= addflt_~__retres10~0 |addflt_#in~a|)) (and (not .cse2) .cse12 .cse11))) (or .cse16 (bvugt |addflt_#in~a| (_ bv0 32))) (or (and .cse4 .cse5 (exists ((addflt_~a (_ BitVec 32))) (let ((.cse18 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse19 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse18 (_ bv4294967168 32))))) (let ((.cse17 (bvadd (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)) (bvneg (bvneg .cse19))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse17) (bvshl .cse18 (_ bv24 32)))) (= (bvand (_ bv33554432 32) .cse17) (_ bv0 32)) (bvult |addflt_#in~a| addflt_~a) (not (= .cse19 (_ bv0 32)))))))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse20 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))))) (let ((.cse22 (bvneg .cse20)) (.cse21 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (let ((.cse23 (bvadd .cse22 .cse21))) (and (not (= (bvadd .cse20 .cse21 .cse22) (_ bv0 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse23) (bvshl (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv24 32)))) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse23)))))))) (and .cse2 .cse24) (and .cse8 .cse25) (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))) .cse7 (= .cse26 addflt_~mb~0) .cse27 .cse16) .cse13 .cse14 .cse15 (and (= (bvadd .cse28 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse28 (_ bv4294967041 32)) (_ bv0 32))) (exists ((v_addflt_~ma~0_93 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_93) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) .cse29))))))) [2018-11-18 15:04:10,965 INFO L425 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-11-18 15:04:10,965 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-11-18 15:04:10,965 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-18 15:04:10,966 INFO L425 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-11-18 15:04:10,966 INFO L421 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (let ((.cse3 (= addflt_~a |addflt_#in~a|)) (.cse8 (= addflt_~b |addflt_#in~b|))) (let ((.cse2 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse9 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse1 (let ((.cse14 (let ((.cse15 (let ((.cse16 (not (bvult addflt_~a addflt_~b)))) (or (and .cse16 (= addflt_~a |addflt_#in~b|)) (and .cse8 .cse16))))) (or (and .cse15 (= addflt_~b |addflt_#in~a|)) (and .cse15 .cse3))))) (or (and (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)) .cse14 (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))))) (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)) .cse14))))) (let ((.cse4 (let ((.cse11 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse13 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse11) |addflt_#in~a|)))) (or (and (let ((.cse10 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse10) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse10) .cse11) |addflt_#in~a|)))) (let ((.cse12 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse12) .cse11) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse12) (_ bv0 32))))) .cse1 .cse13 (bvult |addflt_#in~a| addflt_~a)) (and .cse1 .cse3 .cse13))))) (.cse7 (bvadd .cse9 (_ bv4294967168 32))) (.cse5 (bvadd .cse2 (_ bv4294967168 32))) (.cse6 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)))) (and (or (and (let ((.cse0 (= (bvlshr .cse6 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse7) (_ bv4294967168 32))) addflt_~mb~0))) (or (and .cse0 .cse1 (not (= (bvadd .cse2 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse2 (_ bv4294967169 32)) addflt_~ea~0) .cse3) (and .cse0 .cse4 (= .cse5 addflt_~ea~0) .cse3))) (not (= (_ bv0 32) |addflt_#in~b|)) .cse8) (and .cse4 (bvult |addflt_#in~a| |addflt_#in~b|))) (or (and (= (bvadd .cse9 (_ bv4294967169 32)) addflt_~ea~0) .cse4 (not (= (bvadd .cse9 (_ bv4294967041 32)) (_ bv0 32)))) (and (= .cse7 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 .cse5) 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 .cse6) addflt_~ma~0)))) .cse8) (bvugt |addflt_#in~a| (_ bv0 32)) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))))) [2018-11-18 15:04:10,966 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-18 15:04:10,966 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-18 15:04:10,966 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-18 15:04:10,966 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-18 15:04:10,967 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-18 15:04:10,967 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-18 15:04:10,981 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,982 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,983 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,983 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,983 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,983 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,983 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,984 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,984 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,984 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,984 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,984 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,985 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,985 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,985 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,985 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,986 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:10,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:10,987 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,988 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,989 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,990 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:10,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:10,991 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:10,992 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:10,993 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,QUANTIFIED] [2018-11-18 15:04:11,000 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,001 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,002 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,003 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,004 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,005 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,006 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,007 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,008 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,009 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,010 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,QUANTIFIED] [2018-11-18 15:04:11,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:04:11 BoogieIcfgContainer [2018-11-18 15:04:11,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:04:11,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:04:11,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:04:11,016 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:04:11,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:59:25" (3/4) ... [2018-11-18 15:04:11,019 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:04:11,026 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:04:11,026 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-18 15:04:11,026 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:04:11,026 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-11-18 15:04:11,026 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 15:04:11,031 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-18 15:04:11,032 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 15:04:11,032 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 15:04:11,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-11-18 15:04:11,059 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 15:04:11,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 15:04:11,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 15:04:11,060 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(4294967295bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) || (~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb)) && ((0bv32 == \old(b) || ((\exists addflt_~b : bv32, addflt_~a : bv32 :: (~bvadd64(eb, 128bv32) == ~bvlshr64(addflt_~b, 24bv32) && !~bvult64(addflt_~a, addflt_~b)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), 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)))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma))) || !(4294967295bv32 == \old(b))) || 0bv32 == \old(a))) && ((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) && ~bvult64(\old(a), \old(b))) || (~bvult64(\old(a), \old(b)) && ((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b))))) || (a == \old(a) && __retres10 == \old(a))) || ((!(0bv32 == \old(b)) && a == \old(a)) && ((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)))))) && (__retres10 == \old(b) || ~bvugt32(\old(a), 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))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && (\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))))) || (0bv32 == \old(b) && b == \old(b))) || (0bv32 == \old(a) && b == \old(a))) || (((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma)) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && ~bvult64(\old(a), a)) && __retres10 == \old(b))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b))) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b))) || (((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && (\exists v_addflt_~ma~0_93 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_93), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && a == \old(b))) [2018-11-18 15:04:11,097 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b8b2ee80-4e1e-4c34-b0e1-59f4251eb148/bin-2019/utaipan/witness.graphml [2018-11-18 15:04:11,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:04:11,098 INFO L168 Benchmark]: Toolchain (without parser) took 286183.55 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 252.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -296.4 MB). Peak memory consumption was 453.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,098 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:04:11,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.80 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,099 INFO L168 Benchmark]: Boogie Preprocessor took 60.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,099 INFO L168 Benchmark]: RCFGBuilder took 308.51 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,100 INFO L168 Benchmark]: TraceAbstraction took 285481.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 760.2 MB in the end (delta: 303.5 MB). Peak memory consumption was 487.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,100 INFO L168 Benchmark]: Witness Printer took 81.91 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 760.2 MB in the beginning and 1.2 GB in the end (delta: -486.0 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:04:11,102 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.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 16.80 ms. Allocated memory is still 1.0 GB. Free memory was 933.6 MB in the beginning and 928.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 928.3 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.51 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: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 285481.98 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 161.5 MB). Free memory was 1.1 GB in the beginning and 760.2 MB in the end (delta: 303.5 MB). Peak memory consumption was 487.7 MB. Max. memory is 11.5 GB. * Witness Printer took 81.91 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -10.0 MB). Free memory was 760.2 MB in the beginning and 1.2 GB in the end (delta: -486.0 MB). Peak memory consumption was 1.6 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[addflt_~b,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_~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[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_~ma~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_~ma~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_~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_~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_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,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_~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_~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[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_~ma~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_~ma~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_~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_~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_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,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 Derived loop invariant: a == r_add || (b == r_add && 0bv32 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-11-18 15:04:11,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,107 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,108 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,109 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,110 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,110 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,110 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,110 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,110 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,111 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,112 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,113 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,114 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,115 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,QUANTIFIED] [2018-11-18 15:04:11,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,117 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,118 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,119 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,120 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,121 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,122 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,123 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 15:04:11,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 15:04:11,124 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 15:04:11,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 15:04:11,125 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_93,QUANTIFIED] Derived loop invariant: ((((((!(4294967295bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) || (~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb)) && ((0bv32 == \old(b) || ((\exists addflt_~b : bv32, addflt_~a : bv32 :: (~bvadd64(eb, 128bv32) == ~bvlshr64(addflt_~b, 24bv32) && !~bvult64(addflt_~a, addflt_~b)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), 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)))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma))) || !(4294967295bv32 == \old(b))) || 0bv32 == \old(a))) && ((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) && ~bvult64(\old(a), \old(b))) || (~bvult64(\old(a), \old(b)) && ((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b))))) || (a == \old(a) && __retres10 == \old(a))) || ((!(0bv32 == \old(b)) && a == \old(a)) && ((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)))))) && (__retres10 == \old(b) || ~bvugt32(\old(a), 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))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && (\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))))) || (0bv32 == \old(b) && b == \old(b))) || (0bv32 == \old(a) && b == \old(a))) || (((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32, addflt_~a : bv32 :: ~bvlshr64(~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))), 1bv32) == ma)) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && ~bvult64(\old(a), a)) && __retres10 == \old(b))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && !(0bv32 == ~bvand64(33554432bv32, ma))) || ((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b))) || ((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a))) && (\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) && !(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))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b))) || (((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && (\exists v_addflt_~ma~0_93 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_93), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && a == \old(b))) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 79 locations, 1 error locations. SAFE Result, 285.3s OverallTime, 45 OverallIterations, 4 TraceHistogramMax, 71.7s AutomataDifference, 0.0s DeadEndRemovalTime, 185.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4887 SDtfs, 2677 SDslu, 28337 SDs, 0 SdLazy, 7515 SolverSat, 425 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4169 GetRequests, 3660 SyntacticMatches, 28 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 55.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred 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.7s AutomataMinimizationTime, 45 MinimizatonAttempts, 1325 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 462 PreInvPairs, 628 NumberOfFragments, 3635 HoareAnnotationTreeSize, 462 FomulaSimplifications, 25721599 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 22 FomulaSimplificationsInter, 169496 FormulaSimplificationTreeSizeReductionInter, 184.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 3270 NumberOfCodeBlocks, 3270 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 3927 ConstructedInterpolants, 106 QuantifiedInterpolants, 718673 SizeOfPredicates, 275 NumberOfNonLiveVariables, 5581 ConjunctsInSsa, 505 ConjunctsInUnsatCore, 68 InterpolantComputations, 38 PerfectInterpolantSequences, 1288/1408 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...