./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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 7e1b4e42babcfba0789bfa7cb90840c832d315a4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:50:10,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:50:10,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:50:10,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:50:10,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:50:10,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:50:10,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:50:10,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:50:10,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:50:10,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:50:10,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:50:10,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:50:10,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:50:10,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:50:10,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:50:10,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:50:10,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:50:10,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:50:10,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:50:10,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:50:10,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:50:10,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:50:10,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:50:10,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:50:10,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:50:10,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:50:10,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:50:10,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:50:10,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:50:10,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:50:10,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:50:10,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:50:10,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:50:10,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:50:10,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:50:10,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:50:10,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:50:10,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:50:10,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:50:10,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:50:10,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:50:10,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:50:10,529 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:50:10,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:50:10,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:50:10,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:50:10,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:50:10,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:50:10,531 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:50:10,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:50:10,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:50:10,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:50:10,532 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:50:10,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:50:10,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:50:10,533 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:50:10,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:50:10,534 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:50:10,535 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:50:10,535 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:50:10,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:50:10,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:50:10,536 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:50:10,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:50:10,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:50:10,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:50:10,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:50:10,537 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:50:10,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:50:10,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:50:10,538 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_8274f2e1-b1c3-4123-b875-dac7fa52778c/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 -> 7e1b4e42babcfba0789bfa7cb90840c832d315a4 [2019-11-15 23:50:10,565 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:50:10,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:50:10,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:50:10,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:50:10,580 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:50:10,581 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-11-15 23:50:10,642 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/data/85399e0fd/591f4781c320440c9a5a613daaff2d2d/FLAGc792144e9 [2019-11-15 23:50:11,040 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:50:11,041 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-11-15 23:50:11,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/data/85399e0fd/591f4781c320440c9a5a613daaff2d2d/FLAGc792144e9 [2019-11-15 23:50:11,479 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/data/85399e0fd/591f4781c320440c9a5a613daaff2d2d [2019-11-15 23:50:11,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:50:11,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:50:11,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:11,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:50:11,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:50:11,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b43a16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11, skipping insertion in model container [2019-11-15 23:50:11,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:50:11,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:50:11,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:11,794 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:50:11,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:50:11,856 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:50:11,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11 WrapperNode [2019-11-15 23:50:11,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:50:11,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:11,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:50:11,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:50:11,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:50:11,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:50:11,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:50:11,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:50:11,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... [2019-11-15 23:50:11,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:50:11,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:50:11,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:50:11,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:50:11,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:12,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:50:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:50:12,449 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:50:12,449 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-15 23:50:12,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:12 BoogieIcfgContainer [2019-11-15 23:50:12,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:50:12,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:50:12,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:50:12,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:50:12,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:50:11" (1/3) ... [2019-11-15 23:50:12,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653f33aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:12, skipping insertion in model container [2019-11-15 23:50:12,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:50:11" (2/3) ... [2019-11-15 23:50:12,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653f33aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:50:12, skipping insertion in model container [2019-11-15 23:50:12,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:12" (3/3) ... [2019-11-15 23:50:12,458 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2019-11-15 23:50:12,467 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:50:12,474 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:50:12,483 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:50:12,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:50:12,505 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:50:12,505 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:50:12,505 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:50:12,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:50:12,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:50:12,505 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:50:12,505 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:50:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-15 23:50:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:50:12,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:12,526 INFO L380 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-15 23:50:12,528 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:12,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-11-15 23:50:12,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:12,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767361919] [2019-11-15 23:50:12,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:12,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:12,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:12,708 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-15 23:50:12,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767361919] [2019-11-15 23:50:12,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:12,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:12,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194696385] [2019-11-15 23:50:12,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:12,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:12,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:12,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:12,725 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-15 23:50:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:12,776 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-11-15 23:50:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:12,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:50:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:12,800 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:50:12,800 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 23:50:12,803 INFO L600 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-15 23:50:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 23:50:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-15 23:50:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 23:50:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-11-15 23:50:12,850 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-11-15 23:50:12,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:12,851 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-11-15 23:50:12,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-11-15 23:50:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:50:12,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:12,852 INFO L380 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-15 23:50:12,853 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-11-15 23:50:12,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:12,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724025186] [2019-11-15 23:50:12,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:12,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:12,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:12,970 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-15 23:50:12,970 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724025186] [2019-11-15 23:50:12,970 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:12,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:12,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980227583] [2019-11-15 23:50:12,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:12,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:12,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:12,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:12,973 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-11-15 23:50:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,017 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-11-15 23:50:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:13,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-15 23:50:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:13,019 INFO L225 Difference]: With dead ends: 87 [2019-11-15 23:50:13,019 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 23:50:13,020 INFO L600 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-15 23:50:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 23:50:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-15 23:50:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 23:50:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-11-15 23:50:13,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-11-15 23:50:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:13,028 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-11-15 23:50:13,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-11-15 23:50:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:50:13,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:13,030 INFO L380 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-15 23:50:13,030 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-11-15 23:50:13,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:13,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045599116] [2019-11-15 23:50:13,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,096 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-15 23:50:13,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045599116] [2019-11-15 23:50:13,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:13,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:13,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893916971] [2019-11-15 23:50:13,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:13,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:13,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:13,098 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-11-15 23:50:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,203 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-11-15 23:50:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:13,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 23:50:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:13,205 INFO L225 Difference]: With dead ends: 121 [2019-11-15 23:50:13,205 INFO L226 Difference]: Without dead ends: 75 [2019-11-15 23:50:13,206 INFO L600 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-15 23:50:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-15 23:50:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-11-15 23:50:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 23:50:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-11-15 23:50:13,213 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-11-15 23:50:13,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:13,213 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-11-15 23:50:13,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:13,214 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-11-15 23:50:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:50:13,215 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:13,215 INFO L380 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-15 23:50:13,215 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-11-15 23:50:13,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:13,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437589682] [2019-11-15 23:50:13,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,260 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-15 23:50:13,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437589682] [2019-11-15 23:50:13,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:13,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:13,260 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674469311] [2019-11-15 23:50:13,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:13,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:13,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:13,261 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-11-15 23:50:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,381 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-11-15 23:50:13,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:13,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-15 23:50:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:13,384 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:50:13,385 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 23:50:13,385 INFO L600 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-15 23:50:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 23:50:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-15 23:50:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-11-15 23:50:13,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-11-15 23:50:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:13,403 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-11-15 23:50:13,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-11-15 23:50:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:50:13,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:13,405 INFO L380 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-15 23:50:13,405 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-11-15 23:50:13,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:13,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046248534] [2019-11-15 23:50:13,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,518 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-15 23:50:13,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046248534] [2019-11-15 23:50:13,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:13,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:50:13,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506715139] [2019-11-15 23:50:13,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:50:13,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:13,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:50:13,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:50:13,520 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-11-15 23:50:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,587 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-15 23:50:13,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:50:13,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-15 23:50:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:13,588 INFO L225 Difference]: With dead ends: 108 [2019-11-15 23:50:13,588 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:50:13,589 INFO L600 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-15 23:50:13,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:50:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 23:50:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:50:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-15 23:50:13,600 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-11-15 23:50:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:13,600 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-15 23:50:13,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:50:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-11-15 23:50:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:50:13,603 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:13,604 INFO L380 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-15 23:50:13,604 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:13,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:13,605 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-11-15 23:50:13,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:13,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742796125] [2019-11-15 23:50:13,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,687 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-15 23:50:13,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742796125] [2019-11-15 23:50:13,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:13,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:50:13,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169923075] [2019-11-15 23:50:13,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:50:13,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:13,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:50:13,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:50:13,688 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-11-15 23:50:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:13,776 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-11-15 23:50:13,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:50:13,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 23:50:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:13,777 INFO L225 Difference]: With dead ends: 110 [2019-11-15 23:50:13,777 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 23:50:13,778 INFO L600 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-15 23:50:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 23:50:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-15 23:50:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-15 23:50:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-11-15 23:50:13,784 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-11-15 23:50:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:13,784 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-11-15 23:50:13,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:50:13,785 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-11-15 23:50:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:50:13,786 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:13,786 INFO L380 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-15 23:50:13,786 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:13,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-11-15 23:50:13,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:13,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392840282] [2019-11-15 23:50:13,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:13,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,830 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-15 23:50:13,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392840282] [2019-11-15 23:50:13,831 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682474714] [2019-11-15 23:50:13,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:13,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 23:50:13,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:13,927 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-15 23:50:13,928 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:50:13,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-15 23:50:13,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441444410] [2019-11-15 23:50:13,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:50:13,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:13,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:50:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:50:13,932 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-11-15 23:50:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:14,030 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-11-15 23:50:14,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:50:14,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-15 23:50:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:14,032 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:50:14,032 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 23:50:14,033 INFO L600 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-15 23:50:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 23:50:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-11-15 23:50:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-11-15 23:50:14,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-11-15 23:50:14,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:14,043 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-15 23:50:14,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:50:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-11-15 23:50:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:50:14,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:14,047 INFO L380 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-15 23:50:14,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:14,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-11-15 23:50:14,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:14,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597394578] [2019-11-15 23:50:14,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:14,364 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-15 23:50:14,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597394578] [2019-11-15 23:50:14,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836177923] [2019-11-15 23:50:14,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:14,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:50:14,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:14,484 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-15 23:50:14,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:14,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-15 23:50:14,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209052962] [2019-11-15 23:50:14,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:50:14,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:50:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:50:14,487 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-11-15 23:50:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:14,669 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-15 23:50:14,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:50:14,669 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-15 23:50:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:14,670 INFO L225 Difference]: With dead ends: 93 [2019-11-15 23:50:14,671 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 23:50:14,671 INFO L600 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-15 23:50:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 23:50:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-15 23:50:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-11-15 23:50:14,677 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-11-15 23:50:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:14,677 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-15 23:50:14,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:50:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-11-15 23:50:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:50:14,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:14,684 INFO L380 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-15 23:50:14,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:14,890 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:14,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-11-15 23:50:14,890 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:14,890 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 23:50:14,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:14,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:14,960 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-15 23:50:14,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037799858] [2019-11-15 23:50:14,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074121929] [2019-11-15 23:50:14,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:15,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:50:15,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:15,083 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-15 23:50:15,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:15,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-11-15 23:50:15,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280210715] [2019-11-15 23:50:15,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:50:15,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:50:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:50:15,086 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-11-15 23:50:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:15,173 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-15 23:50:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:50:15,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-15 23:50:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:15,174 INFO L225 Difference]: With dead ends: 76 [2019-11-15 23:50:15,174 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:50:15,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:50:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:50:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-11-15 23:50:15,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 23:50:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-11-15 23:50:15,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-11-15 23:50:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:15,180 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-11-15 23:50:15,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:50:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-11-15 23:50:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:50:15,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:15,181 INFO L380 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-15 23:50:15,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:15,385 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-11-15 23:50:15,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:15,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008663493] [2019-11-15 23:50:15,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:15,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:15,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:15,430 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-15 23:50:15,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008663493] [2019-11-15 23:50:15,431 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:50:15,431 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:50:15,431 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888792469] [2019-11-15 23:50:15,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:50:15,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:50:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:50:15,432 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-11-15 23:50:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:15,505 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-15 23:50:15,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:50:15,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-15 23:50:15,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:15,506 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:50:15,506 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 23:50:15,506 INFO L600 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-15 23:50:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 23:50:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-15 23:50:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-11-15 23:50:15,509 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-11-15 23:50:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:15,510 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-11-15 23:50:15,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:50:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-11-15 23:50:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 23:50:15,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:15,510 INFO L380 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-15 23:50:15,511 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-11-15 23:50:15,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:15,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209004513] [2019-11-15 23:50:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:15,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:15,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:15,584 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-15 23:50:15,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209004513] [2019-11-15 23:50:15,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716772494] [2019-11-15 23:50:15,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:15,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:50:15,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:15,698 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-15 23:50:15,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:15,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-15 23:50:15,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105172238] [2019-11-15 23:50:15,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:50:15,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:50:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:50:15,700 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-11-15 23:50:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:15,887 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-11-15 23:50:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:50:15,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-15 23:50:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:15,888 INFO L225 Difference]: With dead ends: 90 [2019-11-15 23:50:15,889 INFO L226 Difference]: Without dead ends: 65 [2019-11-15 23:50:15,889 INFO L600 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-15 23:50:15,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-15 23:50:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-11-15 23:50:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-15 23:50:15,893 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-11-15 23:50:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:15,893 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-15 23:50:15,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:50:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-15 23:50:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:50:15,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:15,894 INFO L380 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-15 23:50:16,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:16,105 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-11-15 23:50:16,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:16,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859127050] [2019-11-15 23:50:16,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:16,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:16,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:16,193 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-15 23:50:16,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859127050] [2019-11-15 23:50:16,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666867086] [2019-11-15 23:50:16,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:16,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:50:16,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:16,359 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-15 23:50:16,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:16,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-11-15 23:50:16,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508976429] [2019-11-15 23:50:16,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:50:16,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:50:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:50:16,361 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 9 states. [2019-11-15 23:50:16,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:16,570 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-11-15 23:50:16,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:50:16,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-15 23:50:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:16,571 INFO L225 Difference]: With dead ends: 91 [2019-11-15 23:50:16,571 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 23:50:16,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:50:16,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 23:50:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-15 23:50:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 23:50:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2019-11-15 23:50:16,575 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 41 [2019-11-15 23:50:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:16,576 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-11-15 23:50:16,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:50:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2019-11-15 23:50:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:50:16,576 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:50:16,577 INFO L380 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-15 23:50:16,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:16,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:50:16,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:50:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1516783191, now seen corresponding path program 1 times [2019-11-15 23:50:16,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:50:16,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005168096] [2019-11-15 23:50:16,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:16,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:50:16,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:50:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:16,877 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-15 23:50:16,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005168096] [2019-11-15 23:50:16,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942878075] [2019-11-15 23:50:16,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/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-15 23:50:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:50:16,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 23:50:16,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:50:17,035 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-15 23:50:17,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:50:17,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2019-11-15 23:50:17,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057823535] [2019-11-15 23:50:17,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:50:17,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:50:17,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:50:17,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:50:17,037 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2019-11-15 23:50:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:50:17,207 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-11-15 23:50:17,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:50:17,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-15 23:50:17,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:50:17,208 INFO L225 Difference]: With dead ends: 66 [2019-11-15 23:50:17,208 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:50:17,209 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:50:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:50:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:50:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:50:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:50:17,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-15 23:50:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:50:17,210 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:50:17,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:50:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:50:17,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:50:17,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:50:17,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:50:17,528 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-11-15 23:50:17,529 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-11-15 23:50:17,530 INFO L439 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-15 23:50:17,530 INFO L439 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,530 INFO L439 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,530 INFO L439 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,530 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:50:17,530 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-11-15 23:50:17,530 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-11-15 23:50:17,530 INFO L439 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-15 23:50:17,530 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L439 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-11-15 23:50:17,531 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L439 ceAbstractionStarter]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sb~0)) (<= (+ ULTIMATE.start_main_~sb~0 1) 0) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0))) [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L439 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_~sb~0)) (<= (+ ULTIMATE.start_main_~sb~0 1) 0)) [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-11-15 23:50:17,532 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-11-15 23:50:17,533 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-11-15 23:50:17,533 INFO L443 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,533 INFO L439 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-15 23:50:17,533 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-11-15 23:50:17,533 INFO L446 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-11-15 23:50:17,533 INFO L443 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,533 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-11-15 23:50:17,534 INFO L446 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-11-15 23:50:17,534 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-11-15 23:50:17,535 INFO L443 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-11-15 23:50:17,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:50:17 BoogieIcfgContainer [2019-11-15 23:50:17,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:50:17,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:50:17,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:50:17,558 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:50:17,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:50:12" (3/4) ... [2019-11-15 23:50:17,563 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:50:17,585 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-15 23:50:17,586 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-15 23:50:17,618 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-11-15 23:50:17,621 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sb)) || sb + 1 <= 0 [2019-11-15 23:50:17,692 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8274f2e1-b1c3-4123-b875-dac7fa52778c/bin/uautomizer/witness.graphml [2019-11-15 23:50:17,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:50:17,695 INFO L168 Benchmark]: Toolchain (without parser) took 6210.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.1 MB in the beginning and 874.2 MB in the end (delta: 75.9 MB). Peak memory consumption was 222.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,695 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:50:17,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,696 INFO L168 Benchmark]: Boogie Preprocessor took 29.52 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-15 23:50:17,696 INFO L168 Benchmark]: RCFGBuilder took 519.45 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,697 INFO L168 Benchmark]: TraceAbstraction took 5105.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.0 MB in the end (delta: 220.1 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,697 INFO L168 Benchmark]: Witness Printer took 134.93 ms. Allocated memory is still 1.2 GB. Free memory was 881.0 MB in the beginning and 874.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:50:17,699 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 519.45 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5105.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.0 MB in the end (delta: 220.1 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. * Witness Printer took 134.93 ms. Allocated memory is still 1.2 GB. Free memory was 881.0 MB in the beginning and 874.2 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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 <= sb)) || sb + 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 <= sb) || sb + 1 <= 0) || (0 == __retres10 && 0 == zero) - 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.0s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1042 SDtfs, 434 SDslu, 2213 SDs, 0 SdLazy, 814 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 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, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 60 NumberOfFragments, 114 HoareAnnotationTreeSize, 24 FomulaSimplifications, 953 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 43726 SizeOfPredicates, 33 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 86 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...