./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-635dfa2 [2018-12-09 00:17:37,973 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:17:37,974 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:17:37,980 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:17:37,980 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:17:37,981 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:17:37,981 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:17:37,982 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:17:37,983 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:17:37,984 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:17:37,984 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:17:37,984 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:17:37,985 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:17:37,985 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:17:37,986 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:17:37,986 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:17:37,986 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:17:37,987 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:17:37,988 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:17:37,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:17:37,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:17:37,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:17:37,991 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:17:37,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:17:37,992 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:17:37,992 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:17:37,993 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:17:37,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:17:37,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:17:37,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:17:37,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:17:37,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:17:37,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:17:37,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:17:37,996 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:17:37,996 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:17:37,996 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 00:17:38,003 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:17:38,003 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:17:38,004 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:17:38,004 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:17:38,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:17:38,005 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:17:38,005 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:17:38,006 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:17:38,006 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:17:38,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 00:17:38,007 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:17:38,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:17:38,008 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_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:38,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:17:38,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:17:38,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:17:38,038 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:17:38,038 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:17:38,039 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:38,079 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/e17c72522/313546c9df714d7d9968edf5dac799e6/FLAGdcbcdc4a5 [2018-12-09 00:17:38,533 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:17:38,534 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:38,538 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/e17c72522/313546c9df714d7d9968edf5dac799e6/FLAGdcbcdc4a5 [2018-12-09 00:17:38,546 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/e17c72522/313546c9df714d7d9968edf5dac799e6 [2018-12-09 00:17:38,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:17:38,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:17:38,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:17:38,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:17:38,551 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:17:38,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56157e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38, skipping insertion in model container [2018-12-09 00:17:38,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:17:38,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:17:38,675 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:17:38,677 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:17:38,702 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:17:38,709 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:17:38,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38 WrapperNode [2018-12-09 00:17:38,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:17:38,710 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:17:38,710 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:17:38,710 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:17:38,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:17:38,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:17:38,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:17:38,757 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:17:38,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... [2018-12-09 00:17:38,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:17:38,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:17:38,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:17:38,779 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:17:38,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:17:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-09 00:17:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:17:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:17:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-09 00:17:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:17:38,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:17:39,004 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:17:39,004 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:17:39,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:39 BoogieIcfgContainer [2018-12-09 00:17:39,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:17:39,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:17:39,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:17:39,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:17:39,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:17:38" (1/3) ... [2018-12-09 00:17:39,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695780c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:17:39, skipping insertion in model container [2018-12-09 00:17:39,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:38" (2/3) ... [2018-12-09 00:17:39,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695780c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:17:39, skipping insertion in model container [2018-12-09 00:17:39,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:39" (3/3) ... [2018-12-09 00:17:39,009 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:39,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:17:39,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:17:39,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:17:39,047 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:17:39,048 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:17:39,048 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:17:39,048 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:17:39,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:17:39,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:17:39,048 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:17:39,048 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:17:39,048 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:17:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-09 00:17:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:17:39,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:39,064 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:39,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:39,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-09 00:17:39,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:39,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:39,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:39,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:39,250 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:39,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:39,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:17:39,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:39,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 13 [2018-12-09 00:17:39,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:17:39,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:17:39,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:17:39,392 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 13 states. [2018-12-09 00:17:39,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:39,773 INFO L93 Difference]: Finished difference Result 220 states and 359 transitions. [2018-12-09 00:17:39,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 00:17:39,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-12-09 00:17:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:39,783 INFO L225 Difference]: With dead ends: 220 [2018-12-09 00:17:39,783 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 00:17:39,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:17:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 00:17:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-12-09 00:17:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-09 00:17:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2018-12-09 00:17:39,823 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 36 [2018-12-09 00:17:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:39,823 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2018-12-09 00:17:39,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:17:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2018-12-09 00:17:39,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:17:39,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:39,825 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:39,825 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:39,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1206867801, now seen corresponding path program 1 times [2018-12-09 00:17:39,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:39,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:39,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:39,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:39,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:39,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:39,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:17:39,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:17:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:17:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:39,948 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand 8 states. [2018-12-09 00:17:40,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:40,029 INFO L93 Difference]: Finished difference Result 255 states and 375 transitions. [2018-12-09 00:17:40,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:17:40,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-12-09 00:17:40,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:40,031 INFO L225 Difference]: With dead ends: 255 [2018-12-09 00:17:40,031 INFO L226 Difference]: Without dead ends: 182 [2018-12-09 00:17:40,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:17:40,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-09 00:17:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-12-09 00:17:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-09 00:17:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 249 transitions. [2018-12-09 00:17:40,045 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 249 transitions. Word has length 40 [2018-12-09 00:17:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:40,045 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 249 transitions. [2018-12-09 00:17:40,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:17:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 249 transitions. [2018-12-09 00:17:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:17:40,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:40,047 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:40,047 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:40,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash -985162678, now seen corresponding path program 1 times [2018-12-09 00:17:40,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:40,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:40,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 00:17:40,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:40,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:40,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:40,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:17:40,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:40,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2018-12-09 00:17:40,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 00:17:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 00:17:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:17:40,370 INFO L87 Difference]: Start difference. First operand 178 states and 249 transitions. Second operand 19 states. [2018-12-09 00:17:40,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:40,858 INFO L93 Difference]: Finished difference Result 344 states and 501 transitions. [2018-12-09 00:17:40,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 00:17:40,858 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-12-09 00:17:40,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:40,859 INFO L225 Difference]: With dead ends: 344 [2018-12-09 00:17:40,859 INFO L226 Difference]: Without dead ends: 271 [2018-12-09 00:17:40,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:17:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-09 00:17:40,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 236. [2018-12-09 00:17:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-09 00:17:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 330 transitions. [2018-12-09 00:17:40,873 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 330 transitions. Word has length 44 [2018-12-09 00:17:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:40,873 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 330 transitions. [2018-12-09 00:17:40,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 00:17:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 330 transitions. [2018-12-09 00:17:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:17:40,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:40,874 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:40,874 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:40,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1720292238, now seen corresponding path program 1 times [2018-12-09 00:17:40,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:40,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:40,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:40,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:40,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:40,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:40,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 00:17:41,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:41,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-12-09 00:17:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:17:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:17:41,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:17:41,073 INFO L87 Difference]: Start difference. First operand 236 states and 330 transitions. Second operand 17 states. [2018-12-09 00:17:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:41,490 INFO L93 Difference]: Finished difference Result 388 states and 561 transitions. [2018-12-09 00:17:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 00:17:41,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-09 00:17:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:41,492 INFO L225 Difference]: With dead ends: 388 [2018-12-09 00:17:41,492 INFO L226 Difference]: Without dead ends: 324 [2018-12-09 00:17:41,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-12-09 00:17:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-09 00:17:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 228. [2018-12-09 00:17:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-12-09 00:17:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 316 transitions. [2018-12-09 00:17:41,503 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 316 transitions. Word has length 44 [2018-12-09 00:17:41,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:41,503 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 316 transitions. [2018-12-09 00:17:41,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:17:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 316 transitions. [2018-12-09 00:17:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:41,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:41,505 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:41,505 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:41,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:41,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1063865541, now seen corresponding path program 1 times [2018-12-09 00:17:41,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:41,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:41,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:41,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:17:41,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:41,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 00:17:41,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:17:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:17:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:17:41,663 INFO L87 Difference]: Start difference. First operand 228 states and 316 transitions. Second operand 14 states. [2018-12-09 00:17:41,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:41,928 INFO L93 Difference]: Finished difference Result 399 states and 578 transitions. [2018-12-09 00:17:41,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:17:41,928 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-12-09 00:17:41,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:41,930 INFO L225 Difference]: With dead ends: 399 [2018-12-09 00:17:41,930 INFO L226 Difference]: Without dead ends: 333 [2018-12-09 00:17:41,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:17:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-12-09 00:17:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 316. [2018-12-09 00:17:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-09 00:17:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 443 transitions. [2018-12-09 00:17:41,950 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 443 transitions. Word has length 48 [2018-12-09 00:17:41,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:41,950 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 443 transitions. [2018-12-09 00:17:41,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:17:41,951 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 443 transitions. [2018-12-09 00:17:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:41,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:41,953 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:41,953 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:41,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1641589375, now seen corresponding path program 1 times [2018-12-09 00:17:41,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:41,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:41,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:41,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:42,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:42,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:17:42,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:42,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:42,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:42,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 00:17:42,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:17:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:17:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:42,100 INFO L87 Difference]: Start difference. First operand 316 states and 443 transitions. Second operand 8 states. [2018-12-09 00:17:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:42,191 INFO L93 Difference]: Finished difference Result 388 states and 545 transitions. [2018-12-09 00:17:42,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:17:42,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-12-09 00:17:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:42,193 INFO L225 Difference]: With dead ends: 388 [2018-12-09 00:17:42,193 INFO L226 Difference]: Without dead ends: 349 [2018-12-09 00:17:42,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:17:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-09 00:17:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 335. [2018-12-09 00:17:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-09 00:17:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 466 transitions. [2018-12-09 00:17:42,209 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 466 transitions. Word has length 48 [2018-12-09 00:17:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:42,209 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 466 transitions. [2018-12-09 00:17:42,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:17:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 466 transitions. [2018-12-09 00:17:42,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:42,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:42,210 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:42,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:42,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-09 00:17:42,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 00:17:42,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 00:17:42,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:42,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:17:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:17:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:17:42,240 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:17:42,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:17:42 BoogieIcfgContainer [2018-12-09 00:17:42,261 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:17:42,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:17:42,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:17:42,261 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:17:42,262 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:39" (3/4) ... [2018-12-09 00:17:42,264 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 00:17:42,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:17:42,264 INFO L168 Benchmark]: Toolchain (without parser) took 3716.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.0 MB). Free memory was 962.4 MB in the beginning and 1.3 GB in the end (delta: -304.8 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:17:42,265 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:17:42,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.40 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:17:42,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:17:42,266 INFO L168 Benchmark]: Boogie Preprocessor took 21.68 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-12-09 00:17:42,266 INFO L168 Benchmark]: RCFGBuilder took 225.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:17:42,266 INFO L168 Benchmark]: TraceAbstraction took 3256.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -148.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:17:42,267 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:17:42,268 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.40 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 946.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -196.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.68 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. * RCFGBuilder took 225.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3256.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 162.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -148.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 7]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 100, overapproximation of bitwiseAnd at line 98. Possible FailurePath: [L215] unsigned int a ; [L216] unsigned int ma = __VERIFIER_nondet_uint(); [L217] signed char ea = __VERIFIER_nondet_char(); [L218] unsigned int b ; [L219] unsigned int mb = __VERIFIER_nondet_uint(); [L220] signed char eb = __VERIFIER_nondet_char(); [L221] unsigned int r_add ; [L222] unsigned int zero ; [L223] int sa ; [L224] int sb ; [L225] int tmp ; [L226] int tmp___0 ; [L227] int tmp___1 ; [L228] int tmp___2 ; [L229] int tmp___3 ; [L230] int tmp___4 ; [L231] int tmp___5 ; [L232] int tmp___6 ; [L233] int tmp___7 ; [L234] int tmp___8 ; [L235] int tmp___9 ; [L236] int __retres23 ; VAL [ea=127, eb=0, ma=33554432, mb=16777216] [L240] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L19] COND TRUE ! m [L20] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L240] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=127, eb=0, ma=33554432, mb=16777216] [L240] zero = base2flt(0, 0) [L241] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L19] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L47] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L49] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L54] COND TRUE e >= 127 [L55] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, e=127, m=33554432] [L70] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, __retres4=4294967295, e=127, m=33554432] [L241] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=4294967295, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L241] a = base2flt(ma, ea) [L242] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=16777216] [L15] unsigned int res ; [L16] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L19] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L25] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L47] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L49] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L66] m = m & ~ (1U << 24U) [L67] res = m | (unsigned int )((e + 128) << 24U) [L68] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=16777215, e=0, res=16777215] [L70] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-72057589726183425, __retres4=16777215, e=0, res=16777215] [L242] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, base2flt(mb, eb)=-72057589726183425, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L242] b = base2flt(mb, eb) [L244] COND FALSE !(a < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, zero=0] [L247] COND TRUE a > zero [L248] tmp = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, tmp=1, zero=0] [L252] sa = tmp VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L254] COND FALSE !(b < zero) VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, zero=0] [L257] COND TRUE b > zero [L258] tmp___0 = 1 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, tmp=1, tmp___0=1, zero=0] [L262] sb = tmp___0 VAL [a=4294967295, b=16777215, ea=127, eb=0, ma=33554432, mb=16777216, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L265] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777215] [L74] unsigned int res ; [L75] unsigned int ma ; [L76] unsigned int mb ; [L77] unsigned int delta ; [L78] int ea ; [L79] int eb ; [L80] unsigned int tmp ; [L81] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L84] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215] [L91] COND FALSE !(! b) [L98] ma = a & ((1U << 24U) - 1U) [L99] ea = (int )(a >> 24U) - 128 [L100] ma = ma | (1U << 24U) [L101] mb = b & ((1U << 24U) - 1U) [L102] eb = (int )(b >> 24U) - 128 [L103] mb = mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777215, a=4294967295, b=16777215, ea=127, eb=128] [L104] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. UNSAFE Result, 3.2s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 729 SDtfs, 822 SDslu, 6584 SDs, 0 SdLazy, 2627 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 154 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 189 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 61789 SizeOfPredicates, 17 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 115/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:17:43,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:17:43,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:17:43,637 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:17:43,638 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:17:43,638 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:17:43,639 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:17:43,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:17:43,641 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:17:43,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:17:43,643 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:17:43,643 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:17:43,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:17:43,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:17:43,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:17:43,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:17:43,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:17:43,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:17:43,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:17:43,649 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:17:43,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:17:43,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:17:43,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:17:43,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:17:43,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:17:43,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:17:43,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:17:43,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:17:43,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:17:43,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:17:43,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:17:43,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:17:43,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:17:43,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:17:43,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:17:43,655 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:17:43,656 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-09 00:17:43,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:17:43,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:17:43,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:17:43,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 00:17:43,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:17:43,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:17:43,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:17:43,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:17:43,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 00:17:43,666 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 00:17:43,666 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_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:43,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:17:43,692 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:17:43,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:17:43,695 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:17:43,695 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:17:43,696 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:43,733 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/1645d604f/66a150fbf53f48d38fd8f8097ca62959/FLAG028dafa44 [2018-12-09 00:17:44,181 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:17:44,181 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/sv-benchmarks/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:44,185 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/1645d604f/66a150fbf53f48d38fd8f8097ca62959/FLAG028dafa44 [2018-12-09 00:17:44,194 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/data/1645d604f/66a150fbf53f48d38fd8f8097ca62959 [2018-12-09 00:17:44,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:17:44,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:17:44,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:17:44,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:17:44,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:17:44,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3832628d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44, skipping insertion in model container [2018-12-09 00:17:44,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:17:44,231 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:17:44,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:17:44,365 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:17:44,392 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:17:44,400 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:17:44,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44 WrapperNode [2018-12-09 00:17:44,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:17:44,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:17:44,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:17:44,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:17:44,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:17:44,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:17:44,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:17:44,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:17:44,423 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... [2018-12-09 00:17:44,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:17:44,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:17:44,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:17:44,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:17:44,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:17:44,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:17:44,498 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2018-12-09 00:17:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2018-12-09 00:17:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:17:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:17:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:17:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:17:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2018-12-09 00:17:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2018-12-09 00:17:44,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 00:17:44,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 00:17:44,721 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:17:44,721 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 00:17:44,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:44 BoogieIcfgContainer [2018-12-09 00:17:44,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:17:44,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:17:44,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:17:44,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:17:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:17:44" (1/3) ... [2018-12-09 00:17:44,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:17:44, skipping insertion in model container [2018-12-09 00:17:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:17:44" (2/3) ... [2018-12-09 00:17:44,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59abe99e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:17:44, skipping insertion in model container [2018-12-09 00:17:44,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:44" (3/3) ... [2018-12-09 00:17:44,725 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2018-12-09 00:17:44,731 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:17:44,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:17:44,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:17:44,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:17:44,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:17:44,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:17:44,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:17:44,762 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:17:44,762 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:17:44,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:17:44,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:17:44,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:17:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-12-09 00:17:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:17:44,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:44,776 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:44,777 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:44,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash -441638981, now seen corresponding path program 1 times [2018-12-09 00:17:44,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:44,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:44,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:44,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:44,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:44,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 00:17:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:17:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:17:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:17:44,957 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 9 states. [2018-12-09 00:17:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:45,163 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2018-12-09 00:17:45,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:17:45,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-09 00:17:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:45,174 INFO L225 Difference]: With dead ends: 199 [2018-12-09 00:17:45,174 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 00:17:45,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:17:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 00:17:45,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2018-12-09 00:17:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 00:17:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2018-12-09 00:17:45,210 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 36 [2018-12-09 00:17:45,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:45,211 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2018-12-09 00:17:45,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:17:45,211 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2018-12-09 00:17:45,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:17:45,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:45,213 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:45,214 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:45,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:45,214 INFO L82 PathProgramCache]: Analyzing trace with hash 306755114, now seen corresponding path program 1 times [2018-12-09 00:17:45,215 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:45,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:45,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 00:17:45,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:17:45,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:17:45,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:45,336 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand 6 states. [2018-12-09 00:17:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:45,405 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2018-12-09 00:17:45,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:17:45,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-09 00:17:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:45,407 INFO L225 Difference]: With dead ends: 185 [2018-12-09 00:17:45,408 INFO L226 Difference]: Without dead ends: 140 [2018-12-09 00:17:45,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:17:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-09 00:17:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2018-12-09 00:17:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-09 00:17:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2018-12-09 00:17:45,420 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 40 [2018-12-09 00:17:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:45,420 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2018-12-09 00:17:45,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:17:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2018-12-09 00:17:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 00:17:45,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:45,421 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:45,421 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:45,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash -842119066, now seen corresponding path program 1 times [2018-12-09 00:17:45,422 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:45,422 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:45,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:45,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 00:17:45,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:17:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:17:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:45,512 INFO L87 Difference]: Start difference. First operand 133 states and 201 transitions. Second operand 6 states. [2018-12-09 00:17:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:45,562 INFO L93 Difference]: Finished difference Result 301 states and 470 transitions. [2018-12-09 00:17:45,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:17:45,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-09 00:17:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:45,564 INFO L225 Difference]: With dead ends: 301 [2018-12-09 00:17:45,564 INFO L226 Difference]: Without dead ends: 216 [2018-12-09 00:17:45,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:17:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-09 00:17:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 156. [2018-12-09 00:17:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-09 00:17:45,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-12-09 00:17:45,576 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 40 [2018-12-09 00:17:45,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:45,577 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-12-09 00:17:45,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:17:45,577 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-12-09 00:17:45,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:17:45,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:45,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:45,579 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:45,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:45,579 INFO L82 PathProgramCache]: Analyzing trace with hash 377249800, now seen corresponding path program 1 times [2018-12-09 00:17:45,579 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:45,579 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:45,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:45,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 00:17:45,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:17:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:17:45,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:45,711 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 8 states. [2018-12-09 00:17:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:45,821 INFO L93 Difference]: Finished difference Result 215 states and 325 transitions. [2018-12-09 00:17:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:17:45,821 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-09 00:17:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:45,822 INFO L225 Difference]: With dead ends: 215 [2018-12-09 00:17:45,822 INFO L226 Difference]: Without dead ends: 176 [2018-12-09 00:17:45,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:17:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-09 00:17:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2018-12-09 00:17:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-09 00:17:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2018-12-09 00:17:45,832 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 44 [2018-12-09 00:17:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:45,832 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2018-12-09 00:17:45,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:17:45,833 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2018-12-09 00:17:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:17:45,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:45,834 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:45,834 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:45,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:45,834 INFO L82 PathProgramCache]: Analyzing trace with hash 434508102, now seen corresponding path program 1 times [2018-12-09 00:17:45,834 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:45,834 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:45,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:45,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:17:45,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:45,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:45,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:17:45,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:17:45,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:17:45,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:45,905 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand 8 states. [2018-12-09 00:17:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:46,000 INFO L93 Difference]: Finished difference Result 378 states and 561 transitions. [2018-12-09 00:17:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:17:46,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-12-09 00:17:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:46,003 INFO L225 Difference]: With dead ends: 378 [2018-12-09 00:17:46,003 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 00:17:46,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:17:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 00:17:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2018-12-09 00:17:46,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-09 00:17:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2018-12-09 00:17:46,019 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 44 [2018-12-09 00:17:46,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:46,019 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2018-12-09 00:17:46,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:17:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2018-12-09 00:17:46,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:46,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:46,021 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:46,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:46,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1399634249, now seen corresponding path program 2 times [2018-12-09 00:17:46,022 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:46,022 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:46,035 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:17:46,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:17:46,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:17:46,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:17:46,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:46,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:46,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:17:46,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:17:46,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:17:46,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:17:46,092 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand 7 states. [2018-12-09 00:17:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:46,230 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2018-12-09 00:17:46,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:17:46,230 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-12-09 00:17:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:46,232 INFO L225 Difference]: With dead ends: 524 [2018-12-09 00:17:46,232 INFO L226 Difference]: Without dead ends: 430 [2018-12-09 00:17:46,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-12-09 00:17:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 355. [2018-12-09 00:17:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-09 00:17:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 514 transitions. [2018-12-09 00:17:46,251 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 514 transitions. Word has length 48 [2018-12-09 00:17:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:46,251 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 514 transitions. [2018-12-09 00:17:46,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:17:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 514 transitions. [2018-12-09 00:17:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:46,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:46,252 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:46,253 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:46,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1006607239, now seen corresponding path program 1 times [2018-12-09 00:17:46,253 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:46,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:17:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:17:46,386 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:46,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:46,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 00:17:46,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:17:46,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:17:46,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:17:46,389 INFO L87 Difference]: Start difference. First operand 355 states and 514 transitions. Second operand 13 states. [2018-12-09 00:17:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:46,701 INFO L93 Difference]: Finished difference Result 422 states and 605 transitions. [2018-12-09 00:17:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 00:17:46,702 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-12-09 00:17:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:46,704 INFO L225 Difference]: With dead ends: 422 [2018-12-09 00:17:46,704 INFO L226 Difference]: Without dead ends: 389 [2018-12-09 00:17:46,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:17:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-12-09 00:17:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 372. [2018-12-09 00:17:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-09 00:17:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 533 transitions. [2018-12-09 00:17:46,723 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 533 transitions. Word has length 48 [2018-12-09 00:17:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:46,724 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 533 transitions. [2018-12-09 00:17:46,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:17:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 533 transitions. [2018-12-09 00:17:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:46,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:46,725 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:46,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:46,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1305820667, now seen corresponding path program 1 times [2018-12-09 00:17:46,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:46,726 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:46,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:46,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:46,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:46,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:46,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:46,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-09 00:17:46,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:17:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:17:46,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:17:46,837 INFO L87 Difference]: Start difference. First operand 372 states and 533 transitions. Second operand 9 states. [2018-12-09 00:17:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:46,982 INFO L93 Difference]: Finished difference Result 847 states and 1242 transitions. [2018-12-09 00:17:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:17:46,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-12-09 00:17:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:46,984 INFO L225 Difference]: With dead ends: 847 [2018-12-09 00:17:46,985 INFO L226 Difference]: Without dead ends: 698 [2018-12-09 00:17:46,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:17:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-09 00:17:47,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 438. [2018-12-09 00:17:47,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-12-09 00:17:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 624 transitions. [2018-12-09 00:17:47,009 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 624 transitions. Word has length 48 [2018-12-09 00:17:47,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:47,010 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 624 transitions. [2018-12-09 00:17:47,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:17:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 624 transitions. [2018-12-09 00:17:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:47,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:47,011 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:47,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:47,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1698847677, now seen corresponding path program 1 times [2018-12-09 00:17:47,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:47,012 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:47,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:47,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:47,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:47,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:47,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:17:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:47,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:47,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:47,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:47,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 00:17:47,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:17:47,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:17:47,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:17:47,329 INFO L87 Difference]: Start difference. First operand 438 states and 624 transitions. Second operand 11 states. [2018-12-09 00:17:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:47,593 INFO L93 Difference]: Finished difference Result 492 states and 698 transitions. [2018-12-09 00:17:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:17:47,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-12-09 00:17:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:47,596 INFO L225 Difference]: With dead ends: 492 [2018-12-09 00:17:47,596 INFO L226 Difference]: Without dead ends: 459 [2018-12-09 00:17:47,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-12-09 00:17:47,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-09 00:17:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 442. [2018-12-09 00:17:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-09 00:17:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 626 transitions. [2018-12-09 00:17:47,618 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 626 transitions. Word has length 48 [2018-12-09 00:17:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:47,619 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 626 transitions. [2018-12-09 00:17:47,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:17:47,619 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 626 transitions. [2018-12-09 00:17:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:47,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:47,620 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:47,620 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:47,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:47,621 INFO L82 PathProgramCache]: Analyzing trace with hash -294368905, now seen corresponding path program 1 times [2018-12-09 00:17:47,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:47,621 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:47,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:47,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:47,777 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:47,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:47,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 00:17:47,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:17:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:17:47,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:17:47,780 INFO L87 Difference]: Start difference. First operand 442 states and 626 transitions. Second operand 12 states. [2018-12-09 00:17:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:48,122 INFO L93 Difference]: Finished difference Result 545 states and 760 transitions. [2018-12-09 00:17:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 00:17:48,122 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-09 00:17:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:48,123 INFO L225 Difference]: With dead ends: 545 [2018-12-09 00:17:48,123 INFO L226 Difference]: Without dead ends: 446 [2018-12-09 00:17:48,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:17:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-09 00:17:48,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 411. [2018-12-09 00:17:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-09 00:17:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 578 transitions. [2018-12-09 00:17:48,147 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 578 transitions. Word has length 48 [2018-12-09 00:17:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:48,147 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 578 transitions. [2018-12-09 00:17:48,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:17:48,148 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 578 transitions. [2018-12-09 00:17:48,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:48,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:48,149 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:48,149 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:48,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:48,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1883881285, now seen corresponding path program 1 times [2018-12-09 00:17:48,150 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:48,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:48,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:48,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:17:48,260 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:48,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:48,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:17:48,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:17:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:17:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:48,263 INFO L87 Difference]: Start difference. First operand 411 states and 578 transitions. Second operand 6 states. [2018-12-09 00:17:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:49,193 INFO L93 Difference]: Finished difference Result 452 states and 627 transitions. [2018-12-09 00:17:49,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:17:49,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-09 00:17:49,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:49,195 INFO L225 Difference]: With dead ends: 452 [2018-12-09 00:17:49,195 INFO L226 Difference]: Without dead ends: 450 [2018-12-09 00:17:49,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-12-09 00:17:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 417. [2018-12-09 00:17:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-09 00:17:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 585 transitions. [2018-12-09 00:17:49,214 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 585 transitions. Word has length 48 [2018-12-09 00:17:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:49,215 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 585 transitions. [2018-12-09 00:17:49,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:17:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 585 transitions. [2018-12-09 00:17:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 00:17:49,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:49,216 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:49,216 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:49,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:49,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1826622983, now seen corresponding path program 1 times [2018-12-09 00:17:49,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:49,216 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:49,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:49,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:17:49,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:49,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:49,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:17:49,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:17:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:17:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:49,326 INFO L87 Difference]: Start difference. First operand 417 states and 585 transitions. Second operand 6 states. [2018-12-09 00:17:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:51,878 INFO L93 Difference]: Finished difference Result 434 states and 602 transitions. [2018-12-09 00:17:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:17:51,878 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-12-09 00:17:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:51,879 INFO L225 Difference]: With dead ends: 434 [2018-12-09 00:17:51,879 INFO L226 Difference]: Without dead ends: 432 [2018-12-09 00:17:51,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:17:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-12-09 00:17:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 415. [2018-12-09 00:17:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-09 00:17:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 581 transitions. [2018-12-09 00:17:51,892 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 581 transitions. Word has length 48 [2018-12-09 00:17:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:51,892 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 581 transitions. [2018-12-09 00:17:51,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:17:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 581 transitions. [2018-12-09 00:17:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:17:51,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:51,893 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:51,894 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:51,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:51,894 INFO L82 PathProgramCache]: Analyzing trace with hash 609641055, now seen corresponding path program 1 times [2018-12-09 00:17:51,894 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:51,894 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:51,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:51,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:51,957 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:17:51,957 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:51,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:51,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:17:51,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:17:51,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:17:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:17:51,959 INFO L87 Difference]: Start difference. First operand 415 states and 581 transitions. Second operand 7 states. [2018-12-09 00:17:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,105 INFO L93 Difference]: Finished difference Result 632 states and 910 transitions. [2018-12-09 00:17:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:17:52,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-09 00:17:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,107 INFO L225 Difference]: With dead ends: 632 [2018-12-09 00:17:52,107 INFO L226 Difference]: Without dead ends: 537 [2018-12-09 00:17:52,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:17:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-12-09 00:17:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 407. [2018-12-09 00:17:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-09 00:17:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 568 transitions. [2018-12-09 00:17:52,122 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 568 transitions. Word has length 49 [2018-12-09 00:17:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,122 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 568 transitions. [2018-12-09 00:17:52,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:17:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 568 transitions. [2018-12-09 00:17:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:17:52,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,123 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,123 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 666899357, now seen corresponding path program 1 times [2018-12-09 00:17:52,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:17:52,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:52,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:17:52,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:17:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:17:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:17:52,188 INFO L87 Difference]: Start difference. First operand 407 states and 568 transitions. Second operand 4 states. [2018-12-09 00:17:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,222 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2018-12-09 00:17:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:17:52,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 00:17:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,224 INFO L225 Difference]: With dead ends: 666 [2018-12-09 00:17:52,224 INFO L226 Difference]: Without dead ends: 533 [2018-12-09 00:17:52,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:17:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-09 00:17:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 477. [2018-12-09 00:17:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-12-09 00:17:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2018-12-09 00:17:52,240 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 49 [2018-12-09 00:17:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,241 INFO L480 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2018-12-09 00:17:52,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:17:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2018-12-09 00:17:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 00:17:52,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,241 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,242 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash -855742356, now seen corresponding path program 1 times [2018-12-09 00:17:52,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,242 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 00:17:52,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:52,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:52,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:17:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:17:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:17:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:17:52,284 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand 4 states. [2018-12-09 00:17:52,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,354 INFO L93 Difference]: Finished difference Result 865 states and 1185 transitions. [2018-12-09 00:17:52,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:17:52,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 00:17:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,356 INFO L225 Difference]: With dead ends: 865 [2018-12-09 00:17:52,356 INFO L226 Difference]: Without dead ends: 394 [2018-12-09 00:17:52,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:17:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-12-09 00:17:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 382. [2018-12-09 00:17:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-09 00:17:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 507 transitions. [2018-12-09 00:17:52,378 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 507 transitions. Word has length 49 [2018-12-09 00:17:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,378 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 507 transitions. [2018-12-09 00:17:52,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:17:52,378 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 507 transitions. [2018-12-09 00:17:52,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:17:52,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,379 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,380 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,380 INFO L82 PathProgramCache]: Analyzing trace with hash 849971633, now seen corresponding path program 1 times [2018-12-09 00:17:52,380 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:17:52,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:52,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:52,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:17:52,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:17:52,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:17:52,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:17:52,450 INFO L87 Difference]: Start difference. First operand 382 states and 507 transitions. Second operand 5 states. [2018-12-09 00:17:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,487 INFO L93 Difference]: Finished difference Result 389 states and 513 transitions. [2018-12-09 00:17:52,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:17:52,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 00:17:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,488 INFO L225 Difference]: With dead ends: 389 [2018-12-09 00:17:52,488 INFO L226 Difference]: Without dead ends: 382 [2018-12-09 00:17:52,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-09 00:17:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-12-09 00:17:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-12-09 00:17:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 503 transitions. [2018-12-09 00:17:52,511 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 503 transitions. Word has length 50 [2018-12-09 00:17:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,512 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 503 transitions. [2018-12-09 00:17:52,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:17:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 503 transitions. [2018-12-09 00:17:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:17:52,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,513 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,513 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1699165264, now seen corresponding path program 1 times [2018-12-09 00:17:52,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:17:52,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:52,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:17:52,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:17:52,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:17:52,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:17:52,593 INFO L87 Difference]: Start difference. First operand 382 states and 503 transitions. Second operand 4 states. [2018-12-09 00:17:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,616 INFO L93 Difference]: Finished difference Result 424 states and 556 transitions. [2018-12-09 00:17:52,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:17:52,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 00:17:52,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,617 INFO L225 Difference]: With dead ends: 424 [2018-12-09 00:17:52,617 INFO L226 Difference]: Without dead ends: 399 [2018-12-09 00:17:52,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:17:52,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-09 00:17:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 374. [2018-12-09 00:17:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-12-09 00:17:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 491 transitions. [2018-12-09 00:17:52,631 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 491 transitions. Word has length 53 [2018-12-09 00:17:52,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,631 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 491 transitions. [2018-12-09 00:17:52,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:17:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 491 transitions. [2018-12-09 00:17:52,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 00:17:52,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,632 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,632 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1987036572, now seen corresponding path program 1 times [2018-12-09 00:17:52,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,632 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:17:52,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:17:52,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:17:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:17:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:17:52,671 INFO L87 Difference]: Start difference. First operand 374 states and 491 transitions. Second operand 4 states. [2018-12-09 00:17:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:52,692 INFO L93 Difference]: Finished difference Result 391 states and 510 transitions. [2018-12-09 00:17:52,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:17:52,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-09 00:17:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:52,693 INFO L225 Difference]: With dead ends: 391 [2018-12-09 00:17:52,693 INFO L226 Difference]: Without dead ends: 321 [2018-12-09 00:17:52,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:17:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-09 00:17:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-12-09 00:17:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-09 00:17:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 404 transitions. [2018-12-09 00:17:52,704 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 404 transitions. Word has length 54 [2018-12-09 00:17:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:52,704 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 404 transitions. [2018-12-09 00:17:52,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:17:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 404 transitions. [2018-12-09 00:17:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:17:52,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:52,705 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:52,706 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:52,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1390680844, now seen corresponding path program 1 times [2018-12-09 00:17:52,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:52,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:52,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:52,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 00:17:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:52,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-12-09 00:17:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 00:17:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:17:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:17:52,914 INFO L87 Difference]: Start difference. First operand 319 states and 404 transitions. Second operand 16 states. [2018-12-09 00:17:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:53,104 INFO L93 Difference]: Finished difference Result 420 states and 523 transitions. [2018-12-09 00:17:53,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:17:53,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2018-12-09 00:17:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:53,105 INFO L225 Difference]: With dead ends: 420 [2018-12-09 00:17:53,105 INFO L226 Difference]: Without dead ends: 347 [2018-12-09 00:17:53,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:17:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-09 00:17:53,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2018-12-09 00:17:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-09 00:17:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 384 transitions. [2018-12-09 00:17:53,119 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 384 transitions. Word has length 56 [2018-12-09 00:17:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:53,119 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 384 transitions. [2018-12-09 00:17:53,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 00:17:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 384 transitions. [2018-12-09 00:17:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:17:53,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:53,120 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:53,120 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1813382670, now seen corresponding path program 1 times [2018-12-09 00:17:53,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:53,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:17:53,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:53,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:53,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 00:17:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 00:17:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 00:17:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:17:53,272 INFO L87 Difference]: Start difference. First operand 303 states and 384 transitions. Second operand 13 states. [2018-12-09 00:17:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:53,540 INFO L93 Difference]: Finished difference Result 366 states and 462 transitions. [2018-12-09 00:17:53,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:17:53,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2018-12-09 00:17:53,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:53,541 INFO L225 Difference]: With dead ends: 366 [2018-12-09 00:17:53,541 INFO L226 Difference]: Without dead ends: 321 [2018-12-09 00:17:53,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:17:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-09 00:17:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 298. [2018-12-09 00:17:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-09 00:17:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 376 transitions. [2018-12-09 00:17:53,559 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 376 transitions. Word has length 56 [2018-12-09 00:17:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:53,559 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 376 transitions. [2018-12-09 00:17:53,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 00:17:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 376 transitions. [2018-12-09 00:17:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:17:53,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:53,560 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:53,561 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:53,561 INFO L82 PathProgramCache]: Analyzing trace with hash -848138954, now seen corresponding path program 1 times [2018-12-09 00:17:53,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:53,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:53,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:53,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:17:53,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/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-12-09 00:17:53,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:53,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:53,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:17:53,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:17:53,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-09 00:17:53,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 00:17:53,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 00:17:53,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:17:53,898 INFO L87 Difference]: Start difference. First operand 298 states and 376 transitions. Second operand 11 states. [2018-12-09 00:17:56,916 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 00:17:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:57,053 INFO L93 Difference]: Finished difference Result 350 states and 443 transitions. [2018-12-09 00:17:57,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:17:57,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-12-09 00:17:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:57,054 INFO L225 Difference]: With dead ends: 350 [2018-12-09 00:17:57,054 INFO L226 Difference]: Without dead ends: 319 [2018-12-09 00:17:57,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:17:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-09 00:17:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 296. [2018-12-09 00:17:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-09 00:17:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 372 transitions. [2018-12-09 00:17:57,072 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 372 transitions. Word has length 56 [2018-12-09 00:17:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:57,072 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 372 transitions. [2018-12-09 00:17:57,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 00:17:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 372 transitions. [2018-12-09 00:17:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 00:17:57,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:57,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:57,073 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:57,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:57,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1591720731, now seen corresponding path program 1 times [2018-12-09 00:17:57,074 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:57,074 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:57,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:57,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 00:17:57,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:57,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:57,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:17:57,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:17:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:17:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:17:57,125 INFO L87 Difference]: Start difference. First operand 296 states and 372 transitions. Second operand 6 states. [2018-12-09 00:17:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:17:57,247 INFO L93 Difference]: Finished difference Result 378 states and 489 transitions. [2018-12-09 00:17:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:17:57,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-09 00:17:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:17:57,249 INFO L225 Difference]: With dead ends: 378 [2018-12-09 00:17:57,249 INFO L226 Difference]: Without dead ends: 331 [2018-12-09 00:17:57,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:17:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-09 00:17:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 302. [2018-12-09 00:17:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-12-09 00:17:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 378 transitions. [2018-12-09 00:17:57,270 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 378 transitions. Word has length 55 [2018-12-09 00:17:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:17:57,270 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 378 transitions. [2018-12-09 00:17:57,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:17:57,270 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 378 transitions. [2018-12-09 00:17:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:17:57,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:17:57,271 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:17:57,272 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:17:57,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:17:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1440743184, now seen corresponding path program 1 times [2018-12-09 00:17:57,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:17:57,272 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:17:57,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:17:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:17:57,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:17:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:17:59,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:17:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:17:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 00:17:59,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:17:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:17:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=110, Unknown=1, NotChecked=0, Total=132 [2018-12-09 00:17:59,438 INFO L87 Difference]: Start difference. First operand 302 states and 378 transitions. Second operand 12 states. [2018-12-09 00:18:01,601 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 00:18:09,345 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-12-09 00:18:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:18:11,609 INFO L93 Difference]: Finished difference Result 349 states and 438 transitions. [2018-12-09 00:18:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 00:18:11,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-09 00:18:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:18:11,610 INFO L225 Difference]: With dead ends: 349 [2018-12-09 00:18:11,610 INFO L226 Difference]: Without dead ends: 313 [2018-12-09 00:18:11,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=101, Invalid=401, Unknown=4, NotChecked=0, Total=506 [2018-12-09 00:18:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-09 00:18:11,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2018-12-09 00:18:11,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-09 00:18:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 374 transitions. [2018-12-09 00:18:11,622 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 374 transitions. Word has length 56 [2018-12-09 00:18:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:18:11,622 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 374 transitions. [2018-12-09 00:18:11,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:18:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 374 transitions. [2018-12-09 00:18:11,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:18:11,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:18:11,623 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:18:11,623 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:18:11,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:18:11,624 INFO L82 PathProgramCache]: Analyzing trace with hash -52797642, now seen corresponding path program 1 times [2018-12-09 00:18:11,624 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:18:11,624 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:18:11,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:18:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:18:11,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:18:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:18:11,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:18:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:18:11,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:18:11,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-12-09 00:18:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:18:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:18:11,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:18:11,738 INFO L87 Difference]: Start difference. First operand 300 states and 374 transitions. Second operand 10 states. [2018-12-09 00:18:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:18:11,845 INFO L93 Difference]: Finished difference Result 403 states and 493 transitions. [2018-12-09 00:18:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:18:11,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-12-09 00:18:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:18:11,847 INFO L225 Difference]: With dead ends: 403 [2018-12-09 00:18:11,847 INFO L226 Difference]: Without dead ends: 327 [2018-12-09 00:18:11,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:18:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-09 00:18:11,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 278. [2018-12-09 00:18:11,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-09 00:18:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 348 transitions. [2018-12-09 00:18:11,859 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 348 transitions. Word has length 56 [2018-12-09 00:18:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:18:11,859 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 348 transitions. [2018-12-09 00:18:11,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:18:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 348 transitions. [2018-12-09 00:18:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:18:11,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:18:11,860 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:18:11,860 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:18:11,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:18:11,861 INFO L82 PathProgramCache]: Analyzing trace with hash -475499468, now seen corresponding path program 1 times [2018-12-09 00:18:11,861 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:18:11,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:18:11,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:18:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:18:11,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:18:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:18:17,768 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:18:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:18:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:18:17,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:18:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:18:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2018-12-09 00:18:17,771 INFO L87 Difference]: Start difference. First operand 278 states and 348 transitions. Second operand 8 states. [2018-12-09 00:18:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:18:22,105 INFO L93 Difference]: Finished difference Result 301 states and 371 transitions. [2018-12-09 00:18:22,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:18:22,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-09 00:18:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:18:22,106 INFO L225 Difference]: With dead ends: 301 [2018-12-09 00:18:22,107 INFO L226 Difference]: Without dead ends: 299 [2018-12-09 00:18:22,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=22, Invalid=49, Unknown=1, NotChecked=0, Total=72 [2018-12-09 00:18:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-09 00:18:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2018-12-09 00:18:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-09 00:18:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 353 transitions. [2018-12-09 00:18:22,118 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 353 transitions. Word has length 56 [2018-12-09 00:18:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:18:22,118 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 353 transitions. [2018-12-09 00:18:22,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:18:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 353 transitions. [2018-12-09 00:18:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:18:22,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:18:22,119 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:18:22,119 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:18:22,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:18:22,119 INFO L82 PathProgramCache]: Analyzing trace with hash -695289963, now seen corresponding path program 1 times [2018-12-09 00:18:22,119 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:18:22,119 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:18:22,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:18:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:18:22,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:18:22,208 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 00:18:22,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:18:22,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:18:22,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 00:18:22,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:18:22,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:18:22,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:18:22,209 INFO L87 Difference]: Start difference. First operand 283 states and 353 transitions. Second operand 12 states. [2018-12-09 00:18:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:18:22,458 INFO L93 Difference]: Finished difference Result 352 states and 443 transitions. [2018-12-09 00:18:22,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:18:22,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2018-12-09 00:18:22,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:18:22,459 INFO L225 Difference]: With dead ends: 352 [2018-12-09 00:18:22,460 INFO L226 Difference]: Without dead ends: 327 [2018-12-09 00:18:22,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:18:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-09 00:18:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 299. [2018-12-09 00:18:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-09 00:18:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 375 transitions. [2018-12-09 00:18:22,474 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 375 transitions. Word has length 56 [2018-12-09 00:18:22,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:18:22,474 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 375 transitions. [2018-12-09 00:18:22,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:18:22,474 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 375 transitions. [2018-12-09 00:18:22,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 00:18:22,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:18:22,475 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:18:22,475 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:18:22,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:18:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1684269273, now seen corresponding path program 1 times [2018-12-09 00:18:22,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:18:22,476 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:18:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:18:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:18:22,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:18:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:18:22,541 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:18:22,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:18:22,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:18:22,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:18:22,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:18:22,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:18:22,542 INFO L87 Difference]: Start difference. First operand 299 states and 375 transitions. Second operand 8 states. [2018-12-09 00:18:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:18:22,714 INFO L93 Difference]: Finished difference Result 367 states and 465 transitions. [2018-12-09 00:18:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:18:22,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-12-09 00:18:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:18:22,715 INFO L225 Difference]: With dead ends: 367 [2018-12-09 00:18:22,715 INFO L226 Difference]: Without dead ends: 348 [2018-12-09 00:18:22,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:18:22,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-12-09 00:18:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 298. [2018-12-09 00:18:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-09 00:18:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 382 transitions. [2018-12-09 00:18:22,728 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 382 transitions. Word has length 56 [2018-12-09 00:18:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:18:22,728 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 382 transitions. [2018-12-09 00:18:22,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:18:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 382 transitions. [2018-12-09 00:18:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 00:18:22,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:18:22,728 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:18:22,729 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:18:22,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:18:22,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2092005707, now seen corresponding path program 1 times [2018-12-09 00:18:22,729 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:18:22,729 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:18:22,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:18:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:18:22,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:18:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:18:32,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:18:32,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:18:32,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:18:32,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:18:32,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:18:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=37, Unknown=5, NotChecked=0, Total=56 [2018-12-09 00:18:32,959 INFO L87 Difference]: Start difference. First operand 298 states and 382 transitions. Second operand 8 states. [2018-12-09 00:18:49,099 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 00:19:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:01,541 INFO L93 Difference]: Finished difference Result 314 states and 397 transitions. [2018-12-09 00:19:01,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:19:01,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-12-09 00:19:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:01,542 INFO L225 Difference]: With dead ends: 314 [2018-12-09 00:19:01,542 INFO L226 Difference]: Without dead ends: 312 [2018-12-09 00:19:01,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=22, Invalid=62, Unknown=6, NotChecked=0, Total=90 [2018-12-09 00:19:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-09 00:19:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 297. [2018-12-09 00:19:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 00:19:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 380 transitions. [2018-12-09 00:19:01,557 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 380 transitions. Word has length 57 [2018-12-09 00:19:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:01,557 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 380 transitions. [2018-12-09 00:19:01,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:19:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 380 transitions. [2018-12-09 00:19:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 00:19:01,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:01,557 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:01,558 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:01,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -364789831, now seen corresponding path program 1 times [2018-12-09 00:19:01,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:01,558 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:01,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:01,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 00:19:01,601 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:01,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:19:01,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:19:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:19:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:19:01,602 INFO L87 Difference]: Start difference. First operand 297 states and 380 transitions. Second operand 5 states. [2018-12-09 00:19:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:01,663 INFO L93 Difference]: Finished difference Result 332 states and 420 transitions. [2018-12-09 00:19:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:19:01,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 00:19:01,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:01,664 INFO L225 Difference]: With dead ends: 332 [2018-12-09 00:19:01,665 INFO L226 Difference]: Without dead ends: 309 [2018-12-09 00:19:01,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-09 00:19:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 297. [2018-12-09 00:19:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 00:19:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 378 transitions. [2018-12-09 00:19:01,680 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 378 transitions. Word has length 57 [2018-12-09 00:19:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:01,680 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 378 transitions. [2018-12-09 00:19:01,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:19:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 378 transitions. [2018-12-09 00:19:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 00:19:01,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:01,681 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:01,681 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:01,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 306992977, now seen corresponding path program 1 times [2018-12-09 00:19:01,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:01,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:01,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:01,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:19:01,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:01,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:01,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:19:01,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:19:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:19:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:19:01,715 INFO L87 Difference]: Start difference. First operand 297 states and 378 transitions. Second operand 4 states. [2018-12-09 00:19:01,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:01,736 INFO L93 Difference]: Finished difference Result 306 states and 386 transitions. [2018-12-09 00:19:01,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:19:01,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 00:19:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:01,737 INFO L225 Difference]: With dead ends: 306 [2018-12-09 00:19:01,737 INFO L226 Difference]: Without dead ends: 264 [2018-12-09 00:19:01,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:19:01,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-09 00:19:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2018-12-09 00:19:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-09 00:19:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2018-12-09 00:19:01,748 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 58 [2018-12-09 00:19:01,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:01,749 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2018-12-09 00:19:01,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:19:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2018-12-09 00:19:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 00:19:01,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:01,749 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:01,749 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:01,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1560523616, now seen corresponding path program 1 times [2018-12-09 00:19:01,750 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:01,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:01,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:19:01,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:19:01,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:19:01,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:19:01,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:19:01,820 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand 8 states. [2018-12-09 00:19:02,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:02,006 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2018-12-09 00:19:02,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:19:02,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-12-09 00:19:02,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:02,007 INFO L225 Difference]: With dead ends: 348 [2018-12-09 00:19:02,007 INFO L226 Difference]: Without dead ends: 308 [2018-12-09 00:19:02,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:19:02,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-12-09 00:19:02,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 286. [2018-12-09 00:19:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-09 00:19:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 361 transitions. [2018-12-09 00:19:02,021 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 361 transitions. Word has length 62 [2018-12-09 00:19:02,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:02,021 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 361 transitions. [2018-12-09 00:19:02,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:19:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 361 transitions. [2018-12-09 00:19:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:19:02,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:02,022 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:02,022 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:02,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1628619175, now seen corresponding path program 1 times [2018-12-09 00:19:02,022 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:02,022 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:02,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:19:02,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:02,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:02,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:19:02,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:19:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:19:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:02,084 INFO L87 Difference]: Start difference. First operand 286 states and 361 transitions. Second operand 6 states. [2018-12-09 00:19:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:02,147 INFO L93 Difference]: Finished difference Result 377 states and 489 transitions. [2018-12-09 00:19:02,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:19:02,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 00:19:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:02,148 INFO L225 Difference]: With dead ends: 377 [2018-12-09 00:19:02,148 INFO L226 Difference]: Without dead ends: 304 [2018-12-09 00:19:02,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:19:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-09 00:19:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 268. [2018-12-09 00:19:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-09 00:19:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 322 transitions. [2018-12-09 00:19:02,161 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 322 transitions. Word has length 64 [2018-12-09 00:19:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:02,161 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 322 transitions. [2018-12-09 00:19:02,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:19:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 322 transitions. [2018-12-09 00:19:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:19:02,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:02,161 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:02,161 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:02,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1905751366, now seen corresponding path program 1 times [2018-12-09 00:19:02,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:02,162 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:02,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:02,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 00:19:02,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:02,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:02,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:19:02,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:19:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:19:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:02,235 INFO L87 Difference]: Start difference. First operand 268 states and 322 transitions. Second operand 6 states. [2018-12-09 00:19:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:02,274 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2018-12-09 00:19:02,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:19:02,274 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 00:19:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:02,275 INFO L225 Difference]: With dead ends: 309 [2018-12-09 00:19:02,275 INFO L226 Difference]: Without dead ends: 307 [2018-12-09 00:19:02,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:19:02,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-09 00:19:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 277. [2018-12-09 00:19:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-09 00:19:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 333 transitions. [2018-12-09 00:19:02,288 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 333 transitions. Word has length 64 [2018-12-09 00:19:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:02,288 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 333 transitions. [2018-12-09 00:19:02,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:19:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 333 transitions. [2018-12-09 00:19:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 00:19:02,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:02,289 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:02,289 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:02,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:02,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1397816770, now seen corresponding path program 1 times [2018-12-09 00:19:02,289 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:02,289 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:02,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:02,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 00:19:02,361 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:02,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:02,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:19:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:19:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:19:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:02,363 INFO L87 Difference]: Start difference. First operand 277 states and 333 transitions. Second operand 6 states. [2018-12-09 00:19:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:02,402 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-12-09 00:19:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:19:02,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 00:19:02,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:02,403 INFO L225 Difference]: With dead ends: 306 [2018-12-09 00:19:02,403 INFO L226 Difference]: Without dead ends: 304 [2018-12-09 00:19:02,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:19:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-09 00:19:02,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 281. [2018-12-09 00:19:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-09 00:19:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2018-12-09 00:19:02,415 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 64 [2018-12-09 00:19:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:02,416 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2018-12-09 00:19:02,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:19:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2018-12-09 00:19:02,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 00:19:02,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:02,416 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:02,416 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:02,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:02,416 INFO L82 PathProgramCache]: Analyzing trace with hash -186874661, now seen corresponding path program 1 times [2018-12-09 00:19:02,417 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:02,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:02,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:02,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 00:19:03,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:19:03,457 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-12-09 00:19:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 00:19:04,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:19:04,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-12-09 00:19:04,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 00:19:04,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 00:19:04,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-09 00:19:04,983 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand 26 states. [2018-12-09 00:19:05,402 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-12-09 00:19:06,538 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-12-09 00:19:07,217 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-12-09 00:19:09,150 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-09 00:19:09,709 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2018-12-09 00:19:10,342 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-09 00:19:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:11,558 INFO L93 Difference]: Finished difference Result 375 states and 460 transitions. [2018-12-09 00:19:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 00:19:11,559 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-12-09 00:19:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:11,561 INFO L225 Difference]: With dead ends: 375 [2018-12-09 00:19:11,561 INFO L226 Difference]: Without dead ends: 347 [2018-12-09 00:19:11,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2018-12-09 00:19:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-09 00:19:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 300. [2018-12-09 00:19:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-09 00:19:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 361 transitions. [2018-12-09 00:19:11,580 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 361 transitions. Word has length 69 [2018-12-09 00:19:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:11,580 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 361 transitions. [2018-12-09 00:19:11,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 00:19:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 361 transitions. [2018-12-09 00:19:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:19:11,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:11,581 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:11,581 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:11,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:11,581 INFO L82 PathProgramCache]: Analyzing trace with hash 457791470, now seen corresponding path program 1 times [2018-12-09 00:19:11,581 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:11,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:11,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:19:11,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:19:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:19:11,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:19:11,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-12-09 00:19:11,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:19:11,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:19:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:19:11,783 INFO L87 Difference]: Start difference. First operand 300 states and 361 transitions. Second operand 14 states. [2018-12-09 00:19:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:12,063 INFO L93 Difference]: Finished difference Result 327 states and 392 transitions. [2018-12-09 00:19:12,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 00:19:12,064 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-12-09 00:19:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:12,064 INFO L225 Difference]: With dead ends: 327 [2018-12-09 00:19:12,065 INFO L226 Difference]: Without dead ends: 320 [2018-12-09 00:19:12,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-12-09 00:19:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-09 00:19:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 297. [2018-12-09 00:19:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-12-09 00:19:12,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 358 transitions. [2018-12-09 00:19:12,083 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 358 transitions. Word has length 70 [2018-12-09 00:19:12,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:12,084 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 358 transitions. [2018-12-09 00:19:12,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:19:12,084 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 358 transitions. [2018-12-09 00:19:12,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:19:12,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:12,084 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:12,084 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:12,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash -297341722, now seen corresponding path program 2 times [2018-12-09 00:19:12,085 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:12,085 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:12,098 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:19:12,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:19:12,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:19:12,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:19:12,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:12,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:12,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 00:19:12,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:19:12,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:19:12,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:19:12,209 INFO L87 Difference]: Start difference. First operand 297 states and 358 transitions. Second operand 12 states. [2018-12-09 00:19:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:12,427 INFO L93 Difference]: Finished difference Result 320 states and 382 transitions. [2018-12-09 00:19:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:19:12,427 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-12-09 00:19:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:12,428 INFO L225 Difference]: With dead ends: 320 [2018-12-09 00:19:12,428 INFO L226 Difference]: Without dead ends: 313 [2018-12-09 00:19:12,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:19:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-09 00:19:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-12-09 00:19:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-09 00:19:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 348 transitions. [2018-12-09 00:19:12,447 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 348 transitions. Word has length 70 [2018-12-09 00:19:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:12,447 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 348 transitions. [2018-12-09 00:19:12,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:19:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 348 transitions. [2018-12-09 00:19:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:19:12,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:12,447 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:12,448 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:12,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1221744938, now seen corresponding path program 1 times [2018-12-09 00:19:12,448 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:12,448 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:12,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:19:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:12,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:19:12,515 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:12,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:12,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:19:12,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:19:12,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:19:12,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:12,517 INFO L87 Difference]: Start difference. First operand 289 states and 348 transitions. Second operand 6 states. [2018-12-09 00:19:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:12,729 INFO L93 Difference]: Finished difference Result 387 states and 474 transitions. [2018-12-09 00:19:12,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:19:12,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 00:19:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:12,731 INFO L225 Difference]: With dead ends: 387 [2018-12-09 00:19:12,731 INFO L226 Difference]: Without dead ends: 368 [2018-12-09 00:19:12,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:19:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-12-09 00:19:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 285. [2018-12-09 00:19:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-09 00:19:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 345 transitions. [2018-12-09 00:19:12,752 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 345 transitions. Word has length 70 [2018-12-09 00:19:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:12,753 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 345 transitions. [2018-12-09 00:19:12,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:19:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 345 transitions. [2018-12-09 00:19:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:19:12,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:12,753 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:12,753 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:12,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1115137352, now seen corresponding path program 1 times [2018-12-09 00:19:12,754 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:12,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:12,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:19:12,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:12,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:12,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 00:19:12,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:19:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:19:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:19:12,932 INFO L87 Difference]: Start difference. First operand 285 states and 345 transitions. Second operand 9 states. [2018-12-09 00:19:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:13,343 INFO L93 Difference]: Finished difference Result 335 states and 405 transitions. [2018-12-09 00:19:13,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:19:13,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-12-09 00:19:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:13,345 INFO L225 Difference]: With dead ends: 335 [2018-12-09 00:19:13,345 INFO L226 Difference]: Without dead ends: 294 [2018-12-09 00:19:13,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 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-12-09 00:19:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-09 00:19:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 266. [2018-12-09 00:19:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-09 00:19:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2018-12-09 00:19:13,365 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 70 [2018-12-09 00:19:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:13,366 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2018-12-09 00:19:13,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:19:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2018-12-09 00:19:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:19:13,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:13,366 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:13,367 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:13,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:13,367 INFO L82 PathProgramCache]: Analyzing trace with hash -40698028, now seen corresponding path program 1 times [2018-12-09 00:19:13,367 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:13,367 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:13,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:19:13,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:13,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:13,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:19:13,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:19:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:19:13,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:19:13,481 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 6 states. [2018-12-09 00:19:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:13,549 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2018-12-09 00:19:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:19:13,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-09 00:19:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:13,550 INFO L225 Difference]: With dead ends: 287 [2018-12-09 00:19:13,550 INFO L226 Difference]: Without dead ends: 283 [2018-12-09 00:19:13,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:19:13,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-09 00:19:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2018-12-09 00:19:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-09 00:19:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 297 transitions. [2018-12-09 00:19:13,585 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 297 transitions. Word has length 72 [2018-12-09 00:19:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:13,585 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 297 transitions. [2018-12-09 00:19:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:19:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 297 transitions. [2018-12-09 00:19:13,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 00:19:13,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:13,586 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:13,586 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:13,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 16560274, now seen corresponding path program 1 times [2018-12-09 00:19:13,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:13,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:13,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:13,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-09 00:19:13,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:19:14,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:19:14,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:19:14,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:14,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:19:14,450 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:14,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:19:14,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2018-12-09 00:19:14,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 00:19:14,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 00:19:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:19:14,466 INFO L87 Difference]: Start difference. First operand 253 states and 297 transitions. Second operand 17 states. [2018-12-09 00:19:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:15,474 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-12-09 00:19:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 00:19:15,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-12-09 00:19:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:15,474 INFO L225 Difference]: With dead ends: 302 [2018-12-09 00:19:15,475 INFO L226 Difference]: Without dead ends: 158 [2018-12-09 00:19:15,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-12-09 00:19:15,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-09 00:19:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2018-12-09 00:19:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 00:19:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 168 transitions. [2018-12-09 00:19:15,485 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 168 transitions. Word has length 72 [2018-12-09 00:19:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:15,485 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 168 transitions. [2018-12-09 00:19:15,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 00:19:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 168 transitions. [2018-12-09 00:19:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 00:19:15,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:15,486 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:15,486 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:15,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1073890760, now seen corresponding path program 1 times [2018-12-09 00:19:15,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:15,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:15,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:19:15,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:19:15,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:19:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:19:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:19:15,524 INFO L87 Difference]: Start difference. First operand 138 states and 168 transitions. Second operand 4 states. [2018-12-09 00:19:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:15,544 INFO L93 Difference]: Finished difference Result 162 states and 194 transitions. [2018-12-09 00:19:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:19:15,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-12-09 00:19:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:15,545 INFO L225 Difference]: With dead ends: 162 [2018-12-09 00:19:15,545 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 00:19:15,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:19:15,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 00:19:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-09 00:19:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-09 00:19:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-12-09 00:19:15,555 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 71 [2018-12-09 00:19:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:15,555 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-12-09 00:19:15,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:19:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-12-09 00:19:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 00:19:15,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:15,556 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:15,556 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:15,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1571950312, now seen corresponding path program 1 times [2018-12-09 00:19:15,556 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:15,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:15,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:19:15,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:15,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:19:15,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:19:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:19:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:19:15,610 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 5 states. [2018-12-09 00:19:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:15,642 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2018-12-09 00:19:15,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:19:15,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 00:19:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:15,642 INFO L225 Difference]: With dead ends: 148 [2018-12-09 00:19:15,642 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 00:19:15,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:19:15,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 00:19:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 00:19:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 00:19:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-12-09 00:19:15,648 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 73 [2018-12-09 00:19:15,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:15,648 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-12-09 00:19:15,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:19:15,648 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-12-09 00:19:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-09 00:19:15,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:15,648 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:15,648 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:15,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:15,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1289345495, now seen corresponding path program 1 times [2018-12-09 00:19:15,649 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:15,649 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:15,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 00:19:16,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:16,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 00:19:16,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 00:19:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 00:19:16,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 00:19:16,117 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 12 states. [2018-12-09 00:19:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:17,014 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-12-09 00:19:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:19:17,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-12-09 00:19:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:17,015 INFO L225 Difference]: With dead ends: 90 [2018-12-09 00:19:17,015 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 00:19:17,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:19:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 00:19:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-09 00:19:17,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 00:19:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-12-09 00:19:17,021 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 77 [2018-12-09 00:19:17,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:17,022 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-12-09 00:19:17,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 00:19:17,022 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-12-09 00:19:17,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 00:19:17,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:19:17,022 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:19:17,023 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:19:17,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:19:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1480434104, now seen corresponding path program 1 times [2018-12-09 00:19:17,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:19:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/cvc4 Starting monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:19:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:19:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:19:17,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:19:17,229 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-09 00:19:17,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:19:17,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:19:17,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 00:19:17,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 00:19:17,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 00:19:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:19:17,232 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 10 states. [2018-12-09 00:19:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:19:17,506 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-12-09 00:19:17,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 00:19:17,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2018-12-09 00:19:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:19:17,506 INFO L225 Difference]: With dead ends: 72 [2018-12-09 00:19:17,507 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:19:17,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:19:17,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:19:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:19:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:19:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:19:17,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2018-12-09 00:19:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:19:17,507 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:19:17,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 00:19:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:19:17,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:19:17,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:19:17,639 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 168 [2018-12-09 00:19:17,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:17,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:19:19,107 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 165 DAG size of output: 95 [2018-12-09 00:19:28,865 WARN L180 SmtUtils]: Spent 9.75 s on a formula simplification. DAG size of input: 151 DAG size of output: 61 [2018-12-09 00:19:30,088 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 141 DAG size of output: 54 [2018-12-09 00:19:30,294 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-09 00:20:00,556 WARN L180 SmtUtils]: Spent 30.25 s on a formula simplification. DAG size of input: 337 DAG size of output: 218 [2018-12-09 00:21:25,676 WARN L180 SmtUtils]: Spent 1.42 m on a formula simplification. DAG size of input: 193 DAG size of output: 138 [2018-12-09 00:21:25,679 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 00:21:25,679 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:21:25,679 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2018-12-09 00:21:25,679 INFO L448 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2018-12-09 00:21:25,679 INFO L444 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (or (not (= (_ bv0 32) |base2flt_#in~m|)) (and (= (_ bv0 32) base2flt_~__retres4~0) (= base2flt_~m |base2flt_#in~m|))) [2018-12-09 00:21:25,679 INFO L448 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2018-12-09 00:21:25,679 INFO L448 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L444 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L451 ceAbstractionStarter]: At program point base2fltENTRY(lines 14 72) the Hoare annotation is: true [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point base2fltFINAL(lines 14 72) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L444 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point base2fltEXIT(lines 14 72) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: (not (= (_ bv0 32) |base2flt_#in~m|)) [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:21:25,680 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 214 345) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L444 ceAbstractionStarter]: At program point L242(line 242) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L242-1(line 242) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L267(lines 267 300) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L267-1(lines 238 344) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 313) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L309-2(lines 309 313) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 297) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 289) no Hoare annotation was computed. [2018-12-09 00:21:25,680 INFO L448 ceAbstractionStarter]: For program point L285-2(lines 285 289) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 253) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L244-2(lines 238 344) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 278) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 214 345) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L444 ceAbstractionStarter]: At program point L269-2(lines 269 278) the Hoare annotation is: (let ((.cse16 (bvult main_~a~0 main_~r_add~0)) (.cse7 (= (_ bv1 32) main_~tmp___2~0)) (.cse3 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse8 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse4 (= (_ bv0 32) main_~zero~0)) (.cse9 (= (bvadd main_~tmp___1~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse0 (= main_~tmp___1~0 (_ bv0 32))) (.cse1 (not (bvult main_~r_add~0 main_~a~0))) (.cse2 (= main_~tmp___2~0 (_ bv0 32))) (.cse6 (and .cse16 .cse7 .cse3 .cse8 .cse4 .cse9))) (let ((.cse10 (= (bvadd main_~r_add~0 (_ bv1 32)) (_ bv0 32))) (.cse11 (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse12 (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse13 (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse14 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse15 (or (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse4) .cse6)) (.cse5 (not (bvult main_~a~0 main_~b~0)))) (or (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse5) (and .cse7 .cse3 .cse8 .cse4 .cse9 .cse10)) .cse11 .cse12 .cse13 .cse14) (and (not (= (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv4294967041 32)) (_ bv0 32))) .cse11 .cse12 .cse13 (exists ((v_addflt_~ma~0_67 (_ BitVec 32))) (= (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_67) (bvshl (bvadd (bvlshr main_~b~0 (_ bv24 32)) (_ bv1 32)) (_ bv24 32))) main_~r_add~0)) .cse14 .cse15) (and (or (and (= main_~b~0 main_~r_add~0) .cse16 .cse8 .cse4) (and .cse8 .cse4 .cse10 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32)))) .cse7 .cse9) (and .cse11 .cse12 .cse13 .cse14 .cse15 (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse20 (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) main_~b~0))))) (let ((.cse18 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) (.cse19 (bvneg .cse20))) (let ((.cse17 (bvadd .cse18 .cse19))) (and (= (_ bv0 32) (bvand (_ bv33554432 32) .cse17)) (not (= (_ bv0 32) (bvadd .cse18 .cse19 .cse20))) (= main_~r_add~0 (bvor (bvand (_ bv16777215 32) .cse17) (bvshl (bvlshr main_~b~0 (_ bv24 32)) (_ bv24 32)))))))))) (and (= main_~a~0 main_~r_add~0) .cse0 .cse2 .cse3 .cse4 .cse5))))) [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 328) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 214 345) the Hoare annotation is: true [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L319-2(lines 318 334) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L444 ceAbstractionStarter]: At program point L254-1(lines 254 263) the Hoare annotation is: (let ((.cse0 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0))) (.cse2 (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~a~0 main_~zero~0))) (.cse1 (= (_ bv0 32) main_~zero~0))) (or (and (= main_~tmp___0~0 (_ bv0 32)) (= main_~b~0 (_ bv0 32)) (= (_ bv0 32) main_~sb~0)) (and (not (bvugt main_~a~0 (_ bv0 32))) .cse0 (= (_ bv0 32) main_~sa~0) .cse1 (= main_~tmp~2 (_ bv0 32))) (and (= (_ bv4294967295 32) main_~a~0) .cse0 .cse1) (and .cse2 .cse1 (= (bvadd main_~b~0 (_ bv1 32)) (_ bv0 32))) (and (= (bvadd main_~tmp~2 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~tmp___0~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~sb~0 (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse2 .cse1 (= (bvadd main_~sa~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L304(lines 304 340) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L304-1(lines 304 340) no Hoare annotation was computed. [2018-12-09 00:21:25,681 INFO L444 ceAbstractionStarter]: At program point L329-1(lines 316 334) the Hoare annotation is: (= (bvadd main_~tmp___9~0 (_ bv4294967295 32)) (_ bv0 32)) [2018-12-09 00:21:25,681 INFO L448 ceAbstractionStarter]: For program point L280(lines 268 295) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 251) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L444 ceAbstractionStarter]: At program point L305(lines 301 341) the Hoare annotation is: (or (= main_~a~0 main_~r_add~0) (and (= main_~b~0 main_~r_add~0) (exists ((main_~zero~0 (_ BitVec 32))) (bvugt main_~b~0 main_~zero~0)) (= (_ bv0 32) main_~zero~0))) [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 276) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L272-2(lines 272 276) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L322-2(lines 322 326) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L306-1(lines 304 338) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L451 ceAbstractionStarter]: At program point L240(line 240) the Hoare annotation is: true [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L240-1(line 240) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L265(line 265) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 261) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L448 ceAbstractionStarter]: For program point L257-2(lines 257 261) no Hoare annotation was computed. [2018-12-09 00:21:25,682 INFO L444 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 (= main_~tmp___3~0 (_ bv0 32))) (.cse4 (= main_~tmp___4~0 (_ bv0 32))) (.cse0 (= (bvadd main_~tmp___3~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (and .cse5 (and .cse6 (or (and (and (= main_~a~0 main_~r_add~0) .cse9) .cse7) (and (= main_~b~0 main_~r_add~0) .cse8 .cse9))))) (.cse2 (= (_ bv1 32) main_~tmp___4~0))) (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 ((.cse1 (and .cse5 (and .cse6 .cse7 .cse8 .cse9)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4)))) (and .cse3 .cse10 .cse4) (and .cse0 .cse10 .cse2)))) [2018-12-09 00:21:25,682 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (= (_ bv0 32) main_~zero~0) [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-09 00:21:25,683 INFO L451 ceAbstractionStarter]: At program point addfltENTRY(lines 73 136) the Hoare annotation is: true [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point addfltFINAL(lines 73 136) no Hoare annotation was computed. [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 121) no Hoare annotation was computed. [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 113) no Hoare annotation was computed. [2018-12-09 00:21:25,683 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (and (let ((.cse0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse2 (exists ((addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (and (= (bvadd addflt_~eb~0 (_ bv128 32)) (bvlshr addflt_~b (_ bv24 32))) (not (bvult addflt_~a addflt_~b)) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) (.cse1 (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv4294967168 32)))) (or (and (= .cse0 addflt_~ma~0) (= .cse1 addflt_~ea~0) (= (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) addflt_~mb~0) (= addflt_~b |addflt_#in~a|) .cse2 (= (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32)) addflt_~eb~0) (= addflt_~a |addflt_#in~b|) (bvult addflt_~b addflt_~a)) (and (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32))) |addflt_#in~a|)) (= addflt_~b |addflt_#in~b|) (= .cse0 addflt_~mb~0) (exists ((addflt_~a (_ BitVec 32))) (= addflt_~ma~0 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (not (bvult |addflt_#in~a| |addflt_#in~b|)) .cse2 (= addflt_~a |addflt_#in~a|) (= .cse1 addflt_~eb~0) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0)))) (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32))) [2018-12-09 00:21:25,683 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-12-09 00:21:25,684 INFO L444 ceAbstractionStarter]: At program point L133(lines 83 135) the Hoare annotation is: (let ((.cse14 (= addflt_~a |addflt_#in~a|)) (.cse32 (not (bvult addflt_~a addflt_~b))) (.cse10 (= addflt_~__retres10~0 |addflt_#in~a|)) (.cse33 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse3 (= (_ bv0 32) |addflt_#in~b|)) (.cse0 (let ((.cse35 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse35) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse35) .cse33) |addflt_#in~a|))))) (.cse1 (let ((.cse34 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse34) .cse33) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse34) (_ bv0 32)))))) (.cse8 (= (_ bv0 32) |addflt_#in~a|)) (.cse7 (bvult |addflt_#in~a| addflt_~a)) (.cse5 (not (bvult |addflt_#in~a| |addflt_#in~b|))) (.cse2 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse33) |addflt_#in~a|))) (.cse16 (= addflt_~b |addflt_#in~a|)) (.cse17 (= addflt_~__retres10~0 |addflt_#in~b|)) (.cse18 (= addflt_~a |addflt_#in~b|)) (.cse11 (and .cse14 .cse32 .cse10)) (.cse9 (not (= (_ bv4294967295 32) |addflt_#in~b|))) (.cse4 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32))))) (and (or (or (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)) (and .cse0 .cse1 .cse2)) .cse3 .cse4) (or .cse5 (and (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) addflt_~mb~0)) (= (bvadd addflt_~ma~0 (_ bv4261412865 32)) (_ bv0 32))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (let ((.cse6 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (and (not (= .cse6 (_ bv0 32))) (= (_ bv33554431 32) (bvadd (bvneg .cse6) addflt_~ma~0)))))) .cse7) (and .cse8 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) .cse9) (or (bvugt |addflt_#in~b| (_ bv0 32)) .cse10) (let ((.cse13 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse12 (= addflt_~b |addflt_#in~b|))) (let ((.cse28 (let ((.cse31 (or (and .cse14 .cse32) (and .cse16 .cse32)))) (or (and .cse31 .cse12) (and .cse31 .cse18)))) (.cse30 (bvadd .cse13 (_ bv4294967168 32)))) (let ((.cse15 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse30) addflt_~ea~0))) (.cse26 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse27 (and .cse28 .cse2 (not (bvult addflt_~__retres10~0 |addflt_#in~a|)))) (.cse29 (= (bvadd addflt_~__retres10~0 (_ bv1 32)) (_ bv0 32)))) (or (and .cse11 .cse3 .cse12) (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))))) .cse5 (not (= (bvadd .cse13 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse13 (_ bv4294967169 32)) addflt_~ea~0) .cse14 .cse12) (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))) (= .cse15 addflt_~mb~0) .cse16 .cse17 .cse18 (bvult addflt_~b addflt_~a)) (and (exists ((addflt_~a (_ BitVec 32))) (let ((.cse20 (bvlshr addflt_~a (_ bv24 32)))) (let ((.cse21 (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) .cse20 (_ bv4294967168 32))))) (let ((.cse19 (bvadd (bvneg (bvneg .cse21)) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))))) (and (= addflt_~__retres10~0 (bvor (bvand (_ bv16777215 32) .cse19) (bvshl .cse20 (_ bv24 32)))) (bvult |addflt_#in~a| addflt_~a) (= (_ bv0 32) (bvand (_ bv33554432 32) .cse19)) (not (= .cse21 (_ bv0 32)))))))) .cse0 .cse1 .cse2 (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))))))) .cse16 .cse18) .cse8 (and (= (bvadd .cse26 (_ bv4294967169 32)) addflt_~ea~0) (exists ((v_addflt_~ma~0_67 (_ BitVec 32))) (= (bvor (bvand (_ bv16777215 32) v_addflt_~ma~0_67) (bvshl (bvadd (bvlshr |addflt_#in~b| (_ bv24 32)) (_ bv1 32)) (_ bv24 32))) addflt_~__retres10~0)) .cse27 (not (= (bvadd .cse26 (_ bv4294967041 32)) (_ bv0 32))) .cse18) (and (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) .cse28 .cse29 (not (= (_ bv0 32) .cse15)) .cse7) (and (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|)) (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg (bvadd .cse26 (_ bv4294967168 32))) (_ bv4294967168 32))) addflt_~mb~0) (or (and .cse14 .cse12 .cse27) (and .cse29 .cse5 .cse14 .cse12 (not (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0))))) (= .cse30 addflt_~ea~0)))))) (or (bvugt |addflt_#in~a| (_ bv0 32)) (and .cse16 .cse17 .cse18) .cse11) (or (and (= (bvadd addflt_~ma~0 (_ bv4227858434 32)) (_ bv0 32)) (= (_ bv127 32) addflt_~eb~0)) .cse9 .cse4)))) [2018-12-09 00:21:25,684 INFO L448 ceAbstractionStarter]: For program point addfltEXIT(lines 73 136) no Hoare annotation was computed. [2018-12-09 00:21:25,684 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 90) no Hoare annotation was computed. [2018-12-09 00:21:25,684 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 126) no Hoare annotation was computed. [2018-12-09 00:21:25,684 INFO L448 ceAbstractionStarter]: For program point L84-2(lines 83 135) no Hoare annotation was computed. [2018-12-09 00:21:25,685 INFO L444 ceAbstractionStarter]: At program point L115-2(lines 115 126) the Hoare annotation is: (and (let ((.cse8 (bvlshr |addflt_#in~b| (_ bv24 32))) (.cse7 (= addflt_~b |addflt_#in~b|)) (.cse9 (= addflt_~a |addflt_#in~b|)) (.cse6 (= addflt_~a |addflt_#in~a|))) (let ((.cse1 (let ((.cse15 (let ((.cse17 (not (bvult addflt_~a addflt_~b)))) (or (and .cse6 .cse17) (and (= addflt_~b |addflt_#in~a|) .cse17))))) (or (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0)) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a)))) (let ((.cse16 (= (_ bv0 32) (bvand (_ bv33554432 32) addflt_~ma~0)))) (or (and .cse15 .cse16 .cse9) (and .cse15 .cse16 .cse7)))) (and (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32)) (addflt_~a (_ BitVec 32))) (= (bvlshr (bvadd (bvneg (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0))) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (_ bv1 32)) addflt_~ma~0)) (or (and .cse15 .cse7) (and .cse15 .cse9)))))) (.cse5 (bvlshr |addflt_#in~a| (_ bv24 32))) (.cse3 (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) (.cse0 (bvadd .cse8 (_ bv4294967168 32)))) (let ((.cse4 (= (bvlshr .cse3 (bvadd (bvlshr addflt_~a (_ bv24 32)) (bvneg .cse0) (_ bv4294967168 32))) addflt_~mb~0)) (.cse2 (bvadd .cse5 (_ bv4294967168 32))) (.cse10 (let ((.cse12 (bvshl (bvadd addflt_~ea~0 (_ bv128 32)) (_ bv24 32)))) (let ((.cse14 (not (bvult (bvor (bvand (_ bv16777215 32) addflt_~ma~0) .cse12) |addflt_#in~a|)))) (or (and (let ((.cse11 (bvadd addflt_~mb~0 addflt_~ma~0))) (or (not (= (bvand (_ bv33554432 32) .cse11) (_ bv0 32))) (not (bvult (bvor (bvand (_ bv16777215 32) .cse11) .cse12) |addflt_#in~a|)))) (let ((.cse13 (bvadd (bvlshr addflt_~mb~0 (bvadd addflt_~ea~0 (bvneg addflt_~eb~0))) addflt_~ma~0))) (or (not (bvult (bvor (bvand (_ bv16777215 32) .cse13) .cse12) |addflt_#in~a|)) (not (= (bvand (_ bv33554432 32) .cse13) (_ bv0 32))))) .cse14 .cse1) (and .cse6 .cse14 .cse1)))))) (or (and (= .cse0 addflt_~ea~0) .cse1 (exists ((addflt_~a (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg (bvadd (bvlshr |addflt_#in~a| (_ bv24 32)) (_ bv4294967168 32))) addflt_~ea~0))) addflt_~ma~0) (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~a))) (bvult |addflt_#in~a| addflt_~a) (= (bvadd (bvlshr addflt_~a (_ bv24 32)) (_ bv4294967168 32)) addflt_~ea~0))) (not (= (_ bv0 32) (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~a|)) (bvadd (bvneg .cse2) addflt_~ea~0)))) (exists ((addflt_~delta~0 (_ BitVec 32)) (addflt_~b (_ BitVec 32))) (= (bvlshr (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) addflt_~b)) addflt_~delta~0) (bvadd (bvneg (bvor (_ bv16777216 32) (bvand (_ bv16777215 32) |addflt_#in~b|))) addflt_~ma~0))) (not (= (_ bv0 32) (bvadd (bvneg .cse3) addflt_~ma~0)))) (and .cse4 (not (= (bvadd .cse5 (_ bv4294967041 32)) (_ bv0 32))) (= (bvadd .cse5 (_ bv4294967169 32)) addflt_~ea~0) .cse6 .cse7 .cse1) (and (= (bvadd .cse8 (_ bv4294967169 32)) addflt_~ea~0) (not (= (bvadd .cse8 (_ bv4294967041 32)) (_ bv0 32))) .cse9 .cse10) (and .cse4 (= .cse2 addflt_~ea~0) .cse6 .cse7 .cse10))))) (bvugt |addflt_#in~b| (_ bv0 32)) (bvugt |addflt_#in~a| (_ bv0 32)) (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) [2018-12-09 00:21:25,685 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2018-12-09 00:21:25,685 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2018-12-09 00:21:25,685 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2018-12-09 00:21:25,685 INFO L448 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2018-12-09 00:21:25,686 INFO L448 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2018-12-09 00:21:25,686 INFO L448 ceAbstractionStarter]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2018-12-09 00:21:25,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-09 00:21:25,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-09 00:21:25,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-09 00:21:25,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-09 00:21:25,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-12-09 00:21:25,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:21:25 BoogieIcfgContainer [2018-12-09 00:21:25,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:21:25,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:21:25,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:21:25,721 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:21:25,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:17:44" (3/4) ... [2018-12-09 00:21:25,724 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:21:25,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:21:25,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2018-12-09 00:21:25,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:21:25,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2018-12-09 00:21:25,730 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 00:21:25,735 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-09 00:21:25,736 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 00:21:25,736 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:21:25,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) [2018-12-09 00:21:25,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-09 00:21:25,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-09 00:21:25,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(m)) [2018-12-09 00:21:25,755 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) [2018-12-09 00:21:25,756 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) && (((!~bvult64(\old(a), \old(b)) || ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) || (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma))) && ~bvult64(\old(a), a))) || (0bv32 == \old(a) && ~bvadd64(a, 1bv32) == 0bv32)) || !(4294967295bv32 == \old(b)))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && (((((((((((a == \old(a) && !~bvult64(a, b)) && __retres10 == \old(a)) && 0bv32 == \old(b)) && b == \old(b)) || ((((((\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))) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && __retres10 == \old(b)) && a == \old(b)) && ~bvult64(b, a))) || (((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && b == \old(a)) && a == \old(b))) || 0bv32 == \old(a)) || ((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_67 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_67), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) || ((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea))) && ((~bvugt32(\old(a), 0bv32) || ((b == \old(a) && __retres10 == \old(b)) && a == \old(b))) || ((a == \old(a) && !~bvult64(a, b)) && __retres10 == \old(a)))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) [2018-12-09 00:21:25,777 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f87d5f9-12cc-45d1-a9be-c0d8bc8bbafc/bin-2019/uautomizer/witness.graphml [2018-12-09 00:21:25,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:21:25,777 INFO L168 Benchmark]: Toolchain (without parser) took 221580.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 222.8 MB). Free memory was 944.7 MB in the beginning and 874.5 MB in the end (delta: 70.2 MB). Peak memory consumption was 293.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.42 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: Boogie Preprocessor took 50.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: RCFGBuilder took 253.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: TraceAbstraction took 220998.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 874.5 MB in the end (delta: 215.7 MB). Peak memory consumption was 417.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:21:25,778 INFO L168 Benchmark]: Witness Printer took 56.32 ms. Allocated memory is still 1.3 GB. Free memory is still 874.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:21:25,779 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 203.42 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 928.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.37 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -186.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 253.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220998.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 95.9 MB). Free memory was 1.1 GB in the beginning and 874.5 MB in the end (delta: 215.7 MB). Peak memory consumption was 417.3 MB. Max. memory is 11.5 GB. * Witness Printer took 56.32 ms. Allocated memory is still 1.3 GB. Free memory is still 874.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 301]: Loop Invariant [2018-12-09 00:21:25,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] [2018-12-09 00:21:25,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~zero~0,QUANTIFIED] Derived loop invariant: a == r_add || ((b == r_add && (\exists main_~zero~0 : bv32 :: ~bvugt32(b, main_~zero~0))) && 0bv32 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) || (0bv32 == __retres4 && m == \old(m)) - InvariantResult [Line: 83]: Loop Invariant [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-12-09 00:21:25,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,786 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,789 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~ma~0,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,790 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,791 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~b,QUANTIFIED] [2018-12-09 00:21:25,792 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~delta~0,QUANTIFIED] [2018-12-09 00:21:25,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_addflt_~ma~0_67,QUANTIFIED] [2018-12-09 00:21:25,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2018-12-09 00:21:25,793 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvadd64(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), 33554431bv32) == ma) || (((!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) || 0bv32 == \old(b)) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) && (((!~bvult64(\old(a), \old(b)) || ((((\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == mb) && ~bvadd64(ma, 4261412865bv32) == 0bv32) || (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0) == 0bv32) && 33554431bv32 == ~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0)), ma))) && ~bvult64(\old(a), a))) || (0bv32 == \old(a) && ~bvadd64(a, 1bv32) == 0bv32)) || !(4294967295bv32 == \old(b)))) && (~bvugt32(\old(b), 0bv32) || __retres10 == \old(a))) && (((((((((((a == \old(a) && !~bvult64(a, b)) && __retres10 == \old(a)) && 0bv32 == \old(b)) && b == \old(b)) || ((((((\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))) || ((((((\exists addflt_~a : bv32 :: (ma == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)) == mb) && b == \old(a)) && __retres10 == \old(b)) && a == \old(b)) && ~bvult64(b, a))) || (((((((\exists addflt_~a : bv32 :: ((__retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)))), ~bvshl32(~bvlshr64(addflt_~a, 24bv32), 24bv32)) && ~bvult64(\old(a), addflt_~a)) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)))), ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a))))) && !(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ~bvlshr64(addflt_~a, 24bv32), 4294967168bv32)) == 0bv32)) && (!(~bvand64(33554432bv32, ~bvadd64(mb, ma)) == 0bv32) || !~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(mb, ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)))) && (!~bvult64(~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a)) || !(~bvand64(33554432bv32, ~bvadd64(~bvlshr64(mb, ~bvadd64(ea, ~bvneg32(eb))), ma)) == 0bv32))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && (\exists addflt_~delta~0 : bv32, addflt_~b : bv32 :: (!(~bvadd64(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0), ~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b)))))) == 0bv32) && __retres10 == ~bvor32(~bvand64(16777215bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))), ~bvshl32(~bvlshr64(\old(b), 24bv32), 24bv32))) && 0bv32 == ~bvand64(33554432bv32, ~bvadd64(~bvneg32(~bvneg32(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))))), ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~b)), addflt_~delta~0))))) && b == \old(a)) && a == \old(b))) || 0bv32 == \old(a)) || ((((~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967169bv32) == ea && (\exists v_addflt_~ma~0_67 : bv32 :: ~bvor32(~bvand64(16777215bv32, v_addflt_~ma~0_67), ~bvshl32(~bvadd64(~bvlshr64(\old(b), 24bv32), 1bv32), 24bv32)) == __retres10)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) && !(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967041bv32) == 0bv32)) && a == \old(b))) || (((((\exists addflt_~a : bv32 :: (~bvadd64(~bvneg32(~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea))), ma) == ~bvor32(16777216bv32, ~bvand64(16777215bv32, addflt_~a)) && ~bvult64(\old(a), addflt_~a)) && ~bvadd64(~bvlshr64(addflt_~a, 24bv32), 4294967168bv32) == ea) && ((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b)))) && ~bvadd64(__retres10, 1bv32) == 0bv32) && !(0bv32 == ~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(a))), ~bvadd64(~bvneg32(~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32)), ea)))) && ~bvult64(\old(a), a))) || ((~bvlshr64(~bvor32(16777216bv32, ~bvand64(16777215bv32, \old(b))), ~bvadd64(~bvlshr64(a, 24bv32), ~bvneg32(~bvadd64(~bvlshr64(\old(b), 24bv32), 4294967168bv32)), 4294967168bv32)) == mb && (((a == \old(a) && b == \old(b)) && (((((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && b == \old(b)) || (((a == \old(a) && !~bvult64(a, b)) || (b == \old(a) && !~bvult64(a, b))) && a == \old(b))) && !~bvult64(~bvor32(~bvand64(16777215bv32, ma), ~bvshl32(~bvadd64(ea, 128bv32), 24bv32)), \old(a))) && !~bvult64(__retres10, \old(a))) || ((((~bvadd64(__retres10, 1bv32) == 0bv32 && !~bvult64(\old(a), \old(b))) && a == \old(a)) && b == \old(b)) && !(0bv32 == ~bvand64(33554432bv32, ma))))) && ~bvadd64(~bvlshr64(\old(a), 24bv32), 4294967168bv32) == ea))) && ((~bvugt32(\old(a), 0bv32) || ((b == \old(a) && __retres10 == \old(b)) && a == \old(b))) || ((a == \old(a) && !~bvult64(a, b)) && __retres10 == \old(a)))) && (((~bvadd64(ma, 4227858434bv32) == 0bv32 && 127bv32 == eb) || !(4294967295bv32 == \old(b))) || !(~bvadd64(\old(a), 1bv32) == 0bv32)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: !(0bv32 == \old(m)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 1 error locations. SAFE Result, 220.9s OverallTime, 45 OverallIterations, 4 TraceHistogramMax, 65.4s AutomataDifference, 0.0s DeadEndRemovalTime, 128.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 5013 SDtfs, 2384 SDslu, 28173 SDs, 0 SdLazy, 6988 SolverSat, 374 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 42.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3378 GetRequests, 2896 SyntacticMatches, 14 SemanticMatches, 468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 44.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 45 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 485 PreInvPairs, 594 NumberOfFragments, 2904 HoareAnnotationTreeSize, 485 FomulaSimplifications, 5460968 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 174987 FormulaSimplificationTreeSizeReductionInter, 127.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2723 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3143 ConstructedInterpolants, 91 QuantifiedInterpolants, 541225 SizeOfPredicates, 234 NumberOfNonLiveVariables, 4700 ConjunctsInSsa, 419 ConjunctsInUnsatCore, 57 InterpolantComputations, 34 PerfectInterpolantSequences, 1042/1141 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...