./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/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 9a8cb7a54337f31cc721bc63892cae8fcf685402 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:05,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:05,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:05,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:05,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:05,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:05,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:05,523 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:05,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:05,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:05,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:05,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:05,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:05,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:05,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:05,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:05,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:05,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:05,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:05,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:05,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:05,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:05,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:05,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:05,545 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:05,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:05,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:05,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:05,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:05,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:05,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:05,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:05,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:05,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:05,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:05,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:05,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:05,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:05,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:05,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:05,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:05,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:05,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:05,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:05,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:05,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:05,570 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:05,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:05,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:05,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:05,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:05,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:05,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:05,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:05,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:05,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:05,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:05,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:05,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:05,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:05,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:05,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:05,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:05,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:05,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:05,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:05,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:05,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:05,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:05,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:05,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/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 -> 9a8cb7a54337f31cc721bc63892cae8fcf685402 [2019-11-25 08:57:05,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:05,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:05,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:05,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:05,724 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:05,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-25 08:57:05,775 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/data/e436c4830/e960fb658cc44998939115840cb6ac21/FLAG47667c0c6 [2019-11-25 08:57:06,172 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:06,173 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-25 08:57:06,180 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/data/e436c4830/e960fb658cc44998939115840cb6ac21/FLAG47667c0c6 [2019-11-25 08:57:06,582 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/data/e436c4830/e960fb658cc44998939115840cb6ac21 [2019-11-25 08:57:06,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:06,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:06,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:06,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:06,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:06,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:06,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f7b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06, skipping insertion in model container [2019-11-25 08:57:06,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:06,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:06,644 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:06,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:06,902 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:06,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:06,954 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:06,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06 WrapperNode [2019-11-25 08:57:06,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:06,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:06,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:06,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:06,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:06,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:07,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:07,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:07,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:07,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... [2019-11-25 08:57:07,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:07,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:07,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:07,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:07,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/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 [2019-11-25 08:57:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:07,616 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:07,616 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-25 08:57:07,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:07 BoogieIcfgContainer [2019-11-25 08:57:07,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:07,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:07,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:07,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:07,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:06" (1/3) ... [2019-11-25 08:57:07,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de19c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:07, skipping insertion in model container [2019-11-25 08:57:07,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:06" (2/3) ... [2019-11-25 08:57:07,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de19c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:07, skipping insertion in model container [2019-11-25 08:57:07,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:07" (3/3) ... [2019-11-25 08:57:07,624 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2019-11-25 08:57:07,632 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:07,638 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:07,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:07,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:07,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:07,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:07,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:07,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:07,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:07,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:07,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-25 08:57:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:57:07,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:07,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:07,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:07,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-11-25 08:57:07,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:07,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262986417] [2019-11-25 08:57:07,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262986417] [2019-11-25 08:57:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:07,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:07,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578950086] [2019-11-25 08:57:07,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:07,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:07,904 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-25 08:57:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:07,949 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-11-25 08:57:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:07,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-25 08:57:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:07,963 INFO L225 Difference]: With dead ends: 149 [2019-11-25 08:57:07,964 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 08:57:07,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 08:57:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-25 08:57:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 08:57:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-11-25 08:57:08,020 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-11-25 08:57:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,021 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-11-25 08:57:08,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:08,021 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-11-25 08:57:08,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:08,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:08,024 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-11-25 08:57:08,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760385514] [2019-11-25 08:57:08,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760385514] [2019-11-25 08:57:08,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:08,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:08,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428424447] [2019-11-25 08:57:08,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:08,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:08,142 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-11-25 08:57:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:08,177 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-11-25 08:57:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:08,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-25 08:57:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:08,179 INFO L225 Difference]: With dead ends: 87 [2019-11-25 08:57:08,179 INFO L226 Difference]: Without dead ends: 67 [2019-11-25 08:57:08,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-25 08:57:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-25 08:57:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 08:57:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-11-25 08:57:08,193 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-11-25 08:57:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,194 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-11-25 08:57:08,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-11-25 08:57:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:08,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:08,197 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-11-25 08:57:08,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581787169] [2019-11-25 08:57:08,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581787169] [2019-11-25 08:57:08,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:08,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:08,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258124580] [2019-11-25 08:57:08,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:08,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:08,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:08,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:08,273 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-11-25 08:57:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:08,382 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-11-25 08:57:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:08,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:57:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:08,385 INFO L225 Difference]: With dead ends: 121 [2019-11-25 08:57:08,386 INFO L226 Difference]: Without dead ends: 75 [2019-11-25 08:57:08,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:08,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-25 08:57:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-11-25 08:57:08,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-25 08:57:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-11-25 08:57:08,393 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-11-25 08:57:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,394 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-11-25 08:57:08,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-11-25 08:57:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:57:08,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:08,395 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-11-25 08:57:08,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975143199] [2019-11-25 08:57:08,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975143199] [2019-11-25 08:57:08,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:08,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:08,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100731479] [2019-11-25 08:57:08,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:08,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:08,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:08,470 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-11-25 08:57:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:08,584 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-11-25 08:57:08,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:08,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-25 08:57:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:08,586 INFO L225 Difference]: With dead ends: 155 [2019-11-25 08:57:08,586 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 08:57:08,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 08:57:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-25 08:57:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-11-25 08:57:08,594 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-11-25 08:57:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-11-25 08:57:08,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-11-25 08:57:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-25 08:57:08,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:08,596 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-11-25 08:57:08,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428346463] [2019-11-25 08:57:08,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428346463] [2019-11-25 08:57:08,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:08,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:08,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613928214] [2019-11-25 08:57:08,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:08,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:08,660 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-11-25 08:57:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:08,718 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-25 08:57:08,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:08,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-25 08:57:08,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:08,719 INFO L225 Difference]: With dead ends: 108 [2019-11-25 08:57:08,719 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 08:57:08,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 08:57:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-25 08:57:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 08:57:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-25 08:57:08,725 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-11-25 08:57:08,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,726 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-25 08:57:08,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-11-25 08:57:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-25 08:57:08,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:08,727 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-11-25 08:57:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489580611] [2019-11-25 08:57:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489580611] [2019-11-25 08:57:08,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:08,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:08,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794959290] [2019-11-25 08:57:08,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:08,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:08,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:08,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:08,792 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-11-25 08:57:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:08,891 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-11-25 08:57:08,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:08,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-25 08:57:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:08,893 INFO L225 Difference]: With dead ends: 110 [2019-11-25 08:57:08,893 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:57:08,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:57:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-25 08:57:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-25 08:57:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-11-25 08:57:08,899 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-11-25 08:57:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:08,899 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-11-25 08:57:08,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-11-25 08:57:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:57:08,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:08,901 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:08,902 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:08,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-11-25 08:57:08,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:08,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366360273] [2019-11-25 08:57:08,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366360273] [2019-11-25 08:57:08,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771739479] [2019-11-25 08:57:08,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:09,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:57:09,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:09,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:09,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-25 08:57:09,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865354968] [2019-11-25 08:57:09,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:57:09,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:09,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:57:09,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:09,109 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-11-25 08:57:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:09,210 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-11-25 08:57:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:09,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-25 08:57:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:09,211 INFO L225 Difference]: With dead ends: 133 [2019-11-25 08:57:09,211 INFO L226 Difference]: Without dead ends: 87 [2019-11-25 08:57:09,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:57:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-25 08:57:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-11-25 08:57:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-11-25 08:57:09,221 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-11-25 08:57:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:09,223 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-25 08:57:09,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:57:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-11-25 08:57:09,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 08:57:09,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:09,227 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:09,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:09,431 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:09,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:09,432 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-11-25 08:57:09,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:09,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911471962] [2019-11-25 08:57:09,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:09,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911471962] [2019-11-25 08:57:09,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233987554] [2019-11-25 08:57:09,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:09,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:57:09,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:09,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:09,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-25 08:57:09,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249897632] [2019-11-25 08:57:09,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:57:09,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:57:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:09,658 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-11-25 08:57:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:09,839 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-25 08:57:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:57:09,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-25 08:57:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:09,841 INFO L225 Difference]: With dead ends: 93 [2019-11-25 08:57:09,841 INFO L226 Difference]: Without dead ends: 89 [2019-11-25 08:57:09,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:57:09,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-25 08:57:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-25 08:57:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-11-25 08:57:09,847 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-11-25 08:57:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:09,847 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-25 08:57:09,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:57:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-11-25 08:57:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:57:09,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:09,855 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:10,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:10,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-11-25 08:57:10,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:10,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399767847] [2019-11-25 08:57:10,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399767847] [2019-11-25 08:57:10,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781086678] [2019-11-25 08:57:10,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:10,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:57:10,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:10,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:10,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-11-25 08:57:10,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421601131] [2019-11-25 08:57:10,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:57:10,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:57:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:10,220 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-11-25 08:57:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:10,311 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-25 08:57:10,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:10,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-25 08:57:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:10,313 INFO L225 Difference]: With dead ends: 76 [2019-11-25 08:57:10,313 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 08:57:10,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:57:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 08:57:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-11-25 08:57:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:57:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-11-25 08:57:10,319 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-11-25 08:57:10,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:10,319 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-11-25 08:57:10,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:57:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-11-25 08:57:10,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:57:10,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:10,321 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:10,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:10,525 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-11-25 08:57:10,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:10,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995544056] [2019-11-25 08:57:10,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:10,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995544056] [2019-11-25 08:57:10,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:10,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:57:10,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483574605] [2019-11-25 08:57:10,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:57:10,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:10,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:57:10,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:57:10,600 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-11-25 08:57:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:10,690 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-25 08:57:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:57:10,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-25 08:57:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:10,691 INFO L225 Difference]: With dead ends: 71 [2019-11-25 08:57:10,691 INFO L226 Difference]: Without dead ends: 61 [2019-11-25 08:57:10,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:57:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-25 08:57:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-25 08:57:10,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-11-25 08:57:10,696 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-11-25 08:57:10,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:10,697 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-11-25 08:57:10,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:57:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-11-25 08:57:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 08:57:10,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:10,698 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:10,698 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:10,699 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-11-25 08:57:10,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:10,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932203866] [2019-11-25 08:57:10,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:10,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932203866] [2019-11-25 08:57:10,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548716812] [2019-11-25 08:57:10,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:10,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:57:10,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:10,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:10,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-25 08:57:10,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436504690] [2019-11-25 08:57:10,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:57:10,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:10,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:57:10,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:57:10,929 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-11-25 08:57:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:11,101 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-11-25 08:57:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:57:11,102 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-25 08:57:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:11,103 INFO L225 Difference]: With dead ends: 90 [2019-11-25 08:57:11,103 INFO L226 Difference]: Without dead ends: 65 [2019-11-25 08:57:11,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:57:11,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-25 08:57:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-11-25 08:57:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-25 08:57:11,107 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-11-25 08:57:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:11,107 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-25 08:57:11,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:57:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-25 08:57:11,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 08:57:11,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:11,114 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:11,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:11,321 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:11,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:11,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-11-25 08:57:11,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:11,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980185140] [2019-11-25 08:57:11,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:11,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980185140] [2019-11-25 08:57:11,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017207729] [2019-11-25 08:57:11,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:11,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:57:11,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:11,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:11,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-11-25 08:57:11,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614584990] [2019-11-25 08:57:11,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:57:11,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:57:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-25 08:57:11,534 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 8 states. [2019-11-25 08:57:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:11,719 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-11-25 08:57:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:57:11,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-25 08:57:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:11,721 INFO L225 Difference]: With dead ends: 99 [2019-11-25 08:57:11,721 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 08:57:11,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:57:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 08:57:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-11-25 08:57:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-25 08:57:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-11-25 08:57:11,725 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 41 [2019-11-25 08:57:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:11,725 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-11-25 08:57:11,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:57:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-11-25 08:57:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-25 08:57:11,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:11,726 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:11,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:11,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:11,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1115909698, now seen corresponding path program 1 times [2019-11-25 08:57:11,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:11,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041386734] [2019-11-25 08:57:11,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:12,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041386734] [2019-11-25 08:57:12,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140115697] [2019-11-25 08:57:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:12,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:57:12,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:12,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:12,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:57:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-11-25 08:57:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405354740] [2019-11-25 08:57:12,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:57:12,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:57:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:57:12,196 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2019-11-25 08:57:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:12,456 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-11-25 08:57:12,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 08:57:12,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-11-25 08:57:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:12,456 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:57:12,456 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:57:12,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:57:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:57:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:57:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:57:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:57:12,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-25 08:57:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:12,458 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:57:12,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:57:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:57:12,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:57:12,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:12,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-11-25 08:57:12,832 INFO L444 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-11-25 08:57:12,833 INFO L440 ceAbstractionStarter]: At program point L69(lines 18 71) the Hoare annotation is: (and (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-25 08:57:12,833 INFO L440 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,833 INFO L440 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,833 INFO L440 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,833 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:57:12,833 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-11-25 08:57:12,833 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-11-25 08:57:12,833 INFO L440 ceAbstractionStarter]: At program point L70(lines 14 72) the Hoare annotation is: (and (= 0 |ULTIMATE.start_base2flt_#res|) (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-25 08:57:12,833 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L444 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L444 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L444 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-11-25 08:57:12,834 INFO L440 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,834 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L440 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-11-25 08:57:12,835 INFO L444 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L440 ceAbstractionStarter]: At program point L207(lines 137 209) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 |ULTIMATE.start_mulflt_#res|) (= 0 ULTIMATE.start_main_~zero~0)) (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sa~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L444 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-11-25 08:57:12,836 INFO L440 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-11-25 08:57:12,836 INFO L440 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,836 INFO L440 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,837 INFO L440 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,837 INFO L440 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-11-25 08:57:12,837 INFO L440 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-11-25 08:57:12,837 INFO L440 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,837 INFO L440 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-25 08:57:12,837 INFO L444 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-11-25 08:57:12,837 INFO L447 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-11-25 08:57:12,837 INFO L444 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,837 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,837 INFO L444 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,837 INFO L444 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-11-25 08:57:12,838 INFO L447 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-11-25 08:57:12,838 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-11-25 08:57:12,839 INFO L444 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-11-25 08:57:12,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:57:12 BoogieIcfgContainer [2019-11-25 08:57:12,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:57:12,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:57:12,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:57:12,858 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:57:12,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:07" (3/4) ... [2019-11-25 08:57:12,862 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:57:12,885 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 08:57:12,887 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-25 08:57:12,934 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-11-25 08:57:12,937 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 [2019-11-25 08:57:12,996 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e1eea995-0091-4e63-ab94-c06ed26a87f9/bin/uautomizer/witness.graphml [2019-11-25 08:57:12,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:57:12,998 INFO L168 Benchmark]: Toolchain (without parser) took 6412.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 950.1 MB in the beginning and 994.7 MB in the end (delta: -44.6 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:12,999 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:12,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 368.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:12,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.24 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. [2019-11-25 08:57:13,000 INFO L168 Benchmark]: Boogie Preprocessor took 57.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:13,000 INFO L168 Benchmark]: RCFGBuilder took 533.61 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:13,001 INFO L168 Benchmark]: TraceAbstraction took 5238.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:13,001 INFO L168 Benchmark]: Witness Printer took 138.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:13,003 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 368.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.24 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. * Boogie Preprocessor took 57.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.61 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: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5238.99 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 77.3 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * Witness Printer took 138.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * 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: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 == m && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sa) || (0 == __retres10 && 0 == zero)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1046 SDtfs, 383 SDslu, 2280 SDs, 0 SdLazy, 784 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 63 NumberOfFragments, 114 HoareAnnotationTreeSize, 24 FomulaSimplifications, 590 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 633 ConstructedInterpolants, 1 QuantifiedInterpolants, 44266 SizeOfPredicates, 35 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 18/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...