./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-5842f4b [2018-11-18 16:46:39,325 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:46:39,326 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:46:39,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:46:39,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:46:39,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:46:39,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:46:39,335 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:46:39,336 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:46:39,336 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:46:39,337 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:46:39,337 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:46:39,338 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:46:39,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:46:39,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:46:39,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:46:39,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:46:39,341 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:46:39,342 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:46:39,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:46:39,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:46:39,344 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:46:39,346 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:46:39,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:46:39,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:46:39,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:46:39,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:46:39,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:46:39,348 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:46:39,349 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:46:39,349 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:46:39,350 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:46:39,350 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:46:39,350 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:46:39,351 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:46:39,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:46:39,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 16:46:39,358 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:46:39,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:46:39,359 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:46:39,359 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 16:46:39,360 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:46:39,360 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:46:39,360 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:46:39,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:46:39,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:46:39,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:46:39,361 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:46:39,362 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:46:39,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:46:39,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:46:39,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:46:39,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:46:39,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:46:39,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:46:39,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:46:39,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:46:39,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:46:39,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:46:39,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:46:39,363 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_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:39,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:46:39,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:46:39,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:46:39,399 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:46:39,400 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:46:39,400 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:39,444 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/84f793fb4/15376bced2d44096ad014e35e5bbbcb9/FLAGef31654b7 [2018-11-18 16:46:39,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:46:39,776 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:39,781 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/84f793fb4/15376bced2d44096ad014e35e5bbbcb9/FLAGef31654b7 [2018-11-18 16:46:39,791 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/84f793fb4/15376bced2d44096ad014e35e5bbbcb9 [2018-11-18 16:46:39,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:46:39,794 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:46:39,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:46:39,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:46:39,797 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:46:39,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:46:39" (1/1) ... [2018-11-18 16:46:39,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b20fcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:39, skipping insertion in model container [2018-11-18 16:46:39,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:46:39" (1/1) ... [2018-11-18 16:46:39,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:46:39,825 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:46:39,964 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:46:39,967 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:46:40,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:46:40,010 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:46:40,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40 WrapperNode [2018-11-18 16:46:40,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:46:40,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:46:40,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:46:40,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:46:40,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... [2018-11-18 16:46:40,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:46:40,080 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:46:40,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:46:40,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:46:40,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-18 16:46:40,111 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:46:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:46:40,429 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:46:40,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:40 BoogieIcfgContainer [2018-11-18 16:46:40,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:46:40,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:46:40,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:46:40,432 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:46:40,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:46:39" (1/3) ... [2018-11-18 16:46:40,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b29fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:46:40, skipping insertion in model container [2018-11-18 16:46:40,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:40" (2/3) ... [2018-11-18 16:46:40,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0b29fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:46:40, skipping insertion in model container [2018-11-18 16:46:40,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:40" (3/3) ... [2018-11-18 16:46:40,434 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:40,440 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:46:40,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:46:40,453 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:46:40,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:46:40,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:46:40,474 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:46:40,474 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:46:40,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:46:40,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:46:40,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:46:40,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:46:40,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:46:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-11-18 16:46:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:46:40,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:40,492 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:40,494 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:40,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1652746855, now seen corresponding path program 1 times [2018-11-18 16:46:40,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:40,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:40,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:40,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:46:40,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:40,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:40,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:40,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:46:40,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 12 [2018-11-18 16:46:40,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:46:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:46:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:46:40,872 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 12 states. [2018-11-18 16:46:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:41,276 INFO L93 Difference]: Finished difference Result 213 states and 338 transitions. [2018-11-18 16:46:41,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 16:46:41,277 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-18 16:46:41,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:41,288 INFO L225 Difference]: With dead ends: 213 [2018-11-18 16:46:41,288 INFO L226 Difference]: Without dead ends: 132 [2018-11-18 16:46:41,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:46:41,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-18 16:46:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2018-11-18 16:46:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-18 16:46:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2018-11-18 16:46:41,331 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 36 [2018-11-18 16:46:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:41,332 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2018-11-18 16:46:41,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:46:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2018-11-18 16:46:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:46:41,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:41,335 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:41,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:41,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1280900227, now seen corresponding path program 1 times [2018-11-18 16:46:41,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:41,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:41,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 16:46:41,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:46:41,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:41,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:41,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 16:46:41,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:41,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-11-18 16:46:41,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:46:41,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:46:41,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:46:41,710 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 17 states. [2018-11-18 16:46:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:42,331 INFO L93 Difference]: Finished difference Result 319 states and 462 transitions. [2018-11-18 16:46:42,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-18 16:46:42,333 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-11-18 16:46:42,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:42,336 INFO L225 Difference]: With dead ends: 319 [2018-11-18 16:46:42,336 INFO L226 Difference]: Without dead ends: 244 [2018-11-18 16:46:42,338 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-11-18 16:46:42,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-11-18 16:46:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 208. [2018-11-18 16:46:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 16:46:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2018-11-18 16:46:42,356 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 45 [2018-11-18 16:46:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:42,356 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2018-11-18 16:46:42,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:46:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2018-11-18 16:46:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 16:46:42,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:42,358 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:42,360 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash -775161259, now seen corresponding path program 1 times [2018-11-18 16:46:42,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:42,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:42,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:42,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:42,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:42,395 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand 4 states. [2018-11-18 16:46:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:42,421 INFO L93 Difference]: Finished difference Result 314 states and 448 transitions. [2018-11-18 16:46:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:42,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 16:46:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:42,424 INFO L225 Difference]: With dead ends: 314 [2018-11-18 16:46:42,424 INFO L226 Difference]: Without dead ends: 231 [2018-11-18 16:46:42,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:42,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-18 16:46:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2018-11-18 16:46:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-18 16:46:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 257 transitions. [2018-11-18 16:46:42,439 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 257 transitions. Word has length 49 [2018-11-18 16:46:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:42,439 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 257 transitions. [2018-11-18 16:46:42,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 257 transitions. [2018-11-18 16:46:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:42,441 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:42,441 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:42,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:42,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash -906766727, now seen corresponding path program 1 times [2018-11-18 16:46:42,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:42,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:42,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:42,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:42,476 INFO L87 Difference]: Start difference. First operand 195 states and 257 transitions. Second operand 4 states. [2018-11-18 16:46:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:42,495 INFO L93 Difference]: Finished difference Result 216 states and 284 transitions. [2018-11-18 16:46:42,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:46:42,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 16:46:42,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:42,498 INFO L225 Difference]: With dead ends: 216 [2018-11-18 16:46:42,498 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 16:46:42,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 16:46:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2018-11-18 16:46:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-18 16:46:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 263 transitions. [2018-11-18 16:46:42,510 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 263 transitions. Word has length 50 [2018-11-18 16:46:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:42,511 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 263 transitions. [2018-11-18 16:46:42,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 263 transitions. [2018-11-18 16:46:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:42,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:42,512 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:42,512 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:42,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 868240635, now seen corresponding path program 1 times [2018-11-18 16:46:42,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:42,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:42,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:42,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:46:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:46:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:46:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:42,585 INFO L87 Difference]: Start difference. First operand 201 states and 263 transitions. Second operand 5 states. [2018-11-18 16:46:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:42,618 INFO L93 Difference]: Finished difference Result 208 states and 269 transitions. [2018-11-18 16:46:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:42,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 16:46:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:42,620 INFO L225 Difference]: With dead ends: 208 [2018-11-18 16:46:42,620 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 16:46:42,620 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:46:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 16:46:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2018-11-18 16:46:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-18 16:46:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2018-11-18 16:46:42,633 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 50 [2018-11-18 16:46:42,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:42,634 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2018-11-18 16:46:42,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:46:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2018-11-18 16:46:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:42,635 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:42,635 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:42,635 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:42,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:42,636 INFO L82 PathProgramCache]: Analyzing trace with hash 219761125, now seen corresponding path program 2 times [2018-11-18 16:46:42,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:42,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:42,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 16:46:42,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:42,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 16:46:42,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:46:42,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:46:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:46:42,806 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand 13 states. [2018-11-18 16:46:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:43,084 INFO L93 Difference]: Finished difference Result 378 states and 521 transitions. [2018-11-18 16:46:43,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:46:43,084 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-11-18 16:46:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:43,086 INFO L225 Difference]: With dead ends: 378 [2018-11-18 16:46:43,086 INFO L226 Difference]: Without dead ends: 324 [2018-11-18 16:46:43,087 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:46:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-18 16:46:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 304. [2018-11-18 16:46:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-18 16:46:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 408 transitions. [2018-11-18 16:46:43,101 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 408 transitions. Word has length 50 [2018-11-18 16:46:43,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:43,101 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 408 transitions. [2018-11-18 16:46:43,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:46:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 408 transitions. [2018-11-18 16:46:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:43,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:43,102 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:43,102 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1369751255, now seen corresponding path program 1 times [2018-11-18 16:46:43,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:43,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:46:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:46:43,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:46:43,225 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:43,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:43,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 16:46:43,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:43,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-11-18 16:46:43,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:46:43,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:46:43,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:46:43,387 INFO L87 Difference]: Start difference. First operand 304 states and 408 transitions. Second operand 16 states. [2018-11-18 16:46:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:43,637 INFO L93 Difference]: Finished difference Result 400 states and 533 transitions. [2018-11-18 16:46:43,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 16:46:43,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-18 16:46:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:43,639 INFO L225 Difference]: With dead ends: 400 [2018-11-18 16:46:43,639 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 16:46:43,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-11-18 16:46:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 16:46:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 283. [2018-11-18 16:46:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-11-18 16:46:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 379 transitions. [2018-11-18 16:46:43,653 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 379 transitions. Word has length 50 [2018-11-18 16:46:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:43,654 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 379 transitions. [2018-11-18 16:46:43,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:46:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 379 transitions. [2018-11-18 16:46:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:43,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:43,655 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:43,655 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:43,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:43,655 INFO L82 PathProgramCache]: Analyzing trace with hash -782945241, now seen corresponding path program 1 times [2018-11-18 16:46:43,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:46:43,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:46:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:43,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:46:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:46:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:46:43,691 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:46:43,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:46:43 BoogieIcfgContainer [2018-11-18 16:46:43,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:46:43,718 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:46:43,718 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:46:43,718 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:46:43,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:40" (3/4) ... [2018-11-18 16:46:43,721 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:46:43,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:46:43,722 INFO L168 Benchmark]: Toolchain (without parser) took 3928.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 960.8 MB in the beginning and 1.1 GB in the end (delta: -106.4 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:43,723 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:46:43,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:43,724 INFO L168 Benchmark]: Boogie Preprocessor took 69.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:43,724 INFO L168 Benchmark]: RCFGBuilder took 349.83 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:43,725 INFO L168 Benchmark]: TraceAbstraction took 3286.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:46:43,725 INFO L168 Benchmark]: Witness Printer took 3.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:46:43,727 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.78 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 349.83 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3286.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 39.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.0 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] RET return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] RET return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] RET return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] 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 7 procedures, 93 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 824 SDtfs, 640 SDslu, 5768 SDs, 0 SdLazy, 2095 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 123 SyntacticMatches, 8 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred 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, 7 MinimizatonAttempts, 152 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 451 ConstructedInterpolants, 1 QuantifiedInterpolants, 58732 SizeOfPredicates, 13 NumberOfNonLiveVariables, 371 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 115/163 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 16:46:45,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:46:45,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:46:45,122 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:46:45,122 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:46:45,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:46:45,124 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:46:45,125 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:46:45,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:46:45,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:46:45,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:46:45,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:46:45,128 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:46:45,129 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:46:45,130 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:46:45,130 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:46:45,131 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:46:45,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:46:45,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:46:45,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:46:45,136 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:46:45,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:46:45,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:46:45,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:46:45,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:46:45,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:46:45,140 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:46:45,141 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:46:45,142 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:46:45,143 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:46:45,143 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:46:45,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:46:45,143 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:46:45,143 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:46:45,144 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:46:45,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:46:45,145 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 16:46:45,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:46:45,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:46:45,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:46:45,157 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:46:45,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:46:45,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:46:45,157 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:46:45,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 16:46:45,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:46:45,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:46:45,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:46:45,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 16:46:45,160 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 16:46:45,160 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_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:45,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:46:45,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:46:45,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:46:45,199 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:46:45,200 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:46:45,200 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:45,236 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/1488657dd/920426bb4f4b47f5ba2fda87a9e95d84/FLAGafd25746d [2018-11-18 16:46:45,643 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:46:45,644 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:45,649 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/1488657dd/920426bb4f4b47f5ba2fda87a9e95d84/FLAGafd25746d [2018-11-18 16:46:45,657 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/data/1488657dd/920426bb4f4b47f5ba2fda87a9e95d84 [2018-11-18 16:46:45,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:46:45,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:46:45,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:46:45,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:46:45,664 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:46:45,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22fa7ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45, skipping insertion in model container [2018-11-18 16:46:45,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:46:45,700 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:46:45,859 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:46:45,862 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:46:45,899 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:46:45,912 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:46:45,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45 WrapperNode [2018-11-18 16:46:45,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:46:45,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:46:45,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:46:45,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:46:45,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... [2018-11-18 16:46:45,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:46:45,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:46:45,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:46:45,998 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:46:45,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:46:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:46:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:46:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-11-18 16:46:46,035 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-11-18 16:46:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure mulflt [2018-11-18 16:46:46,036 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:46:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:46:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-11-18 16:46:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-18 16:46:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:46:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-11-18 16:46:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-11-18 16:46:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure mulflt [2018-11-18 16:46:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:46:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:46:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:46:46,410 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:46:46,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:46 BoogieIcfgContainer [2018-11-18 16:46:46,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:46:46,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:46:46,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:46:46,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:46:46,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:46:45" (1/3) ... [2018-11-18 16:46:46,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0e60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:46:46, skipping insertion in model container [2018-11-18 16:46:46,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:46:45" (2/3) ... [2018-11-18 16:46:46,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0e60e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:46:46, skipping insertion in model container [2018-11-18 16:46:46,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:46" (3/3) ... [2018-11-18 16:46:46,418 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-11-18 16:46:46,426 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:46:46,432 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:46:46,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:46:46,466 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:46:46,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:46:46,466 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:46:46,467 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:46:46,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:46:46,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:46:46,467 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:46:46,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:46:46,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:46:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-11-18 16:46:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 16:46:46,482 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:46,482 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:46,484 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:46,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1652746855, now seen corresponding path program 1 times [2018-11-18 16:46:46,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:46,490 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:46,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:46,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:46,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:46,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:46:46,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:46:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:46:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:46:46,619 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 8 states. [2018-11-18 16:46:46,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:46,808 INFO L93 Difference]: Finished difference Result 197 states and 312 transitions. [2018-11-18 16:46:46,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:46:46,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-11-18 16:46:46,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:46,818 INFO L225 Difference]: With dead ends: 197 [2018-11-18 16:46:46,818 INFO L226 Difference]: Without dead ends: 116 [2018-11-18 16:46:46,821 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:46:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-18 16:46:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2018-11-18 16:46:46,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 16:46:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2018-11-18 16:46:46,856 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 36 [2018-11-18 16:46:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:46,856 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2018-11-18 16:46:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:46:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2018-11-18 16:46:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 16:46:46,859 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:46,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:46,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:46,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -812400415, now seen corresponding path program 1 times [2018-11-18 16:46:46,860 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:46,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:46,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:46,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:46,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:47,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:47,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-18 16:46:47,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:46:47,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:46:47,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:46:47,031 INFO L87 Difference]: Start difference. First operand 109 states and 158 transitions. Second operand 6 states. [2018-11-18 16:46:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:47,091 INFO L93 Difference]: Finished difference Result 242 states and 365 transitions. [2018-11-18 16:46:47,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:46:47,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-11-18 16:46:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:47,095 INFO L225 Difference]: With dead ends: 242 [2018-11-18 16:46:47,095 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 16:46:47,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 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-18 16:46:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 16:46:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 123. [2018-11-18 16:46:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-18 16:46:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 178 transitions. [2018-11-18 16:46:47,113 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 178 transitions. Word has length 41 [2018-11-18 16:46:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:47,113 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 178 transitions. [2018-11-18 16:46:47,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:46:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 178 transitions. [2018-11-18 16:46:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:46:47,115 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:47,115 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:47,115 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:47,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1280900227, now seen corresponding path program 1 times [2018-11-18 16:46:47,117 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:47,117 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:47,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:47,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:47,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:47,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:47,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 16:46:47,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:46:47,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:46:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:46:47,303 INFO L87 Difference]: Start difference. First operand 123 states and 178 transitions. Second operand 10 states. [2018-11-18 16:46:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:47,775 INFO L93 Difference]: Finished difference Result 288 states and 443 transitions. [2018-11-18 16:46:47,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:46:47,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-11-18 16:46:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:47,777 INFO L225 Difference]: With dead ends: 288 [2018-11-18 16:46:47,777 INFO L226 Difference]: Without dead ends: 246 [2018-11-18 16:46:47,778 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:46:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-18 16:46:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 175. [2018-11-18 16:46:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 16:46:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2018-11-18 16:46:47,795 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 45 [2018-11-18 16:46:47,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:47,796 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2018-11-18 16:46:47,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:46:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2018-11-18 16:46:47,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 16:46:47,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:47,798 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:47,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:47,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1223641925, now seen corresponding path program 1 times [2018-11-18 16:46:47,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:47,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:47,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:47,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:47,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:47,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:47,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 16:46:47,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:46:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:46:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:46:47,919 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand 9 states. [2018-11-18 16:46:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:48,052 INFO L93 Difference]: Finished difference Result 419 states and 622 transitions. [2018-11-18 16:46:48,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:46:48,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-18 16:46:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:48,054 INFO L225 Difference]: With dead ends: 419 [2018-11-18 16:46:48,054 INFO L226 Difference]: Without dead ends: 306 [2018-11-18 16:46:48,055 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:46:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-18 16:46:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 279. [2018-11-18 16:46:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-11-18 16:46:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 400 transitions. [2018-11-18 16:46:48,076 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 400 transitions. Word has length 45 [2018-11-18 16:46:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:48,076 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 400 transitions. [2018-11-18 16:46:48,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:46:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 400 transitions. [2018-11-18 16:46:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 16:46:48,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:48,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:48,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:48,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash -775161259, now seen corresponding path program 1 times [2018-11-18 16:46:48,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:48,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:48,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:48,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:48,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:48,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:48,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:48,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 16:46:48,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:46:48,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:46:48,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:46:48,144 INFO L87 Difference]: Start difference. First operand 279 states and 400 transitions. Second operand 7 states. [2018-11-18 16:46:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:48,302 INFO L93 Difference]: Finished difference Result 443 states and 653 transitions. [2018-11-18 16:46:48,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:46:48,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-18 16:46:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:48,305 INFO L225 Difference]: With dead ends: 443 [2018-11-18 16:46:48,305 INFO L226 Difference]: Without dead ends: 366 [2018-11-18 16:46:48,306 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:46:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-11-18 16:46:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 293. [2018-11-18 16:46:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-18 16:46:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 420 transitions. [2018-11-18 16:46:48,325 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 420 transitions. Word has length 49 [2018-11-18 16:46:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:48,325 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 420 transitions. [2018-11-18 16:46:48,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:46:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 420 transitions. [2018-11-18 16:46:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 16:46:48,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:48,327 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:48,327 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:48,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash -717902957, now seen corresponding path program 1 times [2018-11-18 16:46:48,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:48,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:48,393 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:48,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:48,395 INFO L87 Difference]: Start difference. First operand 293 states and 420 transitions. Second operand 4 states. [2018-11-18 16:46:48,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:48,445 INFO L93 Difference]: Finished difference Result 499 states and 730 transitions. [2018-11-18 16:46:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:48,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 16:46:48,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:48,447 INFO L225 Difference]: With dead ends: 499 [2018-11-18 16:46:48,447 INFO L226 Difference]: Without dead ends: 390 [2018-11-18 16:46:48,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:48,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-18 16:46:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2018-11-18 16:46:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-18 16:46:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 479 transitions. [2018-11-18 16:46:48,466 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 479 transitions. Word has length 49 [2018-11-18 16:46:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:48,466 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 479 transitions. [2018-11-18 16:46:48,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 479 transitions. [2018-11-18 16:46:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:48,468 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:48,468 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:48,468 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:48,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:48,469 INFO L82 PathProgramCache]: Analyzing trace with hash 868240635, now seen corresponding path program 1 times [2018-11-18 16:46:48,470 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:48,470 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:48,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:48,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:48,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:48,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:46:48,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:46:48,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:46:48,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:48,539 INFO L87 Difference]: Start difference. First operand 338 states and 479 transitions. Second operand 5 states. [2018-11-18 16:46:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:48,564 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2018-11-18 16:46:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:48,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-18 16:46:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:48,566 INFO L225 Difference]: With dead ends: 345 [2018-11-18 16:46:48,566 INFO L226 Difference]: Without dead ends: 338 [2018-11-18 16:46:48,567 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:46:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-18 16:46:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-11-18 16:46:48,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-18 16:46:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 475 transitions. [2018-11-18 16:46:48,581 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 475 transitions. Word has length 50 [2018-11-18 16:46:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:48,581 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 475 transitions. [2018-11-18 16:46:48,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:46:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 475 transitions. [2018-11-18 16:46:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:48,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:48,582 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:48,582 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:48,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 162502823, now seen corresponding path program 2 times [2018-11-18 16:46:48,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:48,583 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:48,603 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 16:46:48,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 16:46:48,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:46:48,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 16:46:48,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:48,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:46:48,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:46:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:46:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:46:48,720 INFO L87 Difference]: Start difference. First operand 338 states and 475 transitions. Second operand 12 states. [2018-11-18 16:46:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:49,084 INFO L93 Difference]: Finished difference Result 450 states and 621 transitions. [2018-11-18 16:46:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 16:46:49,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2018-11-18 16:46:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:49,087 INFO L225 Difference]: With dead ends: 450 [2018-11-18 16:46:49,087 INFO L226 Difference]: Without dead ends: 384 [2018-11-18 16:46:49,088 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-11-18 16:46:49,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-11-18 16:46:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 368. [2018-11-18 16:46:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-11-18 16:46:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 507 transitions. [2018-11-18 16:46:49,107 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 507 transitions. Word has length 50 [2018-11-18 16:46:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:49,107 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 507 transitions. [2018-11-18 16:46:49,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:46:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 507 transitions. [2018-11-18 16:46:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:49,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:49,108 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:49,109 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:49,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:49,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1369751255, now seen corresponding path program 1 times [2018-11-18 16:46:49,110 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:49,110 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:49,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:46:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:49,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:46:49,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 16:46:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-18 16:46:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:46:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:46:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-11-18 16:46:49,293 INFO L87 Difference]: Start difference. First operand 368 states and 507 transitions. Second operand 16 states. [2018-11-18 16:46:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:49,701 INFO L93 Difference]: Finished difference Result 991 states and 1396 transitions. [2018-11-18 16:46:49,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:46:49,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-11-18 16:46:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:49,705 INFO L225 Difference]: With dead ends: 991 [2018-11-18 16:46:49,706 INFO L226 Difference]: Without dead ends: 850 [2018-11-18 16:46:49,706 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 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-18 16:46:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-11-18 16:46:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 417. [2018-11-18 16:46:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 16:46:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 582 transitions. [2018-11-18 16:46:49,735 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 582 transitions. Word has length 50 [2018-11-18 16:46:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:49,736 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 582 transitions. [2018-11-18 16:46:49,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:46:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 582 transitions. [2018-11-18 16:46:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:49,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:49,738 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:49,738 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:49,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -782945241, now seen corresponding path program 1 times [2018-11-18 16:46:49,739 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:46:49,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:49,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:49,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:46:49,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:50,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:46:50,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:46:50,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:50,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:46:50,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:50,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:50,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 16:46:50,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:46:50,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:46:50,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:46:50,190 INFO L87 Difference]: Start difference. First operand 417 states and 582 transitions. Second operand 11 states. [2018-11-18 16:46:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:50,499 INFO L93 Difference]: Finished difference Result 798 states and 1123 transitions. [2018-11-18 16:46:50,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:46:50,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-18 16:46:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:50,502 INFO L225 Difference]: With dead ends: 798 [2018-11-18 16:46:50,502 INFO L226 Difference]: Without dead ends: 613 [2018-11-18 16:46:50,503 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-11-18 16:46:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-11-18 16:46:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 485. [2018-11-18 16:46:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-18 16:46:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 665 transitions. [2018-11-18 16:46:50,535 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 665 transitions. Word has length 50 [2018-11-18 16:46:50,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:50,535 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 665 transitions. [2018-11-18 16:46:50,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:46:50,536 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 665 transitions. [2018-11-18 16:46:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:50,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:50,538 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:50,538 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:50,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:50,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1009807981, now seen corresponding path program 1 times [2018-11-18 16:46:50,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:50,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:50,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:50,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:46:50,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:50,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:46:50,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:46:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:46:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:46:50,620 INFO L87 Difference]: Start difference. First operand 485 states and 665 transitions. Second operand 6 states. [2018-11-18 16:46:50,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:50,887 INFO L93 Difference]: Finished difference Result 795 states and 1107 transitions. [2018-11-18 16:46:50,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:46:50,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 16:46:50,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:50,892 INFO L225 Difference]: With dead ends: 795 [2018-11-18 16:46:50,892 INFO L226 Difference]: Without dead ends: 702 [2018-11-18 16:46:50,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:46:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2018-11-18 16:46:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 537. [2018-11-18 16:46:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-18 16:46:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 731 transitions. [2018-11-18 16:46:50,927 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 731 transitions. Word has length 50 [2018-11-18 16:46:50,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:50,928 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 731 transitions. [2018-11-18 16:46:50,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:46:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 731 transitions. [2018-11-18 16:46:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:50,931 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:50,931 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:50,931 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:50,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash 952549679, now seen corresponding path program 1 times [2018-11-18 16:46:50,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:50,931 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:50,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:51,025 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-18 16:46:51,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:51,079 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-18 16:46:51,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:51,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-18 16:46:51,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:46:51,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:46:51,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:46:51,083 INFO L87 Difference]: Start difference. First operand 537 states and 731 transitions. Second operand 10 states. [2018-11-18 16:46:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:51,309 INFO L93 Difference]: Finished difference Result 921 states and 1245 transitions. [2018-11-18 16:46:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:46:51,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-11-18 16:46:51,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:51,312 INFO L225 Difference]: With dead ends: 921 [2018-11-18 16:46:51,312 INFO L226 Difference]: Without dead ends: 827 [2018-11-18 16:46:51,313 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:46:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-11-18 16:46:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 570. [2018-11-18 16:46:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-11-18 16:46:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 768 transitions. [2018-11-18 16:46:51,352 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 768 transitions. Word has length 50 [2018-11-18 16:46:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:51,352 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 768 transitions. [2018-11-18 16:46:51,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:46:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 768 transitions. [2018-11-18 16:46:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:51,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:51,353 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:51,353 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:51,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:51,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1596613995, now seen corresponding path program 1 times [2018-11-18 16:46:51,354 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:51,354 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:51,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:51,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:46:51,500 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:51,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:51,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:46:51,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:46:51,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:46:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:46:51,503 INFO L87 Difference]: Start difference. First operand 570 states and 768 transitions. Second operand 6 states. [2018-11-18 16:46:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:56,266 INFO L93 Difference]: Finished difference Result 601 states and 806 transitions. [2018-11-18 16:46:56,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:46:56,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-18 16:46:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:56,268 INFO L225 Difference]: With dead ends: 601 [2018-11-18 16:46:56,268 INFO L226 Difference]: Without dead ends: 599 [2018-11-18 16:46:56,269 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:46:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-11-18 16:46:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 574. [2018-11-18 16:46:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-18 16:46:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 771 transitions. [2018-11-18 16:46:56,312 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 771 transitions. Word has length 50 [2018-11-18 16:46:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:56,313 INFO L480 AbstractCegarLoop]: Abstraction has 574 states and 771 transitions. [2018-11-18 16:46:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:46:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 771 transitions. [2018-11-18 16:46:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 16:46:56,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:56,314 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:56,315 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:56,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash 277073781, now seen corresponding path program 1 times [2018-11-18 16:46:56,315 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:56,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:56,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 16:46:56,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:56,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:56,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:56,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:56,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:56,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:56,376 INFO L87 Difference]: Start difference. First operand 574 states and 771 transitions. Second operand 4 states. [2018-11-18 16:46:56,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:56,507 INFO L93 Difference]: Finished difference Result 948 states and 1267 transitions. [2018-11-18 16:46:56,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:56,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-18 16:46:56,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:56,509 INFO L225 Difference]: With dead ends: 948 [2018-11-18 16:46:56,509 INFO L226 Difference]: Without dead ends: 380 [2018-11-18 16:46:56,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:56,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-18 16:46:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 366. [2018-11-18 16:46:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 16:46:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 477 transitions. [2018-11-18 16:46:56,537 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 477 transitions. Word has length 50 [2018-11-18 16:46:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:56,537 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 477 transitions. [2018-11-18 16:46:56,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:56,538 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 477 transitions. [2018-11-18 16:46:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 16:46:56,538 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:56,539 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:56,539 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:56,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:56,539 INFO L82 PathProgramCache]: Analyzing trace with hash -38296, now seen corresponding path program 1 times [2018-11-18 16:46:56,539 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:56,539 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:56,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:56,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:56,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:56,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:56,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:56,596 INFO L87 Difference]: Start difference. First operand 366 states and 477 transitions. Second operand 4 states. [2018-11-18 16:46:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:56,632 INFO L93 Difference]: Finished difference Result 383 states and 496 transitions. [2018-11-18 16:46:56,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:46:56,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-18 16:46:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:56,634 INFO L225 Difference]: With dead ends: 383 [2018-11-18 16:46:56,635 INFO L226 Difference]: Without dead ends: 327 [2018-11-18 16:46:56,635 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:56,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-18 16:46:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 311. [2018-11-18 16:46:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-11-18 16:46:56,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 401 transitions. [2018-11-18 16:46:56,660 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 401 transitions. Word has length 54 [2018-11-18 16:46:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:56,660 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 401 transitions. [2018-11-18 16:46:56,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:56,660 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2018-11-18 16:46:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 16:46:56,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:56,663 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:56,663 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:56,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:56,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1801519799, now seen corresponding path program 1 times [2018-11-18 16:46:56,663 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:56,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:56,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:56,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:56,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:56,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:56,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:46:56,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:46:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:46:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:46:56,738 INFO L87 Difference]: Start difference. First operand 311 states and 401 transitions. Second operand 4 states. [2018-11-18 16:46:56,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:56,815 INFO L93 Difference]: Finished difference Result 468 states and 623 transitions. [2018-11-18 16:46:56,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:46:56,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-18 16:46:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:56,817 INFO L225 Difference]: With dead ends: 468 [2018-11-18 16:46:56,817 INFO L226 Difference]: Without dead ends: 363 [2018-11-18 16:46:56,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:46:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-11-18 16:46:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 309. [2018-11-18 16:46:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-11-18 16:46:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 402 transitions. [2018-11-18 16:46:56,840 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 402 transitions. Word has length 54 [2018-11-18 16:46:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:56,840 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 402 transitions. [2018-11-18 16:46:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:46:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2018-11-18 16:46:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:46:56,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:56,841 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:56,842 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:56,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash 358260584, now seen corresponding path program 1 times [2018-11-18 16:46:56,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:56,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:56,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 16:46:56,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:56,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:46:56,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:46:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:46:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:46:56,984 INFO L87 Difference]: Start difference. First operand 309 states and 402 transitions. Second operand 12 states. [2018-11-18 16:46:57,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:57,384 INFO L93 Difference]: Finished difference Result 382 states and 502 transitions. [2018-11-18 16:46:57,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:46:57,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2018-11-18 16:46:57,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:57,387 INFO L225 Difference]: With dead ends: 382 [2018-11-18 16:46:57,387 INFO L226 Difference]: Without dead ends: 357 [2018-11-18 16:46:57,387 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-18 16:46:57,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-18 16:46:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 328. [2018-11-18 16:46:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-18 16:46:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 429 transitions. [2018-11-18 16:46:57,419 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 429 transitions. Word has length 57 [2018-11-18 16:46:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:57,419 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 429 transitions. [2018-11-18 16:46:57,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:46:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 429 transitions. [2018-11-18 16:46:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:46:57,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:57,420 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:57,421 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:57,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:57,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1557147476, now seen corresponding path program 1 times [2018-11-18 16:46:57,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:57,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:57,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:46:57,600 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:57,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:46:57,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:46:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:46:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:46:57,607 INFO L87 Difference]: Start difference. First operand 328 states and 429 transitions. Second operand 8 states. [2018-11-18 16:46:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:57,899 INFO L93 Difference]: Finished difference Result 400 states and 528 transitions. [2018-11-18 16:46:57,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:46:57,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-11-18 16:46:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:57,901 INFO L225 Difference]: With dead ends: 400 [2018-11-18 16:46:57,901 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 16:46:57,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:46:57,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 16:46:57,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 330. [2018-11-18 16:46:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-18 16:46:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 440 transitions. [2018-11-18 16:46:57,917 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 440 transitions. Word has length 57 [2018-11-18 16:46:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:57,917 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 440 transitions. [2018-11-18 16:46:57,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:46:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 440 transitions. [2018-11-18 16:46:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:46:57,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:57,918 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:57,918 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:57,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:57,919 INFO L82 PathProgramCache]: Analyzing trace with hash -287646214, now seen corresponding path program 1 times [2018-11-18 16:46:57,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:57,919 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:57,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:46:58,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:58,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:58,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 16:46:58,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 16:46:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 16:46:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:46:58,007 INFO L87 Difference]: Start difference. First operand 330 states and 440 transitions. Second operand 7 states. [2018-11-18 16:46:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:58,105 INFO L93 Difference]: Finished difference Result 440 states and 562 transitions. [2018-11-18 16:46:58,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:46:58,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-11-18 16:46:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:58,107 INFO L225 Difference]: With dead ends: 440 [2018-11-18 16:46:58,107 INFO L226 Difference]: Without dead ends: 353 [2018-11-18 16:46:58,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:46:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-11-18 16:46:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 317. [2018-11-18 16:46:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-18 16:46:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 419 transitions. [2018-11-18 16:46:58,122 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 419 transitions. Word has length 58 [2018-11-18 16:46:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:58,122 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 419 transitions. [2018-11-18 16:46:58,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 16:46:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 419 transitions. [2018-11-18 16:46:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:46:58,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:58,123 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:58,124 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:58,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1706498492, now seen corresponding path program 1 times [2018-11-18 16:46:58,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:58,124 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:58,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:58,279 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 16:46:58,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:46:58,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:46:58,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 16:46:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:46:58,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:46:58,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:46:58,281 INFO L87 Difference]: Start difference. First operand 317 states and 419 transitions. Second operand 13 states. [2018-11-18 16:46:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:46:58,540 INFO L93 Difference]: Finished difference Result 381 states and 498 transitions. [2018-11-18 16:46:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:46:58,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-18 16:46:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:46:58,542 INFO L225 Difference]: With dead ends: 381 [2018-11-18 16:46:58,542 INFO L226 Difference]: Without dead ends: 338 [2018-11-18 16:46:58,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:46:58,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-18 16:46:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 312. [2018-11-18 16:46:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-18 16:46:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 411 transitions. [2018-11-18 16:46:58,556 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 411 transitions. Word has length 58 [2018-11-18 16:46:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:46:58,557 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 411 transitions. [2018-11-18 16:46:58,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:46:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 411 transitions. [2018-11-18 16:46:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:46:58,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:46:58,558 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:46:58,558 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:46:58,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:46:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1623225088, now seen corresponding path program 1 times [2018-11-18 16:46:58,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:46:58,559 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:58,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:46:58,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:58,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:46:58,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:46:58,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:46:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:46:58,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:46:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:46:58,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:46:59,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:46:59,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-18 16:46:59,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:46:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:46:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:46:59,010 INFO L87 Difference]: Start difference. First operand 312 states and 411 transitions. Second operand 11 states. [2018-11-18 16:47:02,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:02,622 INFO L93 Difference]: Finished difference Result 368 states and 484 transitions. [2018-11-18 16:47:02,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:47:02,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-11-18 16:47:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:02,623 INFO L225 Difference]: With dead ends: 368 [2018-11-18 16:47:02,623 INFO L226 Difference]: Without dead ends: 334 [2018-11-18 16:47:02,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-11-18 16:47:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-18 16:47:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 310. [2018-11-18 16:47:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-18 16:47:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 407 transitions. [2018-11-18 16:47:02,638 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 407 transitions. Word has length 58 [2018-11-18 16:47:02,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:02,638 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 407 transitions. [2018-11-18 16:47:02,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:47:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 407 transitions. [2018-11-18 16:47:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:47:02,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:02,639 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:02,639 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:02,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:02,640 INFO L82 PathProgramCache]: Analyzing trace with hash -906443008, now seen corresponding path program 2 times [2018-11-18 16:47:02,640 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:02,640 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:02,671 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 16:47:02,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:47:02,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:47:02,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:47:02,830 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:47:02,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:47:02,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:47:02,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:47:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:47:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:47:02,832 INFO L87 Difference]: Start difference. First operand 310 states and 407 transitions. Second operand 12 states. [2018-11-18 16:47:03,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:03,088 INFO L93 Difference]: Finished difference Result 387 states and 498 transitions. [2018-11-18 16:47:03,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:47:03,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-18 16:47:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:03,090 INFO L225 Difference]: With dead ends: 387 [2018-11-18 16:47:03,090 INFO L226 Difference]: Without dead ends: 332 [2018-11-18 16:47:03,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:47:03,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-18 16:47:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 300. [2018-11-18 16:47:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-18 16:47:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 394 transitions. [2018-11-18 16:47:03,105 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 394 transitions. Word has length 58 [2018-11-18 16:47:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:03,105 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 394 transitions. [2018-11-18 16:47:03,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:47:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 394 transitions. [2018-11-18 16:47:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:47:03,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:03,107 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:03,107 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:03,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 104674242, now seen corresponding path program 1 times [2018-11-18 16:47:03,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:03,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:47:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:03,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 16:47:05,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:47:05,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:47:05,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:47:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:47:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:47:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=110, Unknown=1, NotChecked=0, Total=132 [2018-11-18 16:47:05,323 INFO L87 Difference]: Start difference. First operand 300 states and 394 transitions. Second operand 12 states. [2018-11-18 16:47:07,093 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-18 16:47:11,395 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 16:47:13,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:13,655 INFO L93 Difference]: Finished difference Result 374 states and 480 transitions. [2018-11-18 16:47:13,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:47:13,655 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-11-18 16:47:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:13,656 INFO L225 Difference]: With dead ends: 374 [2018-11-18 16:47:13,656 INFO L226 Difference]: Without dead ends: 333 [2018-11-18 16:47:13,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=91, Invalid=368, Unknown=3, NotChecked=0, Total=462 [2018-11-18 16:47:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-18 16:47:13,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 297. [2018-11-18 16:47:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-18 16:47:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 389 transitions. [2018-11-18 16:47:13,677 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 389 transitions. Word has length 58 [2018-11-18 16:47:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:13,677 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 389 transitions. [2018-11-18 16:47:13,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:47:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2018-11-18 16:47:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:47:13,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:13,678 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:13,679 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:13,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1935343998, now seen corresponding path program 1 times [2018-11-18 16:47:13,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:13,679 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:13,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:47:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:13,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-18 16:47:13,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:47:13,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 16:47:13,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:47:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-18 16:47:13,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:47:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:47:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:47:13,818 INFO L87 Difference]: Start difference. First operand 297 states and 389 transitions. Second operand 9 states. [2018-11-18 16:47:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:13,987 INFO L93 Difference]: Finished difference Result 400 states and 502 transitions. [2018-11-18 16:47:13,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:47:13,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-18 16:47:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:13,988 INFO L225 Difference]: With dead ends: 400 [2018-11-18 16:47:13,989 INFO L226 Difference]: Without dead ends: 296 [2018-11-18 16:47:13,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 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-18 16:47:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-18 16:47:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 284. [2018-11-18 16:47:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-18 16:47:14,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 367 transitions. [2018-11-18 16:47:14,009 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 367 transitions. Word has length 58 [2018-11-18 16:47:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:14,010 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 367 transitions. [2018-11-18 16:47:14,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:47:14,010 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 367 transitions. [2018-11-18 16:47:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 16:47:14,011 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:14,011 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:14,011 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash 58800708, now seen corresponding path program 1 times [2018-11-18 16:47:14,011 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:14,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:47:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:14,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:47:20,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:47:20,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:47:20,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:47:20,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:47:20,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:47:20,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=37, Unknown=2, NotChecked=0, Total=56 [2018-11-18 16:47:20,242 INFO L87 Difference]: Start difference. First operand 284 states and 367 transitions. Second operand 8 states. [2018-11-18 16:47:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:31,375 INFO L93 Difference]: Finished difference Result 307 states and 390 transitions. [2018-11-18 16:47:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:47:31,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-18 16:47:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:31,376 INFO L225 Difference]: With dead ends: 307 [2018-11-18 16:47:31,376 INFO L226 Difference]: Without dead ends: 305 [2018-11-18 16:47:31,377 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=21, Invalid=49, Unknown=2, NotChecked=0, Total=72 [2018-11-18 16:47:31,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-11-18 16:47:31,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 289. [2018-11-18 16:47:31,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-18 16:47:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 372 transitions. [2018-11-18 16:47:31,391 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 372 transitions. Word has length 58 [2018-11-18 16:47:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:31,391 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 372 transitions. [2018-11-18 16:47:31,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:47:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 372 transitions. [2018-11-18 16:47:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 16:47:31,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:31,392 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:31,392 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:31,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:31,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1323559625, now seen corresponding path program 1 times [2018-11-18 16:47:31,393 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:31,393 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:31,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:47:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:31,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:47:31,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:47:31,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:47:31,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:47:31,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:47:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:47:31,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:47:31,476 INFO L87 Difference]: Start difference. First operand 289 states and 372 transitions. Second operand 6 states. [2018-11-18 16:47:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:47:31,572 INFO L93 Difference]: Finished difference Result 359 states and 459 transitions. [2018-11-18 16:47:31,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:47:31,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-11-18 16:47:31,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:47:31,574 INFO L225 Difference]: With dead ends: 359 [2018-11-18 16:47:31,574 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 16:47:31,575 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:47:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 16:47:31,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2018-11-18 16:47:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-18 16:47:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 370 transitions. [2018-11-18 16:47:31,598 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 370 transitions. Word has length 57 [2018-11-18 16:47:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:47:31,598 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 370 transitions. [2018-11-18 16:47:31,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:47:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 370 transitions. [2018-11-18 16:47:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:47:31,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:47:31,599 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:47:31,600 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:47:31,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:47:31,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1594024368, now seen corresponding path program 1 times [2018-11-18 16:47:31,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:47:31,600 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:47:31,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:47:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:47:31,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:47:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:47:37,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:47:37,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:47:37,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:47:37,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:47:37,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:47:37,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=38, Unknown=3, NotChecked=0, Total=56 [2018-11-18 16:47:37,797 INFO L87 Difference]: Start difference. First operand 289 states and 370 transitions. Second operand 8 states. [2018-11-18 16:47:56,822 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 16:48:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:07,808 INFO L93 Difference]: Finished difference Result 305 states and 385 transitions. [2018-11-18 16:48:07,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:48:07,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-18 16:48:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:07,809 INFO L225 Difference]: With dead ends: 305 [2018-11-18 16:48:07,809 INFO L226 Difference]: Without dead ends: 303 [2018-11-18 16:48:07,809 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=23, Invalid=62, Unknown=5, NotChecked=0, Total=90 [2018-11-18 16:48:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-18 16:48:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 288. [2018-11-18 16:48:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 16:48:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 368 transitions. [2018-11-18 16:48:07,823 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 368 transitions. Word has length 59 [2018-11-18 16:48:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:07,823 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 368 transitions. [2018-11-18 16:48:07,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:48:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 368 transitions. [2018-11-18 16:48:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:48:07,824 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:07,824 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:07,824 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:07,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -924244380, now seen corresponding path program 1 times [2018-11-18 16:48:07,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:07,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:07,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 16:48:07,866 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:07,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:07,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:48:07,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:48:07,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:48:07,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:48:07,868 INFO L87 Difference]: Start difference. First operand 288 states and 368 transitions. Second operand 4 states. [2018-11-18 16:48:07,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:07,887 INFO L93 Difference]: Finished difference Result 297 states and 376 transitions. [2018-11-18 16:48:07,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:48:07,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-11-18 16:48:07,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:07,888 INFO L225 Difference]: With dead ends: 297 [2018-11-18 16:48:07,888 INFO L226 Difference]: Without dead ends: 255 [2018-11-18 16:48:07,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:48:07,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-18 16:48:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2018-11-18 16:48:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 16:48:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2018-11-18 16:48:07,901 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 59 [2018-11-18 16:48:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:07,901 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2018-11-18 16:48:07,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:48:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2018-11-18 16:48:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 16:48:07,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:07,902 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:07,902 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:07,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:07,902 INFO L82 PathProgramCache]: Analyzing trace with hash 770443443, now seen corresponding path program 1 times [2018-11-18 16:48:07,902 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:07,902 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:07,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:07,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 16:48:07,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:07,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:07,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:48:07,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:48:07,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:48:07,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:48:07,972 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand 5 states. [2018-11-18 16:48:08,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:08,025 INFO L93 Difference]: Finished difference Result 280 states and 346 transitions. [2018-11-18 16:48:08,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:48:08,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-18 16:48:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:08,026 INFO L225 Difference]: With dead ends: 280 [2018-11-18 16:48:08,026 INFO L226 Difference]: Without dead ends: 257 [2018-11-18 16:48:08,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-18 16:48:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2018-11-18 16:48:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 16:48:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 304 transitions. [2018-11-18 16:48:08,041 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 304 transitions. Word has length 59 [2018-11-18 16:48:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:08,041 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 304 transitions. [2018-11-18 16:48:08,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:48:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 304 transitions. [2018-11-18 16:48:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-18 16:48:08,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:08,042 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:08,042 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:08,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:08,042 INFO L82 PathProgramCache]: Analyzing trace with hash -794801909, now seen corresponding path program 1 times [2018-11-18 16:48:08,042 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:08,042 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:08,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:48:08,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:08,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:08,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 16:48:08,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 16:48:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 16:48:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:48:08,114 INFO L87 Difference]: Start difference. First operand 245 states and 304 transitions. Second operand 8 states. [2018-11-18 16:48:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:08,284 INFO L93 Difference]: Finished difference Result 339 states and 433 transitions. [2018-11-18 16:48:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 16:48:08,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-18 16:48:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:08,285 INFO L225 Difference]: With dead ends: 339 [2018-11-18 16:48:08,286 INFO L226 Difference]: Without dead ends: 299 [2018-11-18 16:48:08,288 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:48:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-18 16:48:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 277. [2018-11-18 16:48:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-18 16:48:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 349 transitions. [2018-11-18 16:48:08,309 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 349 transitions. Word has length 64 [2018-11-18 16:48:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:08,309 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 349 transitions. [2018-11-18 16:48:08,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 16:48:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 349 transitions. [2018-11-18 16:48:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:48:08,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:08,310 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:08,310 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:08,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:08,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1968138788, now seen corresponding path program 1 times [2018-11-18 16:48:08,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:08,310 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:08,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:08,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:48:08,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:08,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:08,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:48:08,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:48:08,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:48:08,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:08,376 INFO L87 Difference]: Start difference. First operand 277 states and 349 transitions. Second operand 6 states. [2018-11-18 16:48:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:08,441 INFO L93 Difference]: Finished difference Result 368 states and 477 transitions. [2018-11-18 16:48:08,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:48:08,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 16:48:08,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:08,442 INFO L225 Difference]: With dead ends: 368 [2018-11-18 16:48:08,442 INFO L226 Difference]: Without dead ends: 295 [2018-11-18 16:48:08,442 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:48:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-18 16:48:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 259. [2018-11-18 16:48:08,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-11-18 16:48:08,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 310 transitions. [2018-11-18 16:48:08,456 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 310 transitions. Word has length 66 [2018-11-18 16:48:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:08,456 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 310 transitions. [2018-11-18 16:48:08,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:48:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 310 transitions. [2018-11-18 16:48:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:48:08,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:08,457 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:08,457 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:08,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:08,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2061521193, now seen corresponding path program 1 times [2018-11-18 16:48:08,457 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:08,458 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:08,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:08,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 16:48:08,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:08,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:08,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:48:08,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:48:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:48:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:08,532 INFO L87 Difference]: Start difference. First operand 259 states and 310 transitions. Second operand 6 states. [2018-11-18 16:48:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:08,572 INFO L93 Difference]: Finished difference Result 300 states and 362 transitions. [2018-11-18 16:48:08,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:48:08,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 16:48:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:08,573 INFO L225 Difference]: With dead ends: 300 [2018-11-18 16:48:08,573 INFO L226 Difference]: Without dead ends: 298 [2018-11-18 16:48:08,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:48:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-18 16:48:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 268. [2018-11-18 16:48:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-11-18 16:48:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 321 transitions. [2018-11-18 16:48:08,585 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 321 transitions. Word has length 66 [2018-11-18 16:48:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:08,585 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 321 transitions. [2018-11-18 16:48:08,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:48:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 321 transitions. [2018-11-18 16:48:08,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 16:48:08,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:08,586 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:08,586 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:08,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1296721069, now seen corresponding path program 1 times [2018-11-18 16:48:08,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:08,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:08,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 16:48:08,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:08,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:08,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:48:08,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:48:08,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:48:08,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:08,655 INFO L87 Difference]: Start difference. First operand 268 states and 321 transitions. Second operand 6 states. [2018-11-18 16:48:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:08,692 INFO L93 Difference]: Finished difference Result 297 states and 353 transitions. [2018-11-18 16:48:08,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:48:08,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-18 16:48:08,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:08,693 INFO L225 Difference]: With dead ends: 297 [2018-11-18 16:48:08,693 INFO L226 Difference]: Without dead ends: 295 [2018-11-18 16:48:08,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:48:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-18 16:48:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 272. [2018-11-18 16:48:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-11-18 16:48:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 324 transitions. [2018-11-18 16:48:08,706 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 324 transitions. Word has length 66 [2018-11-18 16:48:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:08,706 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 324 transitions. [2018-11-18 16:48:08,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:48:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 324 transitions. [2018-11-18 16:48:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:48:08,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:08,707 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:08,707 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:08,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1166908399, now seen corresponding path program 1 times [2018-11-18 16:48:08,707 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:08,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 16:48:09,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:09,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 16:48:09,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 16:48:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 16:48:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-18 16:48:09,117 INFO L87 Difference]: Start difference. First operand 272 states and 324 transitions. Second operand 11 states. [2018-11-18 16:48:12,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:12,498 INFO L93 Difference]: Finished difference Result 335 states and 407 transitions. [2018-11-18 16:48:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 16:48:12,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-11-18 16:48:12,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:12,500 INFO L225 Difference]: With dead ends: 335 [2018-11-18 16:48:12,500 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 16:48:12,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-18 16:48:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 16:48:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 282. [2018-11-18 16:48:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-11-18 16:48:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 337 transitions. [2018-11-18 16:48:12,519 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 337 transitions. Word has length 71 [2018-11-18 16:48:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:12,519 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 337 transitions. [2018-11-18 16:48:12,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 16:48:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 337 transitions. [2018-11-18 16:48:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 16:48:12,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:12,519 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:12,519 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:12,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:12,520 INFO L82 PathProgramCache]: Analyzing trace with hash -756319635, now seen corresponding path program 1 times [2018-11-18 16:48:12,520 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:12,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:12,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 16:48:13,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:48:13,543 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-11-18 16:48:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-18 16:48:14,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:48:14,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-11-18 16:48:14,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 16:48:14,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 16:48:14,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-11-18 16:48:14,949 INFO L87 Difference]: Start difference. First operand 282 states and 337 transitions. Second operand 26 states. [2018-11-18 16:48:15,358 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-18 16:48:18,011 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-18 16:48:18,391 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-18 16:48:19,177 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-11-18 16:48:20,075 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-11-18 16:48:20,836 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-18 16:48:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:21,887 INFO L93 Difference]: Finished difference Result 371 states and 455 transitions. [2018-11-18 16:48:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-18 16:48:21,887 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 71 [2018-11-18 16:48:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:21,888 INFO L225 Difference]: With dead ends: 371 [2018-11-18 16:48:21,889 INFO L226 Difference]: Without dead ends: 343 [2018-11-18 16:48:21,889 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-11-18 16:48:21,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-11-18 16:48:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 291. [2018-11-18 16:48:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-11-18 16:48:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 349 transitions. [2018-11-18 16:48:21,907 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 349 transitions. Word has length 71 [2018-11-18 16:48:21,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:21,907 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 349 transitions. [2018-11-18 16:48:21,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 16:48:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 349 transitions. [2018-11-18 16:48:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 16:48:21,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:21,908 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:21,908 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:21,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1129966342, now seen corresponding path program 1 times [2018-11-18 16:48:21,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:21,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:21,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 16:48:21,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:48:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 16:48:22,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:48:22,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-11-18 16:48:22,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 16:48:22,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 16:48:22,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:48:22,091 INFO L87 Difference]: Start difference. First operand 291 states and 349 transitions. Second operand 14 states. [2018-11-18 16:48:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:22,402 INFO L93 Difference]: Finished difference Result 318 states and 380 transitions. [2018-11-18 16:48:22,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:48:22,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2018-11-18 16:48:22,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:22,403 INFO L225 Difference]: With dead ends: 318 [2018-11-18 16:48:22,403 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 16:48:22,403 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-11-18 16:48:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 16:48:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 288. [2018-11-18 16:48:22,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-18 16:48:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 346 transitions. [2018-11-18 16:48:22,422 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 346 transitions. Word has length 72 [2018-11-18 16:48:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:22,422 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 346 transitions. [2018-11-18 16:48:22,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 16:48:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 346 transitions. [2018-11-18 16:48:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 16:48:22,423 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:22,423 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:22,423 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:22,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash -957279926, now seen corresponding path program 1 times [2018-11-18 16:48:22,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:22,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:22,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:22,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 16:48:22,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:22,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:48:22,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:48:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:48:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:22,525 INFO L87 Difference]: Start difference. First operand 288 states and 346 transitions. Second operand 6 states. [2018-11-18 16:48:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:22,725 INFO L93 Difference]: Finished difference Result 387 states and 473 transitions. [2018-11-18 16:48:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 16:48:22,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-18 16:48:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:22,727 INFO L225 Difference]: With dead ends: 387 [2018-11-18 16:48:22,727 INFO L226 Difference]: Without dead ends: 368 [2018-11-18 16:48:22,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:48:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-11-18 16:48:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 284. [2018-11-18 16:48:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-18 16:48:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 343 transitions. [2018-11-18 16:48:22,749 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 343 transitions. Word has length 72 [2018-11-18 16:48:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:22,749 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 343 transitions. [2018-11-18 16:48:22,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:48:22,750 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 343 transitions. [2018-11-18 16:48:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 16:48:22,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:22,750 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:22,751 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:22,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:22,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1539597315, now seen corresponding path program 1 times [2018-11-18 16:48:22,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:22,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:22,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 16:48:22,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:22,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:22,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:48:22,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 16:48:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 16:48:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-18 16:48:22,916 INFO L87 Difference]: Start difference. First operand 284 states and 343 transitions. Second operand 9 states. [2018-11-18 16:48:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:23,301 INFO L93 Difference]: Finished difference Result 337 states and 406 transitions. [2018-11-18 16:48:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 16:48:23,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-11-18 16:48:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:23,303 INFO L225 Difference]: With dead ends: 337 [2018-11-18 16:48:23,303 INFO L226 Difference]: Without dead ends: 296 [2018-11-18 16:48:23,303 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-18 16:48:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-11-18 16:48:23,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2018-11-18 16:48:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-18 16:48:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 309 transitions. [2018-11-18 16:48:23,323 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 309 transitions. Word has length 72 [2018-11-18 16:48:23,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:23,323 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 309 transitions. [2018-11-18 16:48:23,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 16:48:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 309 transitions. [2018-11-18 16:48:23,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 16:48:23,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:23,324 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:23,324 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:23,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:23,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1650486698, now seen corresponding path program 1 times [2018-11-18 16:48:23,325 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:23,325 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:23,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:23,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 16:48:23,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:48:24,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:48:24,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 16:48:24,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:24,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:48:24,137 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:48:24,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-11-18 16:48:24,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 16:48:24,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 16:48:24,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-11-18 16:48:24,152 INFO L87 Difference]: Start difference. First operand 263 states and 309 transitions. Second operand 17 states. [2018-11-18 16:48:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:25,142 INFO L93 Difference]: Finished difference Result 324 states and 376 transitions. [2018-11-18 16:48:25,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 16:48:25,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2018-11-18 16:48:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:25,143 INFO L225 Difference]: With dead ends: 324 [2018-11-18 16:48:25,143 INFO L226 Difference]: Without dead ends: 229 [2018-11-18 16:48:25,144 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-11-18 16:48:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-18 16:48:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 190. [2018-11-18 16:48:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-18 16:48:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2018-11-18 16:48:25,165 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 74 [2018-11-18 16:48:25,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:25,165 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2018-11-18 16:48:25,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 16:48:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2018-11-18 16:48:25,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 16:48:25,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:25,166 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:25,166 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:25,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1593228396, now seen corresponding path program 1 times [2018-11-18 16:48:25,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:25,166 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:25,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 16:48:25,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:25,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:25,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 16:48:25,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:48:25,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:48:25,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:48:25,262 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand 6 states. [2018-11-18 16:48:25,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:25,328 INFO L93 Difference]: Finished difference Result 207 states and 243 transitions. [2018-11-18 16:48:25,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:48:25,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-18 16:48:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:25,329 INFO L225 Difference]: With dead ends: 207 [2018-11-18 16:48:25,329 INFO L226 Difference]: Without dead ends: 163 [2018-11-18 16:48:25,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 16:48:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-18 16:48:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2018-11-18 16:48:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 16:48:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2018-11-18 16:48:25,346 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 74 [2018-11-18 16:48:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:25,346 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2018-11-18 16:48:25,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:48:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2018-11-18 16:48:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-18 16:48:25,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:25,347 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:25,347 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:25,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:25,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1841523407, now seen corresponding path program 1 times [2018-11-18 16:48:25,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:25,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 16:48:25,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:25,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:48:25,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:25,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:25,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 16:48:25,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 16:48:25,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 16:48:25,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 16:48:25,405 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand 4 states. [2018-11-18 16:48:25,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:25,429 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2018-11-18 16:48:25,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 16:48:25,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-18 16:48:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:25,431 INFO L225 Difference]: With dead ends: 162 [2018-11-18 16:48:25,431 INFO L226 Difference]: Without dead ends: 138 [2018-11-18 16:48:25,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:48:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-18 16:48:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-11-18 16:48:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-18 16:48:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2018-11-18 16:48:25,442 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 73 [2018-11-18 16:48:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:25,442 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2018-11-18 16:48:25,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 16:48:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2018-11-18 16:48:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 16:48:25,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:25,443 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:25,443 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:25,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -258643985, now seen corresponding path program 1 times [2018-11-18 16:48:25,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:25,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:25,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 16:48:25,491 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:25,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:25,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:48:25,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 16:48:25,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 16:48:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 16:48:25,494 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand 5 states. [2018-11-18 16:48:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:25,541 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2018-11-18 16:48:25,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 16:48:25,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-11-18 16:48:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:25,542 INFO L225 Difference]: With dead ends: 148 [2018-11-18 16:48:25,542 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 16:48:25,543 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 16:48:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 16:48:25,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-18 16:48:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 16:48:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-11-18 16:48:25,548 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 75 [2018-11-18 16:48:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:25,548 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-11-18 16:48:25,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 16:48:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-11-18 16:48:25,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-18 16:48:25,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:25,548 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:25,548 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:25,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash 950560560, now seen corresponding path program 1 times [2018-11-18 16:48:25,548 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:25,549 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:25,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 16:48:26,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:26,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:26,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-18 16:48:26,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 16:48:26,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 16:48:26,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-18 16:48:26,162 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 12 states. [2018-11-18 16:48:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:27,069 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2018-11-18 16:48:27,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 16:48:27,069 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-11-18 16:48:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:27,070 INFO L225 Difference]: With dead ends: 92 [2018-11-18 16:48:27,070 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 16:48:27,070 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-18 16:48:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 16:48:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-18 16:48:27,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 16:48:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-18 16:48:27,074 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 79 [2018-11-18 16:48:27,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:27,075 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-18 16:48:27,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 16:48:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-18 16:48:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 16:48:27,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:48:27,075 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:48:27,075 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:48:27,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:48:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1440552440, now seen corresponding path program 1 times [2018-11-18 16:48:27,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 16:48:27,075 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/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-18 16:48:27,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:48:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:48:27,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:48:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 16:48:27,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:48:27,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:48:27,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-18 16:48:27,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:48:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:48:27,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:48:27,266 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 10 states. [2018-11-18 16:48:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:48:27,538 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-18 16:48:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:48:27,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-11-18 16:48:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:48:27,539 INFO L225 Difference]: With dead ends: 74 [2018-11-18 16:48:27,539 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:48:27,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-18 16:48:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:48:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:48:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:48:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:48:27,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-11-18 16:48:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:48:27,540 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:48:27,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:48:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:48:27,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:48:27,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:48:27,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:27,689 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 161 [2018-11-18 16:48:27,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:27,896 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 175 [2018-11-18 16:48:27,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:27,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:27,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:27,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:28,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:28,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:28,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:28,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:28,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 16:48:31,864 WARN L180 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 155 DAG size of output: 95 [2018-11-18 16:48:40,821 WARN L180 SmtUtils]: Spent 8.95 s on a formula simplification. DAG size of input: 167 DAG size of output: 52 [2018-11-18 16:48:42,170 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 171 DAG size of output: 54 [2018-11-18 16:48:42,495 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2018-11-18 16:49:54,839 WARN L180 SmtUtils]: Spent 1.21 m on a formula simplification. DAG size of input: 380 DAG size of output: 241 [2018-11-18 16:51:21,243 WARN L180 SmtUtils]: Spent 1.44 m on a formula simplification. DAG size of input: 205 DAG size of output: 114 [2018-11-18 16:51:21,247 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 42) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L421 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= (_ bv0 32) |base2flt_#in~m|)) (and (= (_ bv0 32) base2flt_~__retres4~0) (= base2flt_~m |base2flt_#in~m|))) [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L421 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-11-18 16:51:21,247 INFO L428 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-11-18 16:51:21,247 INFO L425 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L421 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L47-1(lines 47 62) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L421 ceAbstractionStarter]: At program point L47-3(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point mulfltEXIT(lines 137 213) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point mulfltFINAL(lines 137 213) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point mulfltENTRY(lines 137 213) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L148-2(lines 147 212) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L210(lines 147 212) no Hoare annotation was computed. [2018-11-18 16:51:21,248 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:51:21,249 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L421 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-11-18 16:51:21,249 INFO L425 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L421 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse20 (bvult main_~a~0 main_~r_add~0)) (.cse11 (= (_ bv1 32) main_~tmp___2~0)) (.cse7 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse12 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse8 (= (_ bv0 32) main_~zero~0)) (.cse13 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse4 (= main_~tmp___1~0 (_ bv0 32))) (.cse5 (not (bvult main_~r_add~0 main_~a~0))) (.cse6 (= main_~tmp___2~0 (_ bv0 32))) (.cse10 (and .cse20 .cse11 .cse7 .cse12 .cse8 .cse13))) (let ((.cse0 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse15 (or (and .cse4 .cse5 .cse6 .cse7 .cse12 .cse8) .cse10)) (.cse3 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse9 (not (bvult main_~a~0 main_~b~0))) (.cse14 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse9) (and .cse11 .cse7 .cse12 .cse8 .cse13 .cse14))) (and (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse0 .cse1 .cse2 .cse15 .cse3 (exists ((v_addflt_~ma~0_65 (_ BitVec 32))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_65) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32)))))) (and .cse0 .cse1 .cse2 .cse15 .cse3 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse19 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse17 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse18 (bvneg .cse19))) (let ((.cse16 (bvadd .cse17 .cse18))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse16)) (not (= (_ bv0 32) (bvadd .cse17 .cse18 .cse19))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse16) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and .cse4 .cse6 .cse7 .cse8 (= main_~a~0 main_~r_add~0) .cse9) (and (or (and (= main_~b~0 main_~r_add~0) .cse20 .cse12 .cse8) (and .cse12 .cse8 .cse14 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32)))) .cse11 .cse13))))) [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-11-18 16:51:21,250 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-11-18 16:51:21,250 INFO L425 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L421 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse1 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse2 (= (_ bv0 32) main_~zero~0))) (or (and (= main_~b~0 (_ bv0 32)) (= main_~tmp___0~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 .cse2 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv4294967295 32) main_~a~0) .cse0 .cse2) (and .cse2 (and (not (bvugt main_~a~0 (_ bv0 32))) (= (_ bv0 32) main_~sa~0) (= main_~tmp~2 (_ bv0 32)))) (and .cse1 .cse2 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))))) [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L421 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L421 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (= main_~a~0 main_~r_add~0) (and (= main_~b~0 main_~r_add~0) (= (_ bv0 32) main_~zero~0))) [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-11-18 16:51:21,251 INFO L425 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L428 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L421 ceAbstractionStarter]: At program point L282-1(lines 282 291) the Hoare annotation is: (let ((.cse5 (exists ((main_~a~0 (_ BitVec 32))) (and (not (bvult main_~r_add~0 main_~a~0)) (not (bvult main_~a~0 main_~b~0))))) (.cse6 (not (bvult main_~r_add~0 main_~a~0))) (.cse7 (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))) (.cse9 (= (_ bv0 32) main_~zero~0))) (let ((.cse3 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) main_~tmp___4~0)) (.cse10 (and .cse5 (and .cse6 (and .cse7 (or (and .cse9 (= main_~a~0 main_~r_add~0)) (and (= main_~b~0 main_~r_add~0) .cse8 .cse9)))))) (.cse1 (= main_~tmp___3~0 (_ bv0 32))) (.cse2 (= main_~tmp___4~0 (_ bv0 32)))) (or (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 ((.cse0 (and .cse5 (and .cse6 .cse7 .cse8 .cse9)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4)))) (and .cse3 .cse10 .cse4) (and .cse10 .cse1 .cse2)))) [2018-11-18 16:51:21,252 INFO L421 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-11-18 16:51:21,252 INFO L425 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L428 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-11-18 16:51:21,253 INFO L421 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (and (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32))) (.cse3 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|))) (.cse1 (exists ((addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (and (= (bvadd addflt_~eb~0 (_ bv128 32)) (bvlshr addflt_~b (_ bv24 32))) (not (bvult addflt_~a addflt_~b)) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))))) (or (and (= addflt_~b |addflt_#in~b|) (= .cse0 addflt_~mb~0) (not (bvult |addflt_#in~a| |addflt_#in~b|)) .cse1 (= addflt_~a |addflt_#in~a|) (= .cse2 addflt_~eb~0) (= .cse3 addflt_~ma~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)) (and (= .cse0 addflt_~ma~0) (= .cse2 addflt_~ea~0) (= .cse3 addflt_~mb~0) (= addflt_~b |addflt_#in~a|) .cse1 (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (= addflt_~a |addflt_#in~b|) (bvult addflt_~b addflt_~a)))) (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32))) [2018-11-18 16:51:21,253 INFO L425 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-18 16:51:21,254 INFO L421 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse16 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)))) (let ((.cse3 (bvugt |addflt_#in~a| (_ bv0 32))) (.cse1 (= addflt_~__retres10~0 |addflt_#in~a|)) (.cse4 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse0 (= addflt_~a |addflt_#in~a|)) (.cse6 (= addflt_~b |addflt_#in~a|)) (.cse5 (= addflt_~a |addflt_#in~b|)) (.cse14 (= .cse16 addflt_~ma~0)) (.cse2 (= (_ bv0 32) |addflt_#in~b|)) (.cse41 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse40 (not (= (_ bv4294967295 32) |addflt_#in~b|))) (.cse21 (= (_ bv0 32) |addflt_#in~a|))) (and (or (and (not (bvugt addflt_~b (_ bv0 32))) .cse0 .cse1) (not .cse2)) (or .cse3 (bvugt |addflt_#in~b| (_ bv0 32))) (or .cse3 (and (and .cse4 .cse5) .cse6)) (let ((.cse18 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse26 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse9 (= addflt_~b |addflt_#in~b|)) (.cse10 (not (bvult addflt_~a addflt_~b)))) (let ((.cse19 (bvult addflt_~b addflt_~a)) (.cse17 (let ((.cse39 (or (and .cse10 .cse5) (and .cse9 .cse10)))) (or (and .cse39 .cse0) (and .cse39 .cse6)))) (.cse27 (bvadd .cse26 (_ bv4294967168 32))) (.cse12 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse13 (bvneg (bvadd .cse18 (_ bv4294967168 32))))) (let ((.cse8 (= (bvlshr .cse12 (bvadd (bvlshr addflt_~a (_ bv24 32)) .cse13 (_ bv4294967168 32))) addflt_~mb~0)) (.cse11 (= .cse27 addflt_~ea~0)) (.cse7 (let ((.cse29 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse34 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse29) |addflt_#in~a|)))) (or (and .cse17 (let ((.cse28 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse28) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse28) .cse29) |addflt_#in~a|)))) (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))))) (exists ((addflt_~a (_ BitVec 32))) (let ((.cse32 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse33 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse32 (_ bv4294967168 32))))) (let ((.cse31 (bvadd (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)) (bvneg (bvneg .cse33))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse31) (bvshl .cse32 (_ bv24 32)))) (= (bvand (_ bv33554432 32) .cse31) (_ bv0 32)) (bvult |addflt_#in~a| addflt_~a) (not (= .cse33 (_ bv0 32)))))))) .cse34 .cse6 .cse19) (and .cse17 .cse0 .cse34 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse37 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|))))) (let ((.cse36 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse38 (bvneg .cse37))) (let ((.cse35 (bvadd .cse36 .cse38))) (and (= (bvor (bvand (_ bv16777215 32) .cse35) (bvshl (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv24 32))) addflt_~__retres10~0) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse35)) (not (= (_ bv0 32) (bvadd .cse36 .cse37 .cse38))))))))))))) (.cse15 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32))) (.cse20 (bvlshr .cse16 (bvadd (bvneg .cse27) addflt_~ea~0)))) (or (and .cse0 .cse7) (and .cse8 (and (and .cse9 .cse1 .cse10) .cse0) .cse11 (= (_ bv0 32) (bvlshr .cse12 (bvadd (bvlshr addflt_~__retres10~0 (_ bv24 32)) .cse13 (_ bv4294967168 32)))) .cse14) (and .cse15 .cse8 (not (= (_ bv0 32) (bvadd (bvneg .cse16) addflt_~ma~0))) .cse17 .cse11 .cse0 (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~a|))) addflt_~ma~0))) .cse9) (and (= (bvadd .cse18 (_ bv4294967169 32)) addflt_~ea~0) .cse6 (exists ((v_addflt_~ma~0_65 (_ BitVec 32))) (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_65) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))))) (not (= (bvadd .cse18 (_ bv4294967041 32)) (_ bv0 32))) .cse5 .cse19) .cse2 (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))) (= .cse20 addflt_~mb~0) .cse6 .cse4 .cse5 .cse19) .cse21 (and (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))))))) .cse7) (and .cse15 .cse17 (not (= (_ bv0 32) .cse20)) (bvult |addflt_#in~a| addflt_~a) (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)))) (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 (bvult |addflt_#in~a| |addflt_#in~b|)) (not (= (bvadd .cse26 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse26 (_ bv4294967169 32)) addflt_~ea~0) .cse0 .cse9))))) (or .cse40 (exists ((addflt_~a (_ BitVec 32))) (and (not (bvult addflt_~a (_ bv4294967295 32))) (= (bvadd (bvneg (bvlshr (_ bv33554431 32) (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967041 32)))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) .cse41) (or (or .cse14 (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)))) .cse2 .cse41) (or .cse40 (or (and (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)) (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)) (exists ((addflt_~a (_ BitVec 32))) (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))))) .cse21)))) [2018-11-18 16:51:21,254 INFO L425 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-11-18 16:51:21,254 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-11-18 16:51:21,254 INFO L425 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-11-18 16:51:21,254 INFO L425 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-11-18 16:51:21,255 INFO L421 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (and (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32)) (let ((.cse9 (= addflt_~a |addflt_#in~a|)) (.cse2 (= addflt_~b |addflt_#in~a|)) (.cse3 (= addflt_~a |addflt_#in~b|)) (.cse10 (= addflt_~b |addflt_#in~b|))) (let ((.cse1 (let ((.cse13 (let ((.cse15 (not (bvult addflt_~a addflt_~b)))) (or (and .cse15 .cse3) (and .cse10 .cse15))))) (or (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 .cse13 .cse2) (and .cse13 .cse9))) (and (let ((.cse14 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse13 .cse14 .cse9) (and .cse13 .cse14 .cse2))) (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)))))))) (.cse4 (bvult addflt_~b addflt_~a)) (.cse8 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse0 (bvlshr |addflt_#in~b| (_ bv24 32)))) (let ((.cse7 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse6 (bvadd .cse0 (_ bv4294967168 32))) (.cse5 (let ((.cse11 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|))) (.cse12 (bvadd .cse8 (_ bv4294967168 32)))) (or (and (not (= (_ bv0 32) (bvadd (bvneg .cse11) addflt_~ma~0))) (= .cse12 addflt_~ea~0) .cse9 (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~a|))) addflt_~ma~0))) .cse1) (and (not (= (_ bv0 32) (bvlshr .cse11 (bvadd (bvneg .cse12) addflt_~ea~0)))) .cse1 .cse2 (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))) .cse4))))) (or (and (= (bvadd .cse0 (_ bv4294967169 32)) addflt_~ea~0) .cse1 .cse2 (not (= (bvadd .cse0 (_ bv4294967041 32)) (_ bv0 32))) .cse3 .cse4) (and .cse5 (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))) (= .cse6 addflt_~ea~0) (not (= (_ bv0 32) (bvadd (bvneg .cse7) addflt_~ma~0))) .cse3) (and (= (bvlshr .cse7 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse6) (_ bv4294967168 32))) addflt_~mb~0) (or (and (not (= (bvadd .cse8 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse8 (_ bv4294967169 32)) addflt_~ea~0) .cse1) .cse5) .cse9 .cse10)))))) [2018-11-18 16:51:21,270 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,271 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,272 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,273 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,QUANTIFIED] [2018-11-18 16:51:21,274 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,275 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,278 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,279 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,289 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,QUANTIFIED] [2018-11-18 16:51:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,293 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,294 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 16:51:21,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,297 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,298 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:51:21 BoogieIcfgContainer [2018-11-18 16:51:21,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:51:21,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:51:21,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:51:21,302 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:51:21,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:46:46" (3/4) ... [2018-11-18 16:51:21,306 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:51:21,311 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:51:21,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-11-18 16:51:21,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure mulflt [2018-11-18 16:51:21,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:51:21,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-18 16:51:21,312 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-11-18 16:51:21,317 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-18 16:51:21,318 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 16:51:21,318 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:51:21,342 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-11-18 16:51:21,342 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 16:51:21,342 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 16:51:21,342 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-11-18 16:51:21,346 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!~bvugt32(b, 0bv32) && a == \old(a)) && __retres10 == \old(a)) || !(0bv32 == \old(b))) && (~bvugt32(\old(a), 0bv32) || ~bvugt32(\old(b), 0bv32))) && (~bvugt32(\old(a), 0bv32) || ((__retres10 == \old(b) && a == \old(b)) && b == \old(a)))) && ((((((((((a == \old(a) && (((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && b == \old(a)) && ~bvult64(b, a)) || (((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && a == \old(a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))), ~bvshl32(~bvlshr64(\old(a), 24bv32), 24bv32)) == __retres10 && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))) && !(0bv32 == ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))))))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ((b == \old(b) && __retres10 == \old(a)) && !~bvult64(a, b)) && a == \old(a)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && 0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(__retres10, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32))) && ~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))) == ma)) || (((((((~bvadd64(__retres10, 1bv32) == 0bv32 && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb) && !(0bv32 == ~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ma))) && ((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == ~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ma))) && b == \old(b))) || (((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && b == \old(a)) && (\exists v_addflt_~ma~0_65 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_65), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b)) && ~bvult64(b, a))) || 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))) || 0bv32 == \old(a)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)))) && (((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && b == \old(a)) && ~bvult64(b, a)) || (((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && a == \old(a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))), ~bvshl32(~bvlshr64(\old(a), 24bv32), 24bv32)) == __retres10 && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))) && !(0bv32 == ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))))))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && ((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), 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))) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)))) && ((!(4294967295bv32 == \old(b)) || (\exists addflt_~a : bv32 :: !~bvult64(addflt_~a, 4294967295bv32) && ~bvadd64(~bvneg32(~bvlshr64(33554431bv32, ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967041bv32))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (((~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))) == ma || (\exists addflt_~b : bv32, addflt_~a : bv32 :: (~bvadd64(eb, 128bv32) == ~bvlshr64(addflt_~b, 24bv32) && !~bvult64(addflt_~a, addflt_~b)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea)) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && ((!(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) && (\exists addflt_~a : bv32 :: ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) || 0bv32 == \old(a)) [2018-11-18 16:51:21,371 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_17526c98-f6c8-473e-81f1-6dfcaee5f221/bin-2019/uautomizer/witness.graphml [2018-11-18 16:51:21,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:51:21,372 INFO L168 Benchmark]: Toolchain (without parser) took 275711.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 949.7 MB in the beginning and 909.3 MB in the end (delta: 40.4 MB). Peak memory consumption was 320.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,372 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:51:21,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,373 INFO L168 Benchmark]: Boogie Preprocessor took 84.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 933.6 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,373 INFO L168 Benchmark]: RCFGBuilder took 413.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,373 INFO L168 Benchmark]: TraceAbstraction took 274890.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 917.9 MB in the end (delta: 201.9 MB). Peak memory consumption was 422.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,373 INFO L168 Benchmark]: Witness Printer took 69.09 ms. Allocated memory is still 1.3 GB. Free memory was 917.9 MB in the beginning and 909.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:51:21,375 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.38 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 933.6 MB in the beginning and 1.2 GB in the end (delta: -231.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 413.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 274890.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 917.9 MB in the end (delta: 201.9 MB). Peak memory consumption was 422.1 MB. Max. memory is 11.5 GB. * Witness Printer took 69.09 ms. Allocated memory is still 1.3 GB. Free memory was 917.9 MB in the beginning and 909.3 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~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_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,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_~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_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~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_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,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_~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_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~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 Derived loop invariant: a == r_add || (b == r_add && 0bv32 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-11-18 16:51:21,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,381 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,382 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,385 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,386 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,387 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,388 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,389 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,390 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,391 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_65,QUANTIFIED] [2018-11-18 16:51:21,392 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,393 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,394 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,395 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,396 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,397 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-11-18 16:51:21,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-11-18 16:51:21,398 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((((((!~bvugt32(b, 0bv32) && a == \old(a)) && __retres10 == \old(a)) || !(0bv32 == \old(b))) && (~bvugt32(\old(a), 0bv32) || ~bvugt32(\old(b), 0bv32))) && (~bvugt32(\old(a), 0bv32) || ((__retres10 == \old(b) && a == \old(b)) && b == \old(a)))) && ((((((((((a == \old(a) && (((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && b == \old(a)) && ~bvult64(b, a)) || (((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && a == \old(a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))), ~bvshl32(~bvlshr64(\old(a), 24bv32), 24bv32)) == __retres10 && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))) && !(0bv32 == ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))))))) || ((((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && ((b == \old(b) && __retres10 == \old(a)) && !~bvult64(a, b)) && a == \old(a)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && 0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(__retres10, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32))) && ~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))) == ma)) || (((((((~bvadd64(__retres10, 1bv32) == 0bv32 && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb) && !(0bv32 == ~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ma))) && ((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea) && a == \old(a)) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == ~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ma))) && b == \old(b))) || (((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && b == \old(a)) && (\exists v_addflt_~ma~0_65 : bv32 :: __retres10 == ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_65), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b)) && ~bvult64(b, a))) || 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))) || 0bv32 == \old(a)) || ((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)))) && (((((((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && (\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvand64(33554432bv32, ~bvadd64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)), ~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))))) == 0bv32) && ~bvult64(\old(a), addflt_~a)) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && b == \old(a)) && ~bvult64(b, a)) || (((((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a))) && a == \old(a)) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))))))), ~bvshl32(~bvlshr64(\old(a), 24bv32), 24bv32)) == __retres10 && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))) && !(0bv32 == ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a)))))))))))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && ((((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && a == \old(a)) || (((!~bvult64(a, b) && a == \old(b)) || (b == \old(b) && !~bvult64(a, b))) && b == \old(a)))) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), 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))) || ((((((\exists addflt_~ma~0 : bv32 :: __retres10 == ~bvor32(addflt_~ma~0, ~bvshl32(~bvadd64(~bvlshr64(\old(a), 24bv32), 1bv32), 24bv32))) && !~bvult64(\old(a), \old(b))) && !(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967041bv32) == 0bv32)) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967169bv32) == ea) && a == \old(a)) && b == \old(b)))) && ((!(4294967295bv32 == \old(b)) || (\exists addflt_~a : bv32 :: !~bvult64(addflt_~a, 4294967295bv32) && ~bvadd64(~bvneg32(~bvlshr64(33554431bv32, ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967041bv32))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && (((~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))) == ma || (\exists addflt_~b : bv32, addflt_~a : bv32 :: (~bvadd64(eb, 128bv32) == ~bvlshr64(addflt_~b, 24bv32) && !~bvult64(addflt_~a, addflt_~b)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea)) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32))) && ((!(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) && (\exists addflt_~a : bv32 :: ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) || 0bv32 == \old(a)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 93 locations, 1 error locations. SAFE Result, 274.7s OverallTime, 44 OverallIterations, 4 TraceHistogramMax, 76.3s AutomataDifference, 0.0s DeadEndRemovalTime, 173.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 4924 SDtfs, 2384 SDslu, 28541 SDs, 0 SdLazy, 7255 SolverSat, 380 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3351 GetRequests, 2875 SyntacticMatches, 12 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 44 MinimizatonAttempts, 2097 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 577 PreInvPairs, 692 NumberOfFragments, 3283 HoareAnnotationTreeSize, 577 FomulaSimplifications, 168435612 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 310827 FormulaSimplificationTreeSizeReductionInter, 172.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 2784 NumberOfCodeBlocks, 2765 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3117 ConstructedInterpolants, 115 QuantifiedInterpolants, 597853 SizeOfPredicates, 240 NumberOfNonLiveVariables, 4690 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 54 InterpolantComputations, 35 PerfectInterpolantSequences, 1050/1137 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...