./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/AutomizerReach.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_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer --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 Automizer --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_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/AutomizerReach.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_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer --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 Automizer --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-aa41828 [2018-11-22 22:30:45,431 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:30:45,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:30:45,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:30:45,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:30:45,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:30:45,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:30:45,443 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:30:45,444 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:30:45,445 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:30:45,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:30:45,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:30:45,446 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:30:45,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:30:45,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:30:45,448 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:30:45,449 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:30:45,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:30:45,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:30:45,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:30:45,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:30:45,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:30:45,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:30:45,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:30:45,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:30:45,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:30:45,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:30:45,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:30:45,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:30:45,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:30:45,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:30:45,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:30:45,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:30:45,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:30:45,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:30:45,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:30:45,463 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 22:30:45,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:30:45,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:30:45,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:30:45,474 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:30:45,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:30:45,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:30:45,475 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:30:45,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:30:45,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:30:45,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:30:45,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:30:45,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:30:45,476 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:30:45,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:30:45,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:30:45,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:30:45,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:30:45,477 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:30:45,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:30:45,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:30:45,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:30:45,478 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:30:45,478 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:30:45,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:30:45,478 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_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer 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 -> Automizer 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-22 22:30:45,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:30:45,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:30:45,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:30:45,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:30:45,510 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:30:45,510 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:45,544 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/cfef5c210/108b93b4f708432a8ff12f71581b794a/FLAG276b36c0d [2018-11-22 22:30:45,902 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:30:45,902 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:45,907 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/cfef5c210/108b93b4f708432a8ff12f71581b794a/FLAG276b36c0d [2018-11-22 22:30:46,315 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/cfef5c210/108b93b4f708432a8ff12f71581b794a [2018-11-22 22:30:46,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:30:46,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:30:46,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:30:46,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:30:46,323 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:30:46,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fbfcdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46, skipping insertion in model container [2018-11-22 22:30:46,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:30:46,359 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:30:46,518 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:30:46,521 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:30:46,549 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:30:46,557 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:30:46,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46 WrapperNode [2018-11-22 22:30:46,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:30:46,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:30:46,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:30:46,558 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:30:46,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:30:46,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:30:46,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:30:46,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:30:46,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... [2018-11-22 22:30:46,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:30:46,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:30:46,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:30:46,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:30:46,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:46,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:30:46,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:30:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-22 22:30:46,696 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-22 22:30:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:30:46,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:30:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:30:46,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:30:46,696 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-22 22:30:46,696 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-22 22:30:46,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 22:30:46,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 22:30:46,974 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:30:46,974 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 22:30:46,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:46 BoogieIcfgContainer [2018-11-22 22:30:46,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:30:46,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:30:46,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:30:46,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:30:46,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:30:46" (1/3) ... [2018-11-22 22:30:46,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4627f545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:30:46, skipping insertion in model container [2018-11-22 22:30:46,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:46" (2/3) ... [2018-11-22 22:30:46,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4627f545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:30:46, skipping insertion in model container [2018-11-22 22:30:46,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:46" (3/3) ... [2018-11-22 22:30:46,981 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:46,988 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:30:46,993 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:30:47,007 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:30:47,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:30:47,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:30:47,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:30:47,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:30:47,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:30:47,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:30:47,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:30:47,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:30:47,037 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:30:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-11-22 22:30:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 22:30:47,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:47,063 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:47,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:47,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-11-22 22:30:47,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:47,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:47,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:47,310 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-22 22:30:47,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:30:47,312 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:47,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:47,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:47,514 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-22 22:30:47,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:47,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 13 [2018-11-22 22:30:47,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:30:47,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:30:47,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:30:47,544 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 13 states. [2018-11-22 22:30:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:48,038 INFO L93 Difference]: Finished difference Result 220 states and 359 transitions. [2018-11-22 22:30:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-22 22:30:48,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-22 22:30:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:48,050 INFO L225 Difference]: With dead ends: 220 [2018-11-22 22:30:48,051 INFO L226 Difference]: Without dead ends: 141 [2018-11-22 22:30:48,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-11-22 22:30:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-22 22:30:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-11-22 22:30:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-22 22:30:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2018-11-22 22:30:48,101 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 36 [2018-11-22 22:30:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:48,102 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2018-11-22 22:30:48,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:30:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2018-11-22 22:30:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 22:30:48,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:48,104 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:48,105 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1206867801, now seen corresponding path program 1 times [2018-11-22 22:30:48,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:48,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:48,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:48,269 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-22 22:30:48,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:48,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:30:48,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:30:48,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:30:48,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:30:48,272 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand 8 states. [2018-11-22 22:30:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:48,373 INFO L93 Difference]: Finished difference Result 255 states and 375 transitions. [2018-11-22 22:30:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:30:48,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-11-22 22:30:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:48,376 INFO L225 Difference]: With dead ends: 255 [2018-11-22 22:30:48,376 INFO L226 Difference]: Without dead ends: 182 [2018-11-22 22:30:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:30:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-22 22:30:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-11-22 22:30:48,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-22 22:30:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2018-11-22 22:30:48,395 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 40 [2018-11-22 22:30:48,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:48,395 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2018-11-22 22:30:48,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:30:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2018-11-22 22:30:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 22:30:48,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:48,398 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:48,398 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:48,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:48,399 INFO L82 PathProgramCache]: Analyzing trace with hash -985162678, now seen corresponding path program 1 times [2018-11-22 22:30:48,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:48,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:48,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:48,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:48,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:48,580 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-22 22:30:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:30:48,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:48,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:48,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:48,741 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-22 22:30:48,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:48,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-11-22 22:30:48,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 22:30:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 22:30:48,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-11-22 22:30:48,758 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand 19 states. [2018-11-22 22:30:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:49,329 INFO L93 Difference]: Finished difference Result 344 states and 501 transitions. [2018-11-22 22:30:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-22 22:30:49,330 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-11-22 22:30:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:49,332 INFO L225 Difference]: With dead ends: 344 [2018-11-22 22:30:49,332 INFO L226 Difference]: Without dead ends: 271 [2018-11-22 22:30:49,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-11-22 22:30:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-22 22:30:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 236. [2018-11-22 22:30:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-22 22:30:49,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2018-11-22 22:30:49,349 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 44 [2018-11-22 22:30:49,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:49,350 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2018-11-22 22:30:49,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 22:30:49,350 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2018-11-22 22:30:49,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 22:30:49,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:49,351 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:49,351 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:49,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:49,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1720292238, now seen corresponding path program 1 times [2018-11-22 22:30:49,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:49,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:49,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:49,444 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-22 22:30:49,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:30:49,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:49,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:30:49,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-22 22:30:49,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 22:30:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:30:49,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:30:49,588 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand 17 states. [2018-11-22 22:30:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:50,057 INFO L93 Difference]: Finished difference Result 388 states and 561 transitions. [2018-11-22 22:30:50,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-22 22:30:50,058 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-22 22:30:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:50,060 INFO L225 Difference]: With dead ends: 388 [2018-11-22 22:30:50,060 INFO L226 Difference]: Without dead ends: 324 [2018-11-22 22:30:50,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-11-22 22:30:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-22 22:30:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 228. [2018-11-22 22:30:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-11-22 22:30:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 316 transitions. [2018-11-22 22:30:50,083 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 316 transitions. Word has length 44 [2018-11-22 22:30:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:50,083 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 316 transitions. [2018-11-22 22:30:50,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 22:30:50,083 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 316 transitions. [2018-11-22 22:30:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:50,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:50,085 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:50,085 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:50,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:50,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1063865541, now seen corresponding path program 1 times [2018-11-22 22:30:50,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:50,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:50,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:50,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:50,297 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-22 22:30:50,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:50,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-22 22:30:50,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 22:30:50,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 22:30:50,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:30:50,299 INFO L87 Difference]: Start difference. First operand 228 states and 316 transitions. Second operand 14 states. [2018-11-22 22:30:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:50,592 INFO L93 Difference]: Finished difference Result 399 states and 578 transitions. [2018-11-22 22:30:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 22:30:50,593 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-22 22:30:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:50,595 INFO L225 Difference]: With dead ends: 399 [2018-11-22 22:30:50,595 INFO L226 Difference]: Without dead ends: 333 [2018-11-22 22:30:50,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:30:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-22 22:30:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-11-22 22:30:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-22 22:30:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2018-11-22 22:30:50,611 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 48 [2018-11-22 22:30:50,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:50,611 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2018-11-22 22:30:50,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 22:30:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2018-11-22 22:30:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:50,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:50,613 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:50,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1641589375, now seen corresponding path program 1 times [2018-11-22 22:30:50,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:50,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:30:50,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:50,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:50,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:50,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:50,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 22:30:50,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:30:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:30:50,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:30:50,776 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand 8 states. [2018-11-22 22:30:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:50,899 INFO L93 Difference]: Finished difference Result 388 states and 545 transitions. [2018-11-22 22:30:50,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:30:50,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-11-22 22:30:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:50,901 INFO L225 Difference]: With dead ends: 388 [2018-11-22 22:30:50,902 INFO L226 Difference]: Without dead ends: 349 [2018-11-22 22:30:50,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 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-22 22:30:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-22 22:30:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-11-22 22:30:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-11-22 22:30:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 466 transitions. [2018-11-22 22:30:50,918 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 466 transitions. Word has length 48 [2018-11-22 22:30:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:50,918 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 466 transitions. [2018-11-22 22:30:50,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:30:50,919 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2018-11-22 22:30:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:50,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:50,920 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:50,920 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:50,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-11-22 22:30:50,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:30:50,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:30:50,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:30:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:30:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:30:50,957 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #241#return; [?] CALL call #t~ret8 := main(); [?] havoc ~a~0;~ma~2 := #t~nondet0;havoc #t~nondet0;assume -128 <= #t~nondet1 && #t~nondet1 <= 127;~ea~2 := #t~nondet1;havoc #t~nondet1;havoc ~b~0;~mb~2 := #t~nondet2;havoc #t~nondet2;assume -128 <= #t~nondet3 && #t~nondet3 <= 127;~eb~2 := #t~nondet3;havoc #t~nondet3;havoc ~r_add~0;havoc ~zero~0;havoc ~sa~0;havoc ~sb~0;havoc ~tmp~2;havoc ~tmp___0~0;havoc ~tmp___1~0;havoc ~tmp___2~0;havoc ~tmp___3~0;havoc ~tmp___4~0;havoc ~tmp___5~0;havoc ~tmp___6~0;havoc ~tmp___7~0;havoc ~tmp___8~0;havoc ~tmp___9~0;havoc ~__retres23~0; VAL [main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216] [?] CALL call #t~ret4 := base2flt(0, 0); VAL [|base2flt_#in~e|=0, |base2flt_#in~m|=0] [?] ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; VAL [base2flt_~e=0, base2flt_~m=0, |base2flt_#in~e|=0, |base2flt_#in~m|=0] [?] assume 0 == ~m % 4294967296;~__retres4~0 := 0; VAL [base2flt_~__retres4~0=0, base2flt_~e=0, base2flt_~m=0, |base2flt_#in~e|=0, |base2flt_#in~m|=0] [?] #res := ~__retres4~0; VAL [base2flt_~__retres4~0=0, base2flt_~e=0, base2flt_~m=0, |base2flt_#in~e|=0, |base2flt_#in~m|=0, |base2flt_#res|=0] [?] assume true; VAL [base2flt_~__retres4~0=0, base2flt_~e=0, base2flt_~m=0, |base2flt_#in~e|=0, |base2flt_#in~m|=0, |base2flt_#res|=0] [?] RET #245#return; VAL [main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, |main_#t~ret4|=0] [?] ~zero~0 := #t~ret4;havoc #t~ret4; VAL [main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0] [?] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [|base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; VAL [base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] assume !(0 == ~m % 4294967296); VAL [base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] assume !(~m % 4294967296 < 16777216); VAL [base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] assume !false; VAL [base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] assume ~m % 4294967296 >= 33554432; VAL [base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] assume ~e >= 127;~__retres4~0 := 4294967295; VAL [base2flt_~__retres4~0=4294967295, base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432] [?] #res := ~__retres4~0; VAL [base2flt_~__retres4~0=4294967295, base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432, |base2flt_#res|=4294967295] [?] assume true; VAL [base2flt_~__retres4~0=4294967295, base2flt_~e=127, base2flt_~m=33554432, |base2flt_#in~e|=127, |base2flt_#in~m|=33554432, |base2flt_#res|=4294967295] [?] RET #247#return; VAL [main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0, |main_#t~ret5|=4294967295] [?] ~a~0 := #t~ret5;havoc #t~ret5; VAL [main_~a~0=4294967295, main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0] [?] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [|base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; VAL [base2flt_~e=0, base2flt_~m=16777216, |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] assume !(0 == ~m % 4294967296); VAL [base2flt_~e=0, base2flt_~m=16777216, |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] assume !(~m % 4294967296 < 16777216); VAL [base2flt_~e=0, base2flt_~m=16777216, |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] assume !false; VAL [base2flt_~e=0, base2flt_~m=16777216, |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] assume !(~m % 4294967296 >= 33554432); VAL [base2flt_~e=0, base2flt_~m=16777216, |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216));~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e));~__retres4~0 := ~res~0; VAL [base2flt_~__retres4~0=(- 72057589726183425), base2flt_~e=0, base2flt_~res~0=(- 72057589726183425), |base2flt_#in~e|=0, |base2flt_#in~m|=16777216] [?] #res := ~__retres4~0; VAL [base2flt_~__retres4~0=(- 72057589726183425), base2flt_~e=0, base2flt_~res~0=(- 72057589726183425), |base2flt_#in~e|=0, |base2flt_#in~m|=16777216, |base2flt_#res|=(- 72057589726183425)] [?] assume true; VAL [base2flt_~__retres4~0=(- 72057589726183425), base2flt_~e=0, base2flt_~res~0=(- 72057589726183425), |base2flt_#in~e|=0, |base2flt_#in~m|=16777216, |base2flt_#res|=(- 72057589726183425)] [?] RET #249#return; VAL [main_~a~0=4294967295, main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0, |main_#t~ret6|=(- 72057589726183425)] [?] ~b~0 := #t~ret6;havoc #t~ret6; VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0] [?] assume !(~a~0 % 4294967296 < ~zero~0 % 4294967296); VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~zero~0=0] [?] assume ~a~0 % 4294967296 > ~zero~0 % 4294967296;~tmp~2 := 1; VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~tmp~2=1, main_~zero~0=0] [?] ~sa~0 := ~tmp~2; VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~sa~0=1, main_~tmp~2=1, main_~zero~0=0] [?] assume !(~b~0 % 4294967296 < ~zero~0 % 4294967296); VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~sa~0=1, main_~tmp~2=1, main_~zero~0=0] [?] assume ~b~0 % 4294967296 > ~zero~0 % 4294967296;~tmp___0~0 := 1; VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~sa~0=1, main_~tmp___0~0=1, main_~tmp~2=1, main_~zero~0=0] [?] ~sb~0 := ~tmp___0~0; VAL [main_~a~0=4294967295, main_~b~0=(- 72057589726183425), main_~ea~2=127, main_~eb~2=0, main_~ma~2=33554432, main_~mb~2=16777216, main_~sa~0=1, main_~sb~0=1, main_~tmp___0~0=1, main_~tmp~2=1, main_~zero~0=0] [?] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [|addflt_#in~a|=4294967295, |addflt_#in~b|=(- 72057589726183425)] [?] ~a := #in~a;~b := #in~b;havoc ~res~1;havoc ~ma~0;havoc ~mb~0;havoc ~delta~0;havoc ~ea~0;havoc ~eb~0;havoc ~tmp~0;havoc ~__retres10~0; VAL [addflt_~a=4294967295, addflt_~b=(- 72057589726183425), |addflt_#in~a|=4294967295, |addflt_#in~b|=(- 72057589726183425)] [?] assume !(~a % 4294967296 < ~b % 4294967296); VAL [addflt_~a=4294967295, addflt_~b=(- 72057589726183425), |addflt_#in~a|=4294967295, |addflt_#in~b|=(- 72057589726183425)] [?] assume !(0 == ~b % 4294967296);~ma~0 := ~bitwiseAnd(~a, 16777215);~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128;~ma~0 := ~bitwiseOr(~ma~0, 16777216);~mb~0 := ~bitwiseAnd(~b, 16777215);~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128;~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [addflt_~a=4294967295, addflt_~b=(- 72057589726183425), addflt_~ea~0=127, addflt_~eb~0=128, |addflt_#in~a|=4294967295, |addflt_#in~b|=(- 72057589726183425)] [?] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19-L24] assume 0 == ~m % 4294967296; [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L14-L72] ensures true; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19-L24] assume !(0 == ~m % 4294967296); VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25-L65] assume !(~m % 4294967296 < 16777216); VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] assume !false; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49-L53] assume ~m % 4294967296 >= 33554432; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54-L59] assume ~e >= 127; [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L14-L72] ensures true; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19-L24] assume !(0 == ~m % 4294967296); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25-L65] assume !(~m % 4294967296 < 16777216); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] assume !false; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49-L53] assume !(~m % 4294967296 >= 33554432); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L14-L72] ensures true; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244-L253] assume !(~a~0 % 4294967296 < ~zero~0 % 4294967296); VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247-L251] assume ~a~0 % 4294967296 > ~zero~0 % 4294967296; [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254-L263] assume !(~b~0 % 4294967296 < ~zero~0 % 4294967296); VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257-L261] assume ~b~0 % 4294967296 > ~zero~0 % 4294967296; [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84-L90] assume !(~a % 4294967296 < ~b % 4294967296); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91-L96] assume !(0 == ~b % 4294967296); [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19-L24] assume 0 == ~m % 4294967296; [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L14-L72] ensures true; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19-L24] assume !(0 == ~m % 4294967296); VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25-L65] assume !(~m % 4294967296 < 16777216); VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] assume !false; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49-L53] assume ~m % 4294967296 >= 33554432; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54-L59] assume ~e >= 127; [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L14-L72] ensures true; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19-L24] assume !(0 == ~m % 4294967296); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25-L65] assume !(~m % 4294967296 < 16777216); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] assume !false; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49-L53] assume !(~m % 4294967296 >= 33554432); VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L14-L72] ensures true; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244-L253] assume !(~a~0 % 4294967296 < ~zero~0 % 4294967296); VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247-L251] assume ~a~0 % 4294967296 > ~zero~0 % 4294967296; [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254-L263] assume !(~b~0 % 4294967296 < ~zero~0 % 4294967296); VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257-L261] assume ~b~0 % 4294967296 > ~zero~0 % 4294967296; [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84-L90] assume !(~a % 4294967296 < ~b % 4294967296); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91-L96] assume !(0 == ~b % 4294967296); [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6-L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19] COND TRUE 0 == ~m % 4294967296 [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] COND FALSE !(false) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49] COND TRUE ~m % 4294967296 >= 33554432 VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54] COND TRUE ~e >= 127 [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] COND FALSE !(false) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49] COND FALSE !(~m % 4294967296 >= 33554432) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244] COND FALSE !(~a~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247] COND TRUE ~a~0 % 4294967296 > ~zero~0 % 4294967296 [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254] COND FALSE !(~b~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257] COND TRUE ~b~0 % 4294967296 > ~zero~0 % 4294967296 [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84] COND FALSE !(~a % 4294967296 < ~b % 4294967296) VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91] COND FALSE !(0 == ~b % 4294967296) [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19] COND TRUE 0 == ~m % 4294967296 [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] COND FALSE !(false) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49] COND TRUE ~m % 4294967296 >= 33554432 VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54] COND TRUE ~e >= 127 [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] COND FALSE !(false) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49] COND FALSE !(~m % 4294967296 >= 33554432) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244] COND FALSE !(~a~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247] COND TRUE ~a~0 % 4294967296 > ~zero~0 % 4294967296 [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254] COND FALSE !(~b~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257] COND TRUE ~b~0 % 4294967296 > ~zero~0 % 4294967296 [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84] COND FALSE !(~a % 4294967296 < ~b % 4294967296) VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91] COND FALSE !(0 == ~b % 4294967296) [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19] COND TRUE 0 == ~m % 4294967296 [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] COND FALSE !(false) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49] COND TRUE ~m % 4294967296 >= 33554432 VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54] COND TRUE ~e >= 127 [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] COND FALSE !(false) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49] COND FALSE !(~m % 4294967296 >= 33554432) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244] COND FALSE !(~a~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247] COND TRUE ~a~0 % 4294967296 > ~zero~0 % 4294967296 [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254] COND FALSE !(~b~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257] COND TRUE ~b~0 % 4294967296 > ~zero~0 % 4294967296 [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84] COND FALSE !(~a % 4294967296 < ~b % 4294967296) VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91] COND FALSE !(0 == ~b % 4294967296) [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret8 := main(); [L215] havoc ~a~0; [L216] ~ma~2 := #t~nondet0; [L216] havoc #t~nondet0; [L217] assume -128 <= #t~nondet1 && #t~nondet1 <= 127; [L217] ~ea~2 := #t~nondet1; [L217] havoc #t~nondet1; [L218] havoc ~b~0; [L219] ~mb~2 := #t~nondet2; [L219] havoc #t~nondet2; [L220] assume -128 <= #t~nondet3 && #t~nondet3 <= 127; [L220] ~eb~2 := #t~nondet3; [L220] havoc #t~nondet3; [L221] havoc ~r_add~0; [L222] havoc ~zero~0; [L223] havoc ~sa~0; [L224] havoc ~sb~0; [L225] havoc ~tmp~2; [L226] havoc ~tmp___0~0; [L227] havoc ~tmp___1~0; [L228] havoc ~tmp___2~0; [L229] havoc ~tmp___3~0; [L230] havoc ~tmp___4~0; [L231] havoc ~tmp___5~0; [L232] havoc ~tmp___6~0; [L233] havoc ~tmp___7~0; [L234] havoc ~tmp___8~0; [L235] havoc ~tmp___9~0; [L236] havoc ~__retres23~0; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] CALL call #t~ret4 := base2flt(0, 0); VAL [#in~e=0, #in~m=0] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=0, ~e=0, ~m=0] [L19] COND TRUE 0 == ~m % 4294967296 [L20] ~__retres4~0 := 0; VAL [#in~e=0, #in~m=0, ~__retres4~0=0, ~e=0, ~m=0] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=0, #res=0, ~__retres4~0=0, ~e=0, ~m=0] [L240] RET call #t~ret4 := base2flt(0, 0); VAL [#t~ret4=0, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216] [L240] ~zero~0 := #t~ret4; [L240] havoc #t~ret4; VAL [~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] CALL call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#in~e=127, #in~m=33554432] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L47-L62] COND FALSE !(false) VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L49] COND TRUE ~m % 4294967296 >= 33554432 VAL [#in~e=127, #in~m=33554432, ~e=127, ~m=33554432] [L54] COND TRUE ~e >= 127 [L55] ~__retres4~0 := 4294967295; VAL [#in~e=127, #in~m=33554432, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L70] #res := ~__retres4~0; VAL [#in~e=127, #in~m=33554432, #res=4294967295, ~__retres4~0=4294967295, ~e=127, ~m=33554432] [L241] RET call #t~ret5 := base2flt(~ma~2, ~ea~2); VAL [#t~ret5=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L241] ~a~0 := #t~ret5; [L241] havoc #t~ret5; VAL [~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] CALL call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#in~e=0, #in~m=16777216] [L14-L72] ~m := #in~m; [L14-L72] ~e := #in~e; [L15] havoc ~res~0; [L16] havoc ~__retres4~0; VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L19] COND FALSE !(0 == ~m % 4294967296) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L25] COND FALSE !(~m % 4294967296 < 16777216) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L47-L62] COND FALSE !(false) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L49] COND FALSE !(~m % 4294967296 >= 33554432) VAL [#in~e=0, #in~m=16777216, ~e=0, ~m=16777216] [L66] ~m := ~bitwiseAnd(~m, ~bitwiseComplement(16777216)); [L67] ~res~0 := ~bitwiseOr(~m, 16777216 * (128 + ~e)); [L68] ~__retres4~0 := ~res~0; VAL [#in~e=0, #in~m=16777216, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L70] #res := ~__retres4~0; VAL [#in~e=0, #in~m=16777216, #res=-72057589726183425, ~__retres4~0=-72057589726183425, ~e=0, ~res~0=-72057589726183425] [L242] RET call #t~ret6 := base2flt(~mb~2, ~eb~2); VAL [#t~ret6=-72057589726183425, ~a~0=4294967295, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L242] ~b~0 := #t~ret6; [L242] havoc #t~ret6; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L244] COND FALSE !(~a~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~zero~0=0] [L247] COND TRUE ~a~0 % 4294967296 > ~zero~0 % 4294967296 [L248] ~tmp~2 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~tmp~2=1, ~zero~0=0] [L252] ~sa~0 := ~tmp~2; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L254] COND FALSE !(~b~0 % 4294967296 < ~zero~0 % 4294967296) VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp~2=1, ~zero~0=0] [L257] COND TRUE ~b~0 % 4294967296 > ~zero~0 % 4294967296 [L258] ~tmp___0~0 := 1; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L262] ~sb~0 := ~tmp___0~0; VAL [~a~0=4294967295, ~b~0=-72057589726183425, ~ea~2=127, ~eb~2=0, ~ma~2=33554432, ~mb~2=16777216, ~sa~0=1, ~sb~0=1, ~tmp___0~0=1, ~tmp~2=1, ~zero~0=0] [L265] CALL call #t~ret7 := addflt(~a~0, ~b~0); VAL [#in~a=4294967295, #in~b=-72057589726183425] [L73-L136] ~a := #in~a; [L73-L136] ~b := #in~b; [L74] havoc ~res~1; [L75] havoc ~ma~0; [L76] havoc ~mb~0; [L77] havoc ~delta~0; [L78] havoc ~ea~0; [L79] havoc ~eb~0; [L80] havoc ~tmp~0; [L81] havoc ~__retres10~0; VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L84] COND FALSE !(~a % 4294967296 < ~b % 4294967296) VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425] [L91] COND FALSE !(0 == ~b % 4294967296) [L98] ~ma~0 := ~bitwiseAnd(~a, 16777215); [L99] ~ea~0 := (if ~a / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~a / 16777216 % 4294967296 % 4294967296 else ~a / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L100] ~ma~0 := ~bitwiseOr(~ma~0, 16777216); [L101] ~mb~0 := ~bitwiseAnd(~b, 16777215); [L102] ~eb~0 := (if ~b / 16777216 % 4294967296 % 4294967296 <= 2147483647 then ~b / 16777216 % 4294967296 % 4294967296 else ~b / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128; [L103] ~mb~0 := ~bitwiseOr(~mb~0, 16777216); VAL [#in~a=4294967295, #in~b=-72057589726183425, ~a=4294967295, ~b=-72057589726183425, ~ea~0=127, ~eb~0=128] [L104] CALL call __VERIFIER_assert((if ~ea~0 >= ~eb~0 then 1 else 0)); VAL [#in~cond=0] [L5-L10] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L6] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L7] assert false; VAL [#in~cond=0, ~cond=0] [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-72057589726183425, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L257] COND TRUE b > zero [L258] tmp___0 = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L262] sb = tmp___0 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L265] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777215] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-22 22:30:51,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:30:51 BoogieIcfgContainer [2018-11-22 22:30:51,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:30:51,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:30:51,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:30:51,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:30:51,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:46" (3/4) ... [2018-11-22 22:30:51,037 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 22:30:51,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:30:51,038 INFO L168 Benchmark]: Toolchain (without parser) took 4718.87 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 953.8 MB in the beginning and 1.2 GB in the end (delta: -279.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:30:51,039 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:30:51,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:30:51,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:30:51,040 INFO L168 Benchmark]: Boogie Preprocessor took 70.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:30:51,041 INFO L168 Benchmark]: RCFGBuilder took 323.71 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:30:51,042 INFO L168 Benchmark]: TraceAbstraction took 4056.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -115.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:30:51,042 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:30:51,047 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 237.80 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 937.7 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 21.60 ms. Allocated memory is still 1.0 GB. Free memory is still 937.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 937.7 MB in the beginning and 1.1 GB in the end (delta: -206.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.71 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: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4056.56 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 140.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -115.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-72057589726183425, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L257] COND TRUE b > zero [L258] tmp___0 = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L262] sb = tmp___0 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L265] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777215] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. UNSAFE Result, 4.0s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 822 SDslu, 6584 SDs, 0 SdLazy, 2627 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=6, 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 189 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 61789 SizeOfPredicates, 17 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 115/160 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-aa41828 [2018-11-22 22:30:52,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:30:52,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:30:52,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:30:52,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:30:52,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:30:52,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:30:52,586 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:30:52,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:30:52,588 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:30:52,589 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:30:52,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:30:52,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:30:52,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:30:52,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:30:52,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:30:52,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:30:52,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:30:52,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:30:52,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:30:52,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:30:52,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:30:52,600 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:30:52,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:30:52,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:30:52,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:30:52,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:30:52,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:30:52,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:30:52,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:30:52,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:30:52,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:30:52,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:30:52,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:30:52,607 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:30:52,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:30:52,607 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-22 22:30:52,618 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:30:52,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:30:52,619 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:30:52,619 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:30:52,620 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:30:52,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:30:52,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:30:52,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:30:52,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:30:52,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:30:52,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:30:52,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:30:52,622 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:30:52,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:30:52,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-22 22:30:52,623 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-22 22:30:52,624 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_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer 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 -> Automizer 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-22 22:30:52,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:30:52,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:30:52,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:30:52,664 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:30:52,665 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:30:52,665 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:52,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/bd1f98255/69c24129b67548f0b88b8ab9890786c9/FLAGcae882209 [2018-11-22 22:30:53,061 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:30:53,062 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:53,067 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/bd1f98255/69c24129b67548f0b88b8ab9890786c9/FLAGcae882209 [2018-11-22 22:30:53,468 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/data/bd1f98255/69c24129b67548f0b88b8ab9890786c9 [2018-11-22 22:30:53,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:30:53,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:30:53,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:30:53,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:30:53,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:30:53,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f3e9d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53, skipping insertion in model container [2018-11-22 22:30:53,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:30:53,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:30:53,669 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:30:53,672 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:30:53,710 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:30:53,720 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:30:53,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53 WrapperNode [2018-11-22 22:30:53,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:30:53,721 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:30:53,721 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:30:53,721 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:30:53,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:30:53,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:30:53,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:30:53,741 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:30:53,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... [2018-11-22 22:30:53,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:30:53,773 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:30:53,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:30:53,773 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:30:53,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:30:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:30:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-22 22:30:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-22 22:30:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:30:53,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:30:53,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:30:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:30:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-22 22:30:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-22 22:30:53,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-22 22:30:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-22 22:30:54,151 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:30:54,151 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 22:30:54,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:54 BoogieIcfgContainer [2018-11-22 22:30:54,152 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:30:54,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:30:54,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:30:54,155 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:30:54,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:30:53" (1/3) ... [2018-11-22 22:30:54,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414a19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:30:54, skipping insertion in model container [2018-11-22 22:30:54,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:30:53" (2/3) ... [2018-11-22 22:30:54,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1414a19e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:30:54, skipping insertion in model container [2018-11-22 22:30:54,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:54" (3/3) ... [2018-11-22 22:30:54,159 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-22 22:30:54,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:30:54,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 22:30:54,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 22:30:54,203 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:30:54,204 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:30:54,204 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:30:54,204 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:30:54,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:30:54,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:30:54,204 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:30:54,205 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:30:54,205 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:30:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-11-22 22:30:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 22:30:54,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:54,226 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:54,227 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:54,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:54,231 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-11-22 22:30:54,234 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:54,234 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:54,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:54,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-22 22:30:54,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:54,455 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-22 22:30:54,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:54,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 22:30:54,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:30:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:30:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:30:54,471 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 9 states. [2018-11-22 22:30:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:54,710 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2018-11-22 22:30:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:30:54,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-22 22:30:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:54,731 INFO L225 Difference]: With dead ends: 199 [2018-11-22 22:30:54,732 INFO L226 Difference]: Without dead ends: 120 [2018-11-22 22:30:54,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 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-22 22:30:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-22 22:30:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-11-22 22:30:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-22 22:30:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2018-11-22 22:30:54,792 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 36 [2018-11-22 22:30:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:54,793 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2018-11-22 22:30:54,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:30:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2018-11-22 22:30:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 22:30:54,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:54,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:54,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:54,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 306755114, now seen corresponding path program 1 times [2018-11-22 22:30:54,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:54,800 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 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 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:30:54,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:54,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:54,894 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-22 22:30:54,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:54,969 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-22 22:30:54,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:54,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 22:30:54,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:30:54,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:30:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:30:54,973 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 6 states. [2018-11-22 22:30:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:55,082 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2018-11-22 22:30:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:30:55,085 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-22 22:30:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:55,088 INFO L225 Difference]: With dead ends: 185 [2018-11-22 22:30:55,088 INFO L226 Difference]: Without dead ends: 140 [2018-11-22 22:30:55,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:30:55,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-22 22:30:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2018-11-22 22:30:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-22 22:30:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2018-11-22 22:30:55,109 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 40 [2018-11-22 22:30:55,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:55,109 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2018-11-22 22:30:55,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:30:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2018-11-22 22:30:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 22:30:55,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:55,112 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:55,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:55,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -842119066, now seen corresponding path program 1 times [2018-11-22 22:30:55,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:55,113 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:55,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:55,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:55,172 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-22 22:30:55,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:55,222 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-22 22:30:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 22:30:55,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:30:55,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:30:55,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:30:55,225 INFO L87 Difference]: Start difference. First operand 133 states and 201 transitions. Second operand 6 states. [2018-11-22 22:30:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:55,299 INFO L93 Difference]: Finished difference Result 301 states and 470 transitions. [2018-11-22 22:30:55,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:30:55,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-22 22:30:55,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:55,303 INFO L225 Difference]: With dead ends: 301 [2018-11-22 22:30:55,303 INFO L226 Difference]: Without dead ends: 216 [2018-11-22 22:30:55,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:30:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-22 22:30:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 156. [2018-11-22 22:30:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-22 22:30:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-11-22 22:30:55,324 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 40 [2018-11-22 22:30:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:55,325 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-11-22 22:30:55,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:30:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-11-22 22:30:55,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 22:30:55,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:55,328 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:55,329 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:55,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:55,329 INFO L82 PathProgramCache]: Analyzing trace with hash 377249800, now seen corresponding path program 1 times [2018-11-22 22:30:55,329 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:55,329 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:30:55,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:55,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:55,449 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-22 22:30:55,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:55,509 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-22 22:30:55,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:55,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-22 22:30:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:30:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:30:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:30:55,512 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 8 states. [2018-11-22 22:30:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:55,653 INFO L93 Difference]: Finished difference Result 215 states and 325 transitions. [2018-11-22 22:30:55,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:30:55,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-22 22:30:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:55,657 INFO L225 Difference]: With dead ends: 215 [2018-11-22 22:30:55,657 INFO L226 Difference]: Without dead ends: 176 [2018-11-22 22:30:55,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:30:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-22 22:30:55,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2018-11-22 22:30:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-22 22:30:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2018-11-22 22:30:55,676 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 44 [2018-11-22 22:30:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:55,676 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2018-11-22 22:30:55,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:30:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2018-11-22 22:30:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 22:30:55,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:55,678 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:55,678 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:55,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash 434508102, now seen corresponding path program 1 times [2018-11-22 22:30:55,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:55,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:55,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:55,757 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-22 22:30:55,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:30:55,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:55,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:30:55,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:30:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:30:55,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:30:55,760 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 8 states. [2018-11-22 22:30:55,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:55,858 INFO L93 Difference]: Finished difference Result 378 states and 561 transitions. [2018-11-22 22:30:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:30:55,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-22 22:30:55,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:55,860 INFO L225 Difference]: With dead ends: 378 [2018-11-22 22:30:55,860 INFO L226 Difference]: Without dead ends: 283 [2018-11-22 22:30:55,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:30:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-22 22:30:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2018-11-22 22:30:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-11-22 22:30:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2018-11-22 22:30:55,877 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 44 [2018-11-22 22:30:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:55,877 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2018-11-22 22:30:55,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:30:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2018-11-22 22:30:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:55,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:55,879 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:55,879 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:55,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1399634249, now seen corresponding path program 2 times [2018-11-22 22:30:55,881 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:55,894 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-22 22:30:55,909 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-22 22:30:55,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:30:55,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:55,952 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-22 22:30:55,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:30:55,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:55,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:30:55,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:30:55,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:30:55,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:30:55,958 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand 7 states. [2018-11-22 22:30:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:56,157 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2018-11-22 22:30:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:30:56,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-22 22:30:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:56,161 INFO L225 Difference]: With dead ends: 524 [2018-11-22 22:30:56,161 INFO L226 Difference]: Without dead ends: 430 [2018-11-22 22:30:56,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:30:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-11-22 22:30:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 355. [2018-11-22 22:30:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-11-22 22:30:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 514 transitions. [2018-11-22 22:30:56,183 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 514 transitions. Word has length 48 [2018-11-22 22:30:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:56,184 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 514 transitions. [2018-11-22 22:30:56,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:30:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 514 transitions. [2018-11-22 22:30:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:56,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:56,186 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:56,187 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:56,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:56,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1006607239, now seen corresponding path program 1 times [2018-11-22 22:30:56,187 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:56,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:30:56,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:30:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:56,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:56,345 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-22 22:30:56,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:30:56,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:56,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-22 22:30:56,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:30:56,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:30:56,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:30:56,348 INFO L87 Difference]: Start difference. First operand 355 states and 514 transitions. Second operand 13 states. [2018-11-22 22:30:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:56,730 INFO L93 Difference]: Finished difference Result 422 states and 605 transitions. [2018-11-22 22:30:56,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 22:30:56,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-11-22 22:30:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:56,739 INFO L225 Difference]: With dead ends: 422 [2018-11-22 22:30:56,739 INFO L226 Difference]: Without dead ends: 389 [2018-11-22 22:30:56,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:30:56,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-22 22:30:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 372. [2018-11-22 22:30:56,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-22 22:30:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2018-11-22 22:30:56,758 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 48 [2018-11-22 22:30:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:56,758 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2018-11-22 22:30:56,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:30:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2018-11-22 22:30:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:56,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:56,760 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:56,760 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:56,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:56,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1305820667, now seen corresponding path program 1 times [2018-11-22 22:30:56,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:56,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:56,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:56,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:56,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:56,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:56,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 22:30:56,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:30:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:30:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:30:56,910 INFO L87 Difference]: Start difference. First operand 372 states and 533 transitions. Second operand 9 states. [2018-11-22 22:30:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:57,117 INFO L93 Difference]: Finished difference Result 847 states and 1242 transitions. [2018-11-22 22:30:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:30:57,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-11-22 22:30:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:57,121 INFO L225 Difference]: With dead ends: 847 [2018-11-22 22:30:57,121 INFO L226 Difference]: Without dead ends: 698 [2018-11-22 22:30:57,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:30:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-22 22:30:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 438. [2018-11-22 22:30:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-11-22 22:30:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 624 transitions. [2018-11-22 22:30:57,155 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 624 transitions. Word has length 48 [2018-11-22 22:30:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:57,156 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 624 transitions. [2018-11-22 22:30:57,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:30:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 624 transitions. [2018-11-22 22:30:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:57,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:57,158 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:57,159 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:57,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:57,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-11-22 22:30:57,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:57,159 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:57,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:57,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:57,306 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:57,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:57,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:30:57,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:30:57,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:57,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:57,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:30:57,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:30:57,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-22 22:30:57,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 22:30:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:30:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:30:57,567 INFO L87 Difference]: Start difference. First operand 438 states and 624 transitions. Second operand 11 states. [2018-11-22 22:30:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:57,885 INFO L93 Difference]: Finished difference Result 492 states and 698 transitions. [2018-11-22 22:30:57,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:30:57,886 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-11-22 22:30:57,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:57,887 INFO L225 Difference]: With dead ends: 492 [2018-11-22 22:30:57,888 INFO L226 Difference]: Without dead ends: 459 [2018-11-22 22:30:57,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 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-22 22:30:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-11-22 22:30:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2018-11-22 22:30:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-11-22 22:30:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-11-22 22:30:57,908 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 48 [2018-11-22 22:30:57,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:57,909 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-11-22 22:30:57,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 22:30:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-11-22 22:30:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:57,910 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:57,911 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:57,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:57,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash -294368905, now seen corresponding path program 1 times [2018-11-22 22:30:57,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:57,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:57,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:57,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:30:58,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:30:58,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:58,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:30:58,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:30:58,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:30:58,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:30:58,059 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 12 states. [2018-11-22 22:30:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:58,498 INFO L93 Difference]: Finished difference Result 545 states and 760 transitions. [2018-11-22 22:30:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 22:30:58,501 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-22 22:30:58,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:30:58,503 INFO L225 Difference]: With dead ends: 545 [2018-11-22 22:30:58,503 INFO L226 Difference]: Without dead ends: 446 [2018-11-22 22:30:58,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-11-22 22:30:58,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-11-22 22:30:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 411. [2018-11-22 22:30:58,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-11-22 22:30:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 578 transitions. [2018-11-22 22:30:58,532 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 578 transitions. Word has length 48 [2018-11-22 22:30:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:30:58,532 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 578 transitions. [2018-11-22 22:30:58,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:30:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 578 transitions. [2018-11-22 22:30:58,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:30:58,535 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:30:58,535 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:30:58,535 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:30:58,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:30:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1883881285, now seen corresponding path program 1 times [2018-11-22 22:30:58,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:30:58,536 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:30:58,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:30:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:30:58,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:30:58,694 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-22 22:30:58,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:30:58,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:30:58,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:30:58,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:30:58,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:30:58,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:30:58,698 INFO L87 Difference]: Start difference. First operand 411 states and 578 transitions. Second operand 6 states. [2018-11-22 22:30:59,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:30:59,998 INFO L93 Difference]: Finished difference Result 452 states and 627 transitions. [2018-11-22 22:30:59,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:30:59,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-22 22:30:59,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:00,000 INFO L225 Difference]: With dead ends: 452 [2018-11-22 22:31:00,000 INFO L226 Difference]: Without dead ends: 450 [2018-11-22 22:31:00,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:31:00,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-22 22:31:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 417. [2018-11-22 22:31:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-22 22:31:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2018-11-22 22:31:00,019 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 48 [2018-11-22 22:31:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:00,020 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2018-11-22 22:31:00,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:31:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2018-11-22 22:31:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 22:31:00,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:00,021 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:00,021 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:00,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1826622983, now seen corresponding path program 1 times [2018-11-22 22:31:00,022 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:00,022 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:00,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:00,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:00,112 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-22 22:31:00,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:00,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:00,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:31:00,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:31:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:31:00,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:31:00,114 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 6 states. [2018-11-22 22:31:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:04,698 INFO L93 Difference]: Finished difference Result 436 states and 604 transitions. [2018-11-22 22:31:04,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:31:04,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-22 22:31:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:04,700 INFO L225 Difference]: With dead ends: 436 [2018-11-22 22:31:04,700 INFO L226 Difference]: Without dead ends: 434 [2018-11-22 22:31:04,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:31:04,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-22 22:31:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 415. [2018-11-22 22:31:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-11-22 22:31:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 581 transitions. [2018-11-22 22:31:04,716 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 581 transitions. Word has length 48 [2018-11-22 22:31:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:04,716 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 581 transitions. [2018-11-22 22:31:04,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:31:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 581 transitions. [2018-11-22 22:31:04,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 22:31:04,718 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:04,718 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:04,718 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:04,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:04,718 INFO L82 PathProgramCache]: Analyzing trace with hash 609641055, now seen corresponding path program 1 times [2018-11-22 22:31:04,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:04,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:31:04,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:04,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:04,802 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-22 22:31:04,802 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:04,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:04,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 22:31:04,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 22:31:04,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 22:31:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:31:04,806 INFO L87 Difference]: Start difference. First operand 415 states and 581 transitions. Second operand 7 states. [2018-11-22 22:31:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,091 INFO L93 Difference]: Finished difference Result 632 states and 910 transitions. [2018-11-22 22:31:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:31:05,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-22 22:31:05,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,095 INFO L225 Difference]: With dead ends: 632 [2018-11-22 22:31:05,095 INFO L226 Difference]: Without dead ends: 537 [2018-11-22 22:31:05,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:31:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-11-22 22:31:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 407. [2018-11-22 22:31:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-22 22:31:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 568 transitions. [2018-11-22 22:31:05,129 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 568 transitions. Word has length 49 [2018-11-22 22:31:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,129 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 568 transitions. [2018-11-22 22:31:05,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 22:31:05,129 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2018-11-22 22:31:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 22:31:05,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,130 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,130 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,131 INFO L82 PathProgramCache]: Analyzing trace with hash 666899357, now seen corresponding path program 1 times [2018-11-22 22:31:05,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,215 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-22 22:31:05,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:05,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:05,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:31:05,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:31:05,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:31:05,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:31:05,218 INFO L87 Difference]: Start difference. First operand 407 states and 568 transitions. Second operand 4 states. [2018-11-22 22:31:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,260 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2018-11-22 22:31:05,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:31:05,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-22 22:31:05,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,262 INFO L225 Difference]: With dead ends: 666 [2018-11-22 22:31:05,262 INFO L226 Difference]: Without dead ends: 533 [2018-11-22 22:31:05,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:31:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-11-22 22:31:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 477. [2018-11-22 22:31:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-22 22:31:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2018-11-22 22:31:05,282 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 49 [2018-11-22 22:31:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,282 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2018-11-22 22:31:05,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:31:05,282 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2018-11-22 22:31:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 22:31:05,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,283 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,283 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,284 INFO L82 PathProgramCache]: Analyzing trace with hash -855742356, now seen corresponding path program 1 times [2018-11-22 22:31:05,284 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,284 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,323 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-22 22:31:05,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:05,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:05,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:31:05,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:31:05,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:31:05,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:31:05,325 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand 4 states. [2018-11-22 22:31:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,402 INFO L93 Difference]: Finished difference Result 865 states and 1185 transitions. [2018-11-22 22:31:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:31:05,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-22 22:31:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,404 INFO L225 Difference]: With dead ends: 865 [2018-11-22 22:31:05,404 INFO L226 Difference]: Without dead ends: 394 [2018-11-22 22:31:05,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:31:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-22 22:31:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-11-22 22:31:05,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-22 22:31:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 507 transitions. [2018-11-22 22:31:05,424 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 507 transitions. Word has length 49 [2018-11-22 22:31:05,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,424 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 507 transitions. [2018-11-22 22:31:05,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:31:05,424 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 507 transitions. [2018-11-22 22:31:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 22:31:05,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,426 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,426 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash 849971633, now seen corresponding path program 1 times [2018-11-22 22:31:05,426 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,469 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-22 22:31:05,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:31:05,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:31:05,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:31:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:31:05,472 INFO L87 Difference]: Start difference. First operand 382 states and 507 transitions. Second operand 5 states. [2018-11-22 22:31:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,512 INFO L93 Difference]: Finished difference Result 389 states and 513 transitions. [2018-11-22 22:31:05,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:31:05,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-22 22:31:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,513 INFO L225 Difference]: With dead ends: 389 [2018-11-22 22:31:05,514 INFO L226 Difference]: Without dead ends: 382 [2018-11-22 22:31:05,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:31:05,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-22 22:31:05,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-22 22:31:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-22 22:31:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 503 transitions. [2018-11-22 22:31:05,531 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 503 transitions. Word has length 50 [2018-11-22 22:31:05,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,531 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 503 transitions. [2018-11-22 22:31:05,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:31:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 503 transitions. [2018-11-22 22:31:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-22 22:31:05,532 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,532 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,533 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1699165264, now seen corresponding path program 1 times [2018-11-22 22:31:05,533 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,533 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,604 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-22 22:31:05,604 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:05,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:05,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:31:05,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:31:05,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:31:05,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:31:05,607 INFO L87 Difference]: Start difference. First operand 382 states and 503 transitions. Second operand 4 states. [2018-11-22 22:31:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,639 INFO L93 Difference]: Finished difference Result 424 states and 556 transitions. [2018-11-22 22:31:05,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:31:05,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-11-22 22:31:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,641 INFO L225 Difference]: With dead ends: 424 [2018-11-22 22:31:05,641 INFO L226 Difference]: Without dead ends: 399 [2018-11-22 22:31:05,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:31:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-22 22:31:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 374. [2018-11-22 22:31:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-11-22 22:31:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 491 transitions. [2018-11-22 22:31:05,657 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 491 transitions. Word has length 53 [2018-11-22 22:31:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,658 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 491 transitions. [2018-11-22 22:31:05,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:31:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 491 transitions. [2018-11-22 22:31:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-22 22:31:05,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,659 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,659 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1987036572, now seen corresponding path program 1 times [2018-11-22 22:31:05,659 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,660 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,701 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-22 22:31:05,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:05,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:05,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:31:05,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:31:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:31:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:31:05,703 INFO L87 Difference]: Start difference. First operand 374 states and 491 transitions. Second operand 4 states. [2018-11-22 22:31:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:05,734 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2018-11-22 22:31:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:31:05,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-22 22:31:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:05,736 INFO L225 Difference]: With dead ends: 391 [2018-11-22 22:31:05,736 INFO L226 Difference]: Without dead ends: 321 [2018-11-22 22:31:05,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:31:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-22 22:31:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-11-22 22:31:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-22 22:31:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2018-11-22 22:31:05,750 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 54 [2018-11-22 22:31:05,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:05,750 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2018-11-22 22:31:05,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:31:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2018-11-22 22:31:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:05,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:05,752 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:05,753 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:05,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1390680844, now seen corresponding path program 1 times [2018-11-22 22:31:05,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:05,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:05,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:31:05,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:31:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-22 22:31:05,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:31:05,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-22 22:31:05,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 22:31:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 22:31:05,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:31:05,964 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand 16 states. [2018-11-22 22:31:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:06,184 INFO L93 Difference]: Finished difference Result 420 states and 523 transitions. [2018-11-22 22:31:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:31:06,185 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-11-22 22:31:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:06,186 INFO L225 Difference]: With dead ends: 420 [2018-11-22 22:31:06,186 INFO L226 Difference]: Without dead ends: 347 [2018-11-22 22:31:06,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-22 22:31:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-22 22:31:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2018-11-22 22:31:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-22 22:31:06,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 384 transitions. [2018-11-22 22:31:06,203 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 384 transitions. Word has length 56 [2018-11-22 22:31:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:06,204 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 384 transitions. [2018-11-22 22:31:06,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 22:31:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 384 transitions. [2018-11-22 22:31:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:06,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:06,205 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:06,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:06,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1813382670, now seen corresponding path program 1 times [2018-11-22 22:31:06,206 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:06,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:06,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:06,364 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-22 22:31:06,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:06,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:06,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-22 22:31:06,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:31:06,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:31:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:31:06,366 INFO L87 Difference]: Start difference. First operand 303 states and 384 transitions. Second operand 13 states. [2018-11-22 22:31:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:06,723 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2018-11-22 22:31:06,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:31:06,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-11-22 22:31:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:06,725 INFO L225 Difference]: With dead ends: 366 [2018-11-22 22:31:06,725 INFO L226 Difference]: Without dead ends: 321 [2018-11-22 22:31:06,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-22 22:31:06,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-22 22:31:06,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-11-22 22:31:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-22 22:31:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 376 transitions. [2018-11-22 22:31:06,746 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 376 transitions. Word has length 56 [2018-11-22 22:31:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:06,747 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 376 transitions. [2018-11-22 22:31:06,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:31:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 376 transitions. [2018-11-22 22:31:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:06,748 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:06,748 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:06,748 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:06,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:06,748 INFO L82 PathProgramCache]: Analyzing trace with hash -848138954, now seen corresponding path program 1 times [2018-11-22 22:31:06,750 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:06,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:06,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:06,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:31:06,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:31:07,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:31:07,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:31:07,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:07,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:31:07,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:31:07,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:31:07,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-22 22:31:07,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 22:31:07,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:31:07,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:31:07,234 INFO L87 Difference]: Start difference. First operand 298 states and 376 transitions. Second operand 11 states. [2018-11-22 22:31:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:09,536 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2018-11-22 22:31:09,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:31:09,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-22 22:31:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:09,539 INFO L225 Difference]: With dead ends: 350 [2018-11-22 22:31:09,539 INFO L226 Difference]: Without dead ends: 319 [2018-11-22 22:31:09,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2018-11-22 22:31:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-22 22:31:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-11-22 22:31:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-22 22:31:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 372 transitions. [2018-11-22 22:31:09,559 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 372 transitions. Word has length 56 [2018-11-22 22:31:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:09,559 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 372 transitions. [2018-11-22 22:31:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 22:31:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 372 transitions. [2018-11-22 22:31:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 22:31:09,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:09,560 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:09,561 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:09,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1591720731, now seen corresponding path program 1 times [2018-11-22 22:31:09,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:09,561 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:09,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:09,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 22:31:09,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:09,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:09,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:31:09,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:31:09,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:31:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:31:09,657 INFO L87 Difference]: Start difference. First operand 296 states and 372 transitions. Second operand 6 states. [2018-11-22 22:31:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:09,828 INFO L93 Difference]: Finished difference Result 378 states and 489 transitions. [2018-11-22 22:31:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:31:09,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-22 22:31:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:09,830 INFO L225 Difference]: With dead ends: 378 [2018-11-22 22:31:09,830 INFO L226 Difference]: Without dead ends: 331 [2018-11-22 22:31:09,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:31:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-22 22:31:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2018-11-22 22:31:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-11-22 22:31:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2018-11-22 22:31:09,846 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 55 [2018-11-22 22:31:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:09,846 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2018-11-22 22:31:09,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:31:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2018-11-22 22:31:09,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:09,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:09,848 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:09,848 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:09,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1018041358, now seen corresponding path program 1 times [2018-11-22 22:31:09,848 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:09,849 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:09,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:09,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 22:31:09,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:31:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:31:09,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:31:09,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-22 22:31:09,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:31:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:31:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:31:09,986 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand 10 states. [2018-11-22 22:31:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:10,110 INFO L93 Difference]: Finished difference Result 407 states and 501 transitions. [2018-11-22 22:31:10,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:31:10,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-11-22 22:31:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:10,111 INFO L225 Difference]: With dead ends: 407 [2018-11-22 22:31:10,112 INFO L226 Difference]: Without dead ends: 329 [2018-11-22 22:31:10,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:31:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-22 22:31:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2018-11-22 22:31:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-22 22:31:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 352 transitions. [2018-11-22 22:31:10,134 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 352 transitions. Word has length 56 [2018-11-22 22:31:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 352 transitions. [2018-11-22 22:31:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:31:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 352 transitions. [2018-11-22 22:31:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:10,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:10,135 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:10,135 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:10,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:10,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1440743184, now seen corresponding path program 1 times [2018-11-22 22:31:10,136 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:10,136 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:31:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:10,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:31:12,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:12,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:31:12,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:31:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:31:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=110, Unknown=1, NotChecked=0, Total=132 [2018-11-22 22:31:12,325 INFO L87 Difference]: Start difference. First operand 280 states and 352 transitions. Second operand 12 states. [2018-11-22 22:31:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:26,550 INFO L93 Difference]: Finished difference Result 324 states and 406 transitions. [2018-11-22 22:31:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 22:31:26,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-22 22:31:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:26,551 INFO L225 Difference]: With dead ends: 324 [2018-11-22 22:31:26,551 INFO L226 Difference]: Without dead ends: 291 [2018-11-22 22:31:26,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=89, Invalid=368, Unknown=5, NotChecked=0, Total=462 [2018-11-22 22:31:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-22 22:31:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 278. [2018-11-22 22:31:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-22 22:31:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 348 transitions. [2018-11-22 22:31:26,578 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 348 transitions. Word has length 56 [2018-11-22 22:31:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:26,578 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 348 transitions. [2018-11-22 22:31:26,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:31:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 348 transitions. [2018-11-22 22:31:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:26,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:26,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:26,579 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:26,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash -475499468, now seen corresponding path program 1 times [2018-11-22 22:31:26,580 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:26,580 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:26,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:26,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:33,760 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-22 22:31:33,760 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:33,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:33,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:31:33,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:31:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:31:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2018-11-22 22:31:33,764 INFO L87 Difference]: Start difference. First operand 278 states and 348 transitions. Second operand 8 states. [2018-11-22 22:31:41,502 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 25 DAG size of output: 15 [2018-11-22 22:31:51,083 WARN L180 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-22 22:31:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:51,247 INFO L93 Difference]: Finished difference Result 301 states and 371 transitions. [2018-11-22 22:31:51,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:31:51,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-22 22:31:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:51,248 INFO L225 Difference]: With dead ends: 301 [2018-11-22 22:31:51,248 INFO L226 Difference]: Without dead ends: 299 [2018-11-22 22:31:51,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=31, Invalid=75, Unknown=4, NotChecked=0, Total=110 [2018-11-22 22:31:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-22 22:31:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2018-11-22 22:31:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-22 22:31:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 353 transitions. [2018-11-22 22:31:51,270 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 353 transitions. Word has length 56 [2018-11-22 22:31:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:51,270 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 353 transitions. [2018-11-22 22:31:51,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:31:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 353 transitions. [2018-11-22 22:31:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:51,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:51,272 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:51,272 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:51,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -695289963, now seen corresponding path program 1 times [2018-11-22 22:31:51,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:51,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:31:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:51,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:51,426 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-22 22:31:51,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:51,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:51,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:31:51,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:31:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:31:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:31:51,429 INFO L87 Difference]: Start difference. First operand 283 states and 353 transitions. Second operand 12 states. [2018-11-22 22:31:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:51,767 INFO L93 Difference]: Finished difference Result 352 states and 443 transitions. [2018-11-22 22:31:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:31:51,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-11-22 22:31:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:51,769 INFO L225 Difference]: With dead ends: 352 [2018-11-22 22:31:51,769 INFO L226 Difference]: Without dead ends: 327 [2018-11-22 22:31:51,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 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-22 22:31:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-22 22:31:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 299. [2018-11-22 22:31:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-22 22:31:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 375 transitions. [2018-11-22 22:31:51,784 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 375 transitions. Word has length 56 [2018-11-22 22:31:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:51,785 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 375 transitions. [2018-11-22 22:31:51,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:31:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 375 transitions. [2018-11-22 22:31:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:31:51,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:51,786 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:51,786 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:51,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1684269273, now seen corresponding path program 1 times [2018-11-22 22:31:51,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:51,787 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:51,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:51,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:51,870 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-22 22:31:51,870 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:51,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:51,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:31:51,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:31:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:31:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:31:51,872 INFO L87 Difference]: Start difference. First operand 299 states and 375 transitions. Second operand 8 states. [2018-11-22 22:31:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:31:52,090 INFO L93 Difference]: Finished difference Result 367 states and 465 transitions. [2018-11-22 22:31:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:31:52,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-22 22:31:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:31:52,092 INFO L225 Difference]: With dead ends: 367 [2018-11-22 22:31:52,092 INFO L226 Difference]: Without dead ends: 348 [2018-11-22 22:31:52,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:31:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-22 22:31:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 298. [2018-11-22 22:31:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-22 22:31:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 382 transitions. [2018-11-22 22:31:52,108 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 382 transitions. Word has length 56 [2018-11-22 22:31:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:31:52,109 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 382 transitions. [2018-11-22 22:31:52,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:31:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 382 transitions. [2018-11-22 22:31:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-22 22:31:52,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:31:52,110 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:31:52,110 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:31:52,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:31:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2092005707, now seen corresponding path program 1 times [2018-11-22 22:31:52,111 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:31:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:31:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:31:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:31:52,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:31:59,705 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-22 22:31:59,705 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:31:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:31:59,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:31:59,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:31:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:31:59,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2018-11-22 22:31:59,707 INFO L87 Difference]: Start difference. First operand 298 states and 382 transitions. Second operand 8 states. [2018-11-22 22:32:17,892 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-22 22:32:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:28,310 INFO L93 Difference]: Finished difference Result 314 states and 397 transitions. [2018-11-22 22:32:28,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:32:28,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-22 22:32:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:28,312 INFO L225 Difference]: With dead ends: 314 [2018-11-22 22:32:28,312 INFO L226 Difference]: Without dead ends: 312 [2018-11-22 22:32:28,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23, Invalid=62, Unknown=5, NotChecked=0, Total=90 [2018-11-22 22:32:28,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-11-22 22:32:28,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 297. [2018-11-22 22:32:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-22 22:32:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 380 transitions. [2018-11-22 22:32:28,336 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 380 transitions. Word has length 57 [2018-11-22 22:32:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:28,336 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 380 transitions. [2018-11-22 22:32:28,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:32:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 380 transitions. [2018-11-22 22:32:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-22 22:32:28,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:28,337 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:28,337 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:28,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash -364789831, now seen corresponding path program 1 times [2018-11-22 22:32:28,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:28,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:28,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 22:32:28,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:32:28,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:32:28,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:32:28,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:32:28,394 INFO L87 Difference]: Start difference. First operand 297 states and 380 transitions. Second operand 5 states. [2018-11-22 22:32:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:28,470 INFO L93 Difference]: Finished difference Result 332 states and 420 transitions. [2018-11-22 22:32:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:32:28,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-11-22 22:32:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:28,472 INFO L225 Difference]: With dead ends: 332 [2018-11-22 22:32:28,472 INFO L226 Difference]: Without dead ends: 309 [2018-11-22 22:32:28,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:28,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-11-22 22:32:28,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 297. [2018-11-22 22:32:28,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-22 22:32:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 378 transitions. [2018-11-22 22:32:28,490 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 378 transitions. Word has length 57 [2018-11-22 22:32:28,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:28,490 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 378 transitions. [2018-11-22 22:32:28,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:32:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2018-11-22 22:32:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-22 22:32:28,491 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:28,491 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:28,491 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:28,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 306992977, now seen corresponding path program 1 times [2018-11-22 22:32:28,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:28,492 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:28,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:28,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:28,531 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-22 22:32:28,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:28,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:28,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:32:28,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:32:28,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:32:28,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:32:28,533 INFO L87 Difference]: Start difference. First operand 297 states and 378 transitions. Second operand 4 states. [2018-11-22 22:32:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:28,557 INFO L93 Difference]: Finished difference Result 306 states and 386 transitions. [2018-11-22 22:32:28,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:28,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-22 22:32:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:28,559 INFO L225 Difference]: With dead ends: 306 [2018-11-22 22:32:28,559 INFO L226 Difference]: Without dead ends: 264 [2018-11-22 22:32:28,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:32:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-22 22:32:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-11-22 22:32:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-22 22:32:28,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2018-11-22 22:32:28,582 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 58 [2018-11-22 22:32:28,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:28,582 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2018-11-22 22:32:28,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:32:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2018-11-22 22:32:28,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-22 22:32:28,583 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:28,583 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:28,584 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:28,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1560523616, now seen corresponding path program 1 times [2018-11-22 22:32:28,584 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:28,584 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:28,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:28,658 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-22 22:32:28,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:28,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:28,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-22 22:32:28,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:32:28,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:32:28,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:32:28,660 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand 8 states. [2018-11-22 22:32:28,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:28,898 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2018-11-22 22:32:28,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:32:28,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-11-22 22:32:28,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:28,900 INFO L225 Difference]: With dead ends: 348 [2018-11-22 22:32:28,900 INFO L226 Difference]: Without dead ends: 308 [2018-11-22 22:32:28,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:32:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-11-22 22:32:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 286. [2018-11-22 22:32:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-22 22:32:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 361 transitions. [2018-11-22 22:32:28,915 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 361 transitions. Word has length 62 [2018-11-22 22:32:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:28,915 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 361 transitions. [2018-11-22 22:32:28,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:32:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 361 transitions. [2018-11-22 22:32:28,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-22 22:32:28,915 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:28,915 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:28,916 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:28,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:28,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1628619175, now seen corresponding path program 1 times [2018-11-22 22:32:28,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:28,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:28,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:28,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:28,962 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-22 22:32:28,962 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:28,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:32:28,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:28,964 INFO L87 Difference]: Start difference. First operand 286 states and 361 transitions. Second operand 6 states. [2018-11-22 22:32:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:29,029 INFO L93 Difference]: Finished difference Result 377 states and 489 transitions. [2018-11-22 22:32:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:32:29,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-22 22:32:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:29,031 INFO L225 Difference]: With dead ends: 377 [2018-11-22 22:32:29,031 INFO L226 Difference]: Without dead ends: 304 [2018-11-22 22:32:29,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:29,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-22 22:32:29,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2018-11-22 22:32:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-22 22:32:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2018-11-22 22:32:29,045 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 64 [2018-11-22 22:32:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2018-11-22 22:32:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2018-11-22 22:32:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-22 22:32:29,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:29,046 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:29,047 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:29,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1905751366, now seen corresponding path program 1 times [2018-11-22 22:32:29,047 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:29,047 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:29,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:29,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 22:32:29,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:29,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:29,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:32:29,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:29,127 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 6 states. [2018-11-22 22:32:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:29,176 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2018-11-22 22:32:29,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:32:29,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-22 22:32:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:29,177 INFO L225 Difference]: With dead ends: 309 [2018-11-22 22:32:29,177 INFO L226 Difference]: Without dead ends: 307 [2018-11-22 22:32:29,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:32:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-22 22:32:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 277. [2018-11-22 22:32:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-22 22:32:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 333 transitions. [2018-11-22 22:32:29,192 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 333 transitions. Word has length 64 [2018-11-22 22:32:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 333 transitions. [2018-11-22 22:32:29,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 333 transitions. [2018-11-22 22:32:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-22 22:32:29,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:29,194 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:29,194 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:29,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:29,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1397816770, now seen corresponding path program 1 times [2018-11-22 22:32:29,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:29,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:29,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-22 22:32:29,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:29,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:32:29,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:29,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:29,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:29,271 INFO L87 Difference]: Start difference. First operand 277 states and 333 transitions. Second operand 6 states. [2018-11-22 22:32:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:29,317 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-11-22 22:32:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:32:29,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-22 22:32:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:29,318 INFO L225 Difference]: With dead ends: 306 [2018-11-22 22:32:29,319 INFO L226 Difference]: Without dead ends: 304 [2018-11-22 22:32:29,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:32:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-22 22:32:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2018-11-22 22:32:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-22 22:32:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2018-11-22 22:32:29,337 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 64 [2018-11-22 22:32:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:29,337 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2018-11-22 22:32:29,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2018-11-22 22:32:29,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-22 22:32:29,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:29,338 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:29,338 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:29,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash -186874661, now seen corresponding path program 1 times [2018-11-22 22:32:29,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:29,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:29,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:29,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-22 22:32:30,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:30,647 WARN L180 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-22 22:32:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-22 22:32:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:32:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-11-22 22:32:32,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-22 22:32:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-22 22:32:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-22 22:32:32,524 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand 26 states. [2018-11-22 22:32:32,994 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-22 22:32:34,829 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-22 22:32:35,660 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-22 22:32:37,887 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-22 22:32:38,797 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-22 22:32:39,810 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-22 22:32:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:41,530 INFO L93 Difference]: Finished difference Result 375 states and 460 transitions. [2018-11-22 22:32:41,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-22 22:32:41,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-11-22 22:32:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:41,532 INFO L225 Difference]: With dead ends: 375 [2018-11-22 22:32:41,532 INFO L226 Difference]: Without dead ends: 347 [2018-11-22 22:32:41,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-11-22 22:32:41,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-11-22 22:32:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 300. [2018-11-22 22:32:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-22 22:32:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2018-11-22 22:32:41,557 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 69 [2018-11-22 22:32:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:41,557 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2018-11-22 22:32:41,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-22 22:32:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2018-11-22 22:32:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 22:32:41,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:41,558 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:41,558 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:41,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:41,559 INFO L82 PathProgramCache]: Analyzing trace with hash 457791470, now seen corresponding path program 1 times [2018-11-22 22:32:41,559 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:41,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:41,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:41,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 22:32:41,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 22:32:41,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:32:41,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-11-22 22:32:41,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 22:32:41,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 22:32:41,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:32:41,777 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand 14 states. [2018-11-22 22:32:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:42,114 INFO L93 Difference]: Finished difference Result 327 states and 392 transitions. [2018-11-22 22:32:42,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 22:32:42,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-22 22:32:42,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:42,116 INFO L225 Difference]: With dead ends: 327 [2018-11-22 22:32:42,116 INFO L226 Difference]: Without dead ends: 320 [2018-11-22 22:32:42,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-11-22 22:32:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-22 22:32:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 297. [2018-11-22 22:32:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-22 22:32:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 358 transitions. [2018-11-22 22:32:42,156 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 358 transitions. Word has length 70 [2018-11-22 22:32:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:42,156 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 358 transitions. [2018-11-22 22:32:42,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 22:32:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 358 transitions. [2018-11-22 22:32:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 22:32:42,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:42,160 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:42,161 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:42,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -297341722, now seen corresponding path program 2 times [2018-11-22 22:32:42,161 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:42,161 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:42,185 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-22 22:32:42,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:32:42,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:42,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 22:32:42,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:42,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:32:42,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:32:42,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:32:42,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:32:42,364 INFO L87 Difference]: Start difference. First operand 297 states and 358 transitions. Second operand 12 states. [2018-11-22 22:32:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:42,724 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2018-11-22 22:32:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 22:32:42,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-22 22:32:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:42,726 INFO L225 Difference]: With dead ends: 320 [2018-11-22 22:32:42,726 INFO L226 Difference]: Without dead ends: 313 [2018-11-22 22:32:42,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:32:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-11-22 22:32:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-11-22 22:32:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-22 22:32:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2018-11-22 22:32:42,746 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 70 [2018-11-22 22:32:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:42,746 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2018-11-22 22:32:42,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:32:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2018-11-22 22:32:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 22:32:42,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:42,747 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:42,747 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:42,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1221744938, now seen corresponding path program 1 times [2018-11-22 22:32:42,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 41 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 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:32:42,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:42,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:42,821 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-22 22:32:42,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:42,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:42,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:32:42,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:42,823 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand 6 states. [2018-11-22 22:32:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:43,080 INFO L93 Difference]: Finished difference Result 387 states and 474 transitions. [2018-11-22 22:32:43,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:32:43,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-22 22:32:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:43,082 INFO L225 Difference]: With dead ends: 387 [2018-11-22 22:32:43,082 INFO L226 Difference]: Without dead ends: 368 [2018-11-22 22:32:43,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:32:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-22 22:32:43,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 285. [2018-11-22 22:32:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-11-22 22:32:43,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 345 transitions. [2018-11-22 22:32:43,108 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 345 transitions. Word has length 70 [2018-11-22 22:32:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:43,109 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 345 transitions. [2018-11-22 22:32:43,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 345 transitions. [2018-11-22 22:32:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-22 22:32:43,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:43,109 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:43,110 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:43,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:43,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1115137352, now seen corresponding path program 1 times [2018-11-22 22:32:43,110 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:43,110 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:43,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:43,325 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-22 22:32:43,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:43,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-22 22:32:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:32:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:32:43,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:32:43,328 INFO L87 Difference]: Start difference. First operand 285 states and 345 transitions. Second operand 9 states. [2018-11-22 22:32:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:43,837 INFO L93 Difference]: Finished difference Result 335 states and 405 transitions. [2018-11-22 22:32:43,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:32:43,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-11-22 22:32:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:43,839 INFO L225 Difference]: With dead ends: 335 [2018-11-22 22:32:43,839 INFO L226 Difference]: Without dead ends: 294 [2018-11-22 22:32:43,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-22 22:32:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2018-11-22 22:32:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-22 22:32:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-11-22 22:32:43,868 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 70 [2018-11-22 22:32:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:43,868 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-11-22 22:32:43,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:32:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-11-22 22:32:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-22 22:32:43,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:43,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:43,869 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:43,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:43,869 INFO L82 PathProgramCache]: Analyzing trace with hash -40698028, now seen corresponding path program 1 times [2018-11-22 22:32:43,869 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:43,869 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 43 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 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:32:43,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:43,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 22:32:43,954 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:43,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 22:32:43,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:32:43,955 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 6 states. [2018-11-22 22:32:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:44,013 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2018-11-22 22:32:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:32:44,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-22 22:32:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:44,014 INFO L225 Difference]: With dead ends: 287 [2018-11-22 22:32:44,014 INFO L226 Difference]: Without dead ends: 283 [2018-11-22 22:32:44,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-22 22:32:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-22 22:32:44,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2018-11-22 22:32:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-22 22:32:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 297 transitions. [2018-11-22 22:32:44,044 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 297 transitions. Word has length 72 [2018-11-22 22:32:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:44,044 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 297 transitions. [2018-11-22 22:32:44,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2018-11-22 22:32:44,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-22 22:32:44,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:44,045 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:44,046 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:44,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:44,046 INFO L82 PathProgramCache]: Analyzing trace with hash 16560274, now seen corresponding path program 1 times [2018-11-22 22:32:44,046 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:44,046 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:44,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:44,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:44,436 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 22:32:44,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:44,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:44,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:44,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:44,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 22:32:45,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:45,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:32:45,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-11-22 22:32:45,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 22:32:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:32:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:32:45,124 INFO L87 Difference]: Start difference. First operand 253 states and 297 transitions. Second operand 17 states. [2018-11-22 22:32:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:46,397 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-11-22 22:32:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 22:32:46,398 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-11-22 22:32:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:46,399 INFO L225 Difference]: With dead ends: 302 [2018-11-22 22:32:46,399 INFO L226 Difference]: Without dead ends: 158 [2018-11-22 22:32:46,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-11-22 22:32:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-22 22:32:46,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2018-11-22 22:32:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-22 22:32:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2018-11-22 22:32:46,420 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 72 [2018-11-22 22:32:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:46,420 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2018-11-22 22:32:46,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 22:32:46,420 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2018-11-22 22:32:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-22 22:32:46,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:46,420 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:46,421 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:46,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1073890760, now seen corresponding path program 1 times [2018-11-22 22:32:46,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:46,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:46,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:46,482 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-22 22:32:46,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:46,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:46,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-22 22:32:46,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:32:46,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:32:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:32:46,486 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand 4 states. [2018-11-22 22:32:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:46,515 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2018-11-22 22:32:46,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:46,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-11-22 22:32:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:46,516 INFO L225 Difference]: With dead ends: 162 [2018-11-22 22:32:46,516 INFO L226 Difference]: Without dead ends: 138 [2018-11-22 22:32:46,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:32:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-22 22:32:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-22 22:32:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-22 22:32:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-11-22 22:32:46,529 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 71 [2018-11-22 22:32:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:46,529 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-11-22 22:32:46,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:32:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-11-22 22:32:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 22:32:46,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:46,530 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:46,530 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:46,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1571950312, now seen corresponding path program 1 times [2018-11-22 22:32:46,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:46,530 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:46,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:46,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:46,596 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-22 22:32:46,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:46,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:46,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 22:32:46,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:32:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:32:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:32:46,599 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 5 states. [2018-11-22 22:32:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:46,646 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-11-22 22:32:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:32:46,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-22 22:32:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:46,647 INFO L225 Difference]: With dead ends: 148 [2018-11-22 22:32:46,647 INFO L226 Difference]: Without dead ends: 82 [2018-11-22 22:32:46,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:46,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-22 22:32:46,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-22 22:32:46,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-22 22:32:46,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-11-22 22:32:46,654 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 73 [2018-11-22 22:32:46,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:46,654 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-11-22 22:32:46,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:32:46,654 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-11-22 22:32:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-22 22:32:46,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:46,655 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:46,655 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:46,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:46,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1289345495, now seen corresponding path program 1 times [2018-11-22 22:32:46,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:46,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/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-22 22:32:46,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:46,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:48,811 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-22 22:32:49,309 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-22 22:32:49,309 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-22 22:32:49,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:49,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-22 22:32:49,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 22:32:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 22:32:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-22 22:32:49,311 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-11-22 22:32:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:52,654 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-22 22:32:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:32:52,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-11-22 22:32:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:52,655 INFO L225 Difference]: With dead ends: 90 [2018-11-22 22:32:52,655 INFO L226 Difference]: Without dead ends: 72 [2018-11-22 22:32:52,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:32:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-22 22:32:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-22 22:32:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-22 22:32:52,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-11-22 22:32:52,663 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 77 [2018-11-22 22:32:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:52,664 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-22 22:32:52,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 22:32:52,664 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-22 22:32:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-22 22:32:52,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:52,664 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:52,665 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 22:32:52,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1480434104, now seen corresponding path program 1 times [2018-11-22 22:32:52,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-22 22:32:52,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/cvc4nyu Starting monitored process 49 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 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-22 22:32:52,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:52,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-22 22:32:53,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (49)] Exception during sending of exit command (exit): Broken pipe [2018-11-22 22:32:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:53,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-22 22:32:53,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:32:53,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:32:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:32:53,022 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 10 states. [2018-11-22 22:32:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:53,390 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-22 22:32:53,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 22:32:53,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-11-22 22:32:53,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:53,391 INFO L225 Difference]: With dead ends: 72 [2018-11-22 22:32:53,391 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 22:32:53,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-22 22:32:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 22:32:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 22:32:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 22:32:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 22:32:53,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-11-22 22:32:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:53,392 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 22:32:53,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:32:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 22:32:53,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 22:32:53,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 22:32:53,558 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 168 [2018-11-22 22:32:53,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:53,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-22 22:32:55,629 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 165 DAG size of output: 95 [2018-11-22 22:33:06,945 WARN L180 SmtUtils]: Spent 11.31 s on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2018-11-22 22:33:08,725 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 141 DAG size of output: 54 [2018-11-22 22:33:08,983 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-11-22 22:33:52,271 WARN L180 SmtUtils]: Spent 43.28 s on a formula simplification. DAG size of input: 340 DAG size of output: 208 [2018-11-22 22:35:38,353 WARN L180 SmtUtils]: Spent 1.77 m on a formula simplification. DAG size of input: 195 DAG size of output: 138 [2018-11-22 22:35:38,357 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 22:35:38,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:35:38,357 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= (_ bv0 32) |base2flt_#in~m|)) (and (= (_ bv0 32) base2flt_~__retres4~0) (= base2flt_~m |base2flt_#in~m|))) [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-22 22:35:38,358 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-22 22:35:38,358 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 22:35:38,359 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L444 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-11-22 22:35:38,359 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-11-22 22:35:38,360 INFO L444 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse16 (bvult main_~a~0 main_~r_add~0)) (.cse7 (= (_ bv1 32) main_~tmp___2~0)) (.cse3 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse4 (= (_ bv0 32) main_~zero~0)) (.cse9 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse0 (= main_~tmp___1~0 (_ bv0 32))) (.cse1 (not (bvult main_~r_add~0 main_~a~0))) (.cse2 (= main_~tmp___2~0 (_ bv0 32))) (.cse6 (and .cse16 .cse7 .cse3 .cse8 .cse4 .cse9))) (let ((.cse10 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32))) (.cse11 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse13 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse14 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse15 (or (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4) .cse6)) (.cse5 (not (bvult main_~a~0 main_~b~0)))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse5) (and .cse7 .cse3 .cse8 .cse4 .cse9 .cse10)) .cse11 .cse12 .cse13 .cse14) (and (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse11 .cse12 .cse13 (exists ((v_addflt_~ma~0_67 (_ BitVec 32))) (= (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_67) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32))) main_~r_add~0)) .cse14 .cse15) (and (or (and (= main_~b~0 main_~r_add~0) .cse16 .cse8 .cse4) (and .cse8 .cse4 .cse10 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32)))) .cse7 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse20 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse18 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse19 (bvneg .cse20))) (let ((.cse17 (bvadd .cse18 .cse19))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse17)) (not (= (_ bv0 32) (bvadd .cse18 .cse19 .cse20))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse17) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and (= main_~a~0 main_~r_add~0) .cse0 .cse2 .cse3 .cse4 .cse5))))) [2018-11-22 22:35:38,360 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-11-22 22:35:38,361 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-11-22 22:35:38,361 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-11-22 22:35:38,361 INFO L444 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse2 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse1 (= (_ bv0 32) main_~zero~0))) (or (and (= main_~tmp___0~0 (_ bv0 32)) (= main_~b~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and (not (bvugt main_~a~0 (_ bv0 32))) .cse0 (= (_ bv0 32) main_~sa~0) .cse1 (= main_~tmp~2 (_ bv0 32))) (and (= (_ bv4294967295 32) main_~a~0) .cse0 .cse1) (and .cse2 .cse1 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse2 .cse1 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-22 22:35:38,361 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-11-22 22:35:38,361 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-11-22 22:35:38,361 INFO L444 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-11-22 22:35:38,361 INFO L448 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L444 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) (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)) (= (_ bv0 32) main_~zero~0))) [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L451 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-11-22 22:35:38,362 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L444 ceAbstractionStarter]: At program point L282-1(lines 282 291) the Hoare annotation is: (let ((.cse6 (exists ((main_~a~0 (_ BitVec 32))) (and (not (bvult main_~r_add~0 main_~a~0)) (not (bvult main_~a~0 main_~b~0))))) (.cse7 (not (bvult main_~r_add~0 main_~a~0))) (.cse9 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse10 (= (_ bv0 32) main_~zero~0))) (let ((.cse0 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv1 32) main_~tmp___4~0)) (.cse1 (and .cse6 (and .cse7 (or (and (= main_~b~0 main_~r_add~0) .cse9 .cse10) (and .cse8 (and (= main_~a~0 main_~r_add~0) .cse10)))))) (.cse4 (= main_~tmp___3~0 (_ bv0 32))) (.cse5 (= main_~tmp___4~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32)) (let ((.cse3 (and .cse6 (and .cse7 .cse8 .cse9 .cse10)))) (or (and .cse0 .cse3 .cse2) (and .cse4 .cse3 .cse5)))) (and .cse1 .cse4 .cse5)))) [2018-11-22 22:35:38,363 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L451 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-11-22 22:35:38,363 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-11-22 22:35:38,364 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (and (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (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)))) (.cse1 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32)))) (or (and (= .cse0 addflt_~ma~0) (= .cse1 addflt_~ea~0) (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) .cse2 (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (= addflt_~a |addflt_#in~b|) (bvult addflt_~b addflt_~a)) (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)))) (not (bvult |addflt_#in~a| |addflt_#in~b|)) .cse2 (= addflt_~a |addflt_#in~a|) (= .cse1 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32))) [2018-11-22 22:35:38,364 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-22 22:35:38,365 INFO L444 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse29 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse2 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvadd (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (_ bv33554431 32)) addflt_~ma~0))) (.cse6 (= (_ bv0 32) |addflt_#in~b|)) (.cse8 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse3 (let ((.cse31 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse31) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse31) .cse29) |addflt_#in~a|))))) (.cse4 (let ((.cse30 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse30) .cse29) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse30) (_ bv0 32)))))) (.cse0 (= (_ bv0 32) |addflt_#in~a|)) (.cse5 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse29) |addflt_#in~a|))) (.cse9 (= addflt_~a |addflt_#in~b|)) (.cse1 (not (= (_ bv4294967295 32) |addflt_#in~b|))) (.cse7 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 .cse1 (or (and .cse2 (not (= (_ bv33554431 32) addflt_~ma~0))) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) addflt_~mb~0)) (= (bvadd addflt_~ma~0 (_ bv4261412865 32)) (_ bv0 32))))) (or (or .cse2 (and .cse3 .cse4 .cse5)) .cse6 .cse7) (or (bvugt |addflt_#in~a| (_ bv0 32)) (and .cse8 .cse9)) (let ((.cse16 (= addflt_~b |addflt_#in~b|)) (.cse15 (= addflt_~a |addflt_#in~a|)) (.cse18 (= addflt_~b |addflt_#in~a|)) (.cse26 (bvlshr |addflt_#in~a| (_ bv24 32)))) (let ((.cse14 (bvadd .cse26 (_ bv4294967168 32))) (.cse13 (let ((.cse27 (let ((.cse28 (not (bvult addflt_~a addflt_~b)))) (or (and .cse15 .cse28) (and .cse18 .cse28))))) (or (and .cse27 .cse9) (and .cse27 .cse16))))) (let ((.cse11 (and .cse5 .cse13 (not (bvult addflt_~__retres10~0 |addflt_#in~a|)))) (.cse10 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse12 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse17 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse14) addflt_~ea~0)))) (or (and (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)) (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg (bvadd .cse10 (_ bv4294967168 32))) (_ bv4294967168 32))) addflt_~mb~0) (or .cse11 (and .cse12 .cse13 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0))))) (= .cse14 addflt_~ea~0) .cse15 .cse16) (and (and .cse15 .cse16) .cse6) (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))) (= .cse17 addflt_~mb~0) .cse18 .cse8 .cse9 (bvult addflt_~b addflt_~a)) (and (exists ((addflt_~a (_ BitVec 32))) (let ((.cse20 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse21 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse20 (_ bv4294967168 32))))) (let ((.cse19 (bvadd (bvneg (bvneg .cse21)) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse19) (bvshl .cse20 (_ bv24 32)))) (bvult |addflt_#in~a| addflt_~a) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse19)) (not (= .cse21 (_ bv0 32)))))))) .cse3 .cse4 .cse5 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse22 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))))) (let ((.cse24 (bvneg .cse22)) (.cse23 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (let ((.cse25 (bvadd .cse24 .cse23))) (and (not (= (bvadd .cse22 .cse23 .cse24) (_ bv0 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse25) (bvshl (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv24 32)))) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse25))))))) .cse13) (and (exists ((addflt_~ma~0 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor addflt_~ma~0 (bvshl (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) (not (= (bvadd .cse26 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse26 (_ bv4294967169 32)) addflt_~ea~0) .cse15 .cse13 .cse16) (and (= (bvadd .cse10 (_ bv4294967169 32)) addflt_~ea~0) .cse11 (exists ((v_addflt_~ma~0_67 (_ BitVec 32))) (= (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_67) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))) addflt_~__retres10~0)) (not (= (bvadd .cse10 (_ bv4294967041 32)) (_ bv0 32))) .cse9) (and .cse0 .cse18) (and (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) .cse12 (not (= (_ bv0 32) .cse17)) .cse13 (bvult |addflt_#in~a| addflt_~a)))))) (or (bvugt |addflt_#in~b| (_ bv0 32)) (= addflt_~__retres10~0 |addflt_#in~a|)) (or (and (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) (= (_ bv127 32) addflt_~eb~0)) .cse1 .cse7)))) [2018-11-22 22:35:38,365 INFO L448 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-11-22 22:35:38,365 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-11-22 22:35:38,365 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-22 22:35:38,365 INFO L448 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-11-22 22:35:38,366 INFO L444 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (and (let ((.cse7 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse10 (= addflt_~b |addflt_#in~b|)) (.cse8 (= addflt_~a |addflt_#in~b|)) (.cse6 (= addflt_~a |addflt_#in~a|))) (let ((.cse1 (let ((.cse15 (let ((.cse17 (not (bvult addflt_~a addflt_~b)))) (or (and .cse6 .cse17) (and (= addflt_~b |addflt_#in~a|) .cse17))))) (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (let ((.cse16 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse15 .cse16 .cse8) (and .cse15 .cse16 .cse10)))) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvlshr (bvadd (bvneg (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (_ bv1 32)) addflt_~ma~0)) (or (and .cse15 .cse10) (and .cse15 .cse8)))))) (.cse5 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse3 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse0 (bvadd .cse7 (_ bv4294967168 32)))) (let ((.cse4 (= (bvlshr .cse3 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse0) (_ bv4294967168 32))) addflt_~mb~0)) (.cse2 (bvadd .cse5 (_ bv4294967168 32))) (.cse9 (let ((.cse12 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse14 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse12) |addflt_#in~a|)))) (or (and (let ((.cse11 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse11) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse11) .cse12) |addflt_#in~a|)))) (let ((.cse13 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse13) .cse12) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse13) (_ bv0 32))))) .cse14 .cse1) (and .cse6 .cse14 .cse1)))))) (or (and (= .cse0 addflt_~ea~0) .cse1 (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 .cse2) 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 .cse3) addflt_~ma~0)))) (and .cse4 (not (= (bvadd .cse5 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse5 (_ bv4294967169 32)) addflt_~ea~0) .cse6 .cse1) (and (= (bvadd .cse7 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse7 (_ bv4294967041 32)) (_ bv0 32))) .cse8 .cse9) (and .cse4 (= .cse2 addflt_~ea~0) .cse6 .cse10 .cse9))))) (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32)) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) [2018-11-22 22:35:38,366 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-22 22:35:38,366 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-22 22:35:38,366 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-22 22:35:38,366 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-22 22:35:38,366 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-22 22:35:38,366 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-22 22:35:38,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-11-22 22:35:38,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-11-22 22:35:38,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-22 22:35:38,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-11-22 22:35:38,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-22 22:35:38,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-11-22 22:35:38,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:35:38 BoogieIcfgContainer [2018-11-22 22:35:38,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:35:38,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:35:38,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:35:38,414 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:35:38,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:30:54" (3/4) ... [2018-11-22 22:35:38,419 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 22:35:38,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 22:35:38,425 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-22 22:35:38,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 22:35:38,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-11-22 22:35:38,426 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-22 22:35:38,432 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-22 22:35:38,432 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-22 22:35:38,432 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 22:35:38,458 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-11-22 22:35:38,458 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-22 22:35:38,458 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-22 22:35:38,458 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-22 22:35:38,459 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) [2018-11-22 22:35:38,460 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0bv32 == \old(a) || !(4294967295bv32 == \old(b))) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32)) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (~bvugt32(\old(a), 0bv32) || (__retres10 == \old(b) && a == \old(b)))) && (((((((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !~bvult64(__retres10, \old(a))) || ((~bvadd64(__retres10, 1bv32) == 0bv32 && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((a == \old(a) && b == \old(b)) && 0bv32 == \old(b))) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && __retres10 == \old(b)) && a == \old(b)) && ~bvult64(b, a))) || ((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b))))) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && b == \old(b))) || ((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !~bvult64(__retres10, \old(a))) && (\exists v_addflt_~ma~0_67 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_67), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10)) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (0bv32 == \old(a) && b == \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)))) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && ~bvult64(\old(a), a)))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) [2018-11-22 22:35:38,484 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_67ec9548-1242-46e5-8ae5-8574c6beebcf/bin-2019/uautomizer/witness.graphml [2018-11-22 22:35:38,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:35:38,485 INFO L168 Benchmark]: Toolchain (without parser) took 285013.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.9 MB). Free memory was 949.2 MB in the beginning and 1.0 GB in the end (delta: -92.7 MB). Peak memory consumption was 174.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,486 INFO L168 Benchmark]: CDTParser took 0.14 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-22 22:35:38,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.44 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,487 INFO L168 Benchmark]: Boogie Preprocessor took 31.49 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:35:38,487 INFO L168 Benchmark]: RCFGBuilder took 379.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,487 INFO L168 Benchmark]: TraceAbstraction took 284260.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 455.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,487 INFO L168 Benchmark]: Witness Printer took 70.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-22 22:35:38,489 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.14 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 248.35 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 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 19.44 ms. Allocated memory is still 1.0 GB. Free memory was 933.1 MB in the beginning and 927.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.49 ms. Allocated memory is still 1.0 GB. Free memory is still 927.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 379.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 927.7 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 284260.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.1 MB). Peak memory consumption was 455.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.78 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,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_~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_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 301]: Loop Invariant [2018-11-22 22:35:38,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-11-22 22:35:38,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] Derived loop invariant: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-11-22 22:35:38,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-22 22:35:38,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-11-22 22:35:38,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-22 22:35:38,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-22 22:35:38,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-22 22:35:38,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-11-22 22:35:38,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-22 22:35:38,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((((0bv32 == \old(a) || !(4294967295bv32 == \old(b))) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) && !(33554431bv32 == ma)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32)) && ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (~bvugt32(\old(a), 0bv32) || (__retres10 == \old(b) && a == \old(b)))) && (((((((((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !~bvult64(__retres10, \old(a))) || ((~bvadd64(__retres10, 1bv32) == 0bv32 && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && b == \old(b)) || ((a == \old(a) && b == \old(b)) && 0bv32 == \old(b))) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && __retres10 == \old(b)) && a == \old(b)) && ~bvult64(b, a))) || ((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b))))) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && b == \old(b))) || ((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (!~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && !~bvult64(__retres10, \old(a))) && (\exists v_addflt_~ma~0_67 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_67), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10)) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (0bv32 == \old(a) && b == \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)))) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)))) && ~bvult64(\old(a), a)))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. SAFE Result, 284.1s OverallTime, 45 OverallIterations, 4 TraceHistogramMax, 88.8s AutomataDifference, 0.0s DeadEndRemovalTime, 164.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 5012 SDtfs, 2281 SDslu, 28909 SDs, 0 SdLazy, 7211 SolverSat, 334 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 47.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3380 GetRequests, 2896 SyntacticMatches, 15 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 63.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=14, 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.8s AutomataMinimizationTime, 45 MinimizatonAttempts, 1458 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 486 PreInvPairs, 592 NumberOfFragments, 2971 HoareAnnotationTreeSize, 486 FomulaSimplifications, 5437592 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 22 FomulaSimplificationsInter, 205752 FormulaSimplificationTreeSizeReductionInter, 164.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2723 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3143 ConstructedInterpolants, 91 QuantifiedInterpolants, 540840 SizeOfPredicates, 234 NumberOfNonLiveVariables, 4699 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 57 InterpolantComputations, 34 PerfectInterpolantSequences, 1040/1139 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...