./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/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:47,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:47,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:47,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:47,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:47,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:47,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:47,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:47,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:47,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:47,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:47,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:47,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:47,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:47,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:47,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:47,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:47,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:47,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:47,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:47,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:47,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:47,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:47,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:47,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:47,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:47,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:47,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:47,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:47,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:47,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:47,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:47,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:47,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:47,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:47,047 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:47,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:47,048 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:47,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:47,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:47,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:47,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:47,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:47,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:47,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:47,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:47,062 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:47,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:47,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:47,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:47,063 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:47,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:47,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:47,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:47,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:47,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:47,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:47,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:47,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:47,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:47,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:47,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:47,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:47,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:47,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:47,066 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/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:47,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:47,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:47,114 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:47,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:47,116 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:47,117 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-10-22 08:54:47,169 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/data/8fa9343ac/2ef5a4ae853644f09442507cdf8818d6/FLAGd618df75b [2019-10-22 08:54:47,561 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:47,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-10-22 08:54:47,569 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/data/8fa9343ac/2ef5a4ae853644f09442507cdf8818d6/FLAGd618df75b [2019-10-22 08:54:47,580 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/data/8fa9343ac/2ef5a4ae853644f09442507cdf8818d6 [2019-10-22 08:54:47,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:47,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:47,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:47,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:47,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:47,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411f8c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47, skipping insertion in model container [2019-10-22 08:54:47,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:47,620 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:47,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:47,855 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:47,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:47,909 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:47,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47 WrapperNode [2019-10-22 08:54:47,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:47,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:47,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:47,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:47,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:47,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:47,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:47,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:47,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:47,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:48,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:48,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:48,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... [2019-10-22 08:54:48,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:48,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:48,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:48,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:48,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:48,627 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:48,628 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-10-22 08:54:48,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48 BoogieIcfgContainer [2019-10-22 08:54:48,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:48,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:48,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:48,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:48,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:47" (1/3) ... [2019-10-22 08:54:48,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ff906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:47" (2/3) ... [2019-10-22 08:54:48,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ff906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48" (3/3) ... [2019-10-22 08:54:48,637 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2019-10-22 08:54:48,644 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:48,650 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:48,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:48,676 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:48,676 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:48,676 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:48,676 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:48,677 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:48,677 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:48,677 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:48,677 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-10-22 08:54:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:54:48,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,702 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-10-22 08:54:48,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:48,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,710 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-10-22 08:54:48,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3060689] [2019-10-22 08:54:48,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:48,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3060689] [2019-10-22 08:54:48,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:48,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:48,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449325229] [2019-10-22 08:54:48,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:48,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:48,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:48,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:48,881 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-10-22 08:54:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:48,914 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-10-22 08:54:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:48,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:54:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:48,926 INFO L225 Difference]: With dead ends: 149 [2019-10-22 08:54:48,927 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:54:48,930 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-10-22 08:54:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:54:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 08:54:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:54:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-10-22 08:54:48,966 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-10-22 08:54:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:48,967 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-10-22 08:54:48,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:48,967 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-10-22 08:54:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:54:48,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:48,968 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-10-22 08:54:48,968 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-10-22 08:54:48,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:48,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113875671] [2019-10-22 08:54:48,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:48,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113875671] [2019-10-22 08:54:49,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:49,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135908040] [2019-10-22 08:54:49,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:49,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:49,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:49,024 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-10-22 08:54:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,052 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-10-22 08:54:49,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:49,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-22 08:54:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,053 INFO L225 Difference]: With dead ends: 87 [2019-10-22 08:54:49,053 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:54:49,054 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-10-22 08:54:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:54:49,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 08:54:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:54:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-10-22 08:54:49,068 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-10-22 08:54:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,069 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-10-22 08:54:49,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-10-22 08:54:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:54:49,069 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,070 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-10-22 08:54:49,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-10-22 08:54:49,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453461118] [2019-10-22 08:54:49,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453461118] [2019-10-22 08:54:49,170 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,170 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292989730] [2019-10-22 08:54:49,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:49,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,171 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-10-22 08:54:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,320 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-10-22 08:54:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:54:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,321 INFO L225 Difference]: With dead ends: 121 [2019-10-22 08:54:49,322 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 08:54:49,322 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-10-22 08:54:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 08:54:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-10-22 08:54:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:54:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-10-22 08:54:49,328 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-10-22 08:54:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,329 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-10-22 08:54:49,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-10-22 08:54:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:54:49,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,330 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-10-22 08:54:49,330 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-10-22 08:54:49,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140179870] [2019-10-22 08:54:49,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140179870] [2019-10-22 08:54:49,395 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:49,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369840106] [2019-10-22 08:54:49,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:49,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:49,397 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-10-22 08:54:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,505 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-10-22 08:54:49,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:49,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-22 08:54:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,506 INFO L225 Difference]: With dead ends: 155 [2019-10-22 08:54:49,506 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 08:54:49,507 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-10-22 08:54:49,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 08:54:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-10-22 08:54:49,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-10-22 08:54:49,513 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-10-22 08:54:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,514 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-10-22 08:54:49,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-10-22 08:54:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:54:49,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,515 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-10-22 08:54:49,515 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-10-22 08:54:49,516 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,516 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536486661] [2019-10-22 08:54:49,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,580 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536486661] [2019-10-22 08:54:49,580 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:49,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985560368] [2019-10-22 08:54:49,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:49,581 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:49,582 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-10-22 08:54:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,626 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-10-22 08:54:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:49,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 08:54:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,627 INFO L225 Difference]: With dead ends: 108 [2019-10-22 08:54:49,627 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 08:54:49,628 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-10-22 08:54:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 08:54:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-22 08:54:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 08:54:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-10-22 08:54:49,633 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-10-22 08:54:49,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,633 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-10-22 08:54:49,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-10-22 08:54:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:54:49,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,634 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-10-22 08:54:49,635 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-10-22 08:54:49,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636193764] [2019-10-22 08:54:49,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636193764] [2019-10-22 08:54:49,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:49,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:49,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719136813] [2019-10-22 08:54:49,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:49,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:49,706 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-10-22 08:54:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:49,781 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-10-22 08:54:49,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:49,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 08:54:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:49,784 INFO L225 Difference]: With dead ends: 110 [2019-10-22 08:54:49,784 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:54:49,785 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-10-22 08:54:49,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:54:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-10-22 08:54:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 08:54:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-10-22 08:54:49,793 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-10-22 08:54:49,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:49,794 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-10-22 08:54:49,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-10-22 08:54:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:54:49,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:49,795 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-10-22 08:54:49,795 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-10-22 08:54:49,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:49,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232136422] [2019-10-22 08:54:49,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:49,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232136422] [2019-10-22 08:54:49,859 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936689849] [2019-10-22 08:54:49,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:49,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:54:49,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:49,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:54:49,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-22 08:54:49,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387816624] [2019-10-22 08:54:49,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:49,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:49,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:49,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:49,944 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-10-22 08:54:50,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:50,035 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-10-22 08:54:50,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:50,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 08:54:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:50,037 INFO L225 Difference]: With dead ends: 133 [2019-10-22 08:54:50,037 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 08:54:50,038 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-10-22 08:54:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 08:54:50,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-10-22 08:54:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-10-22 08:54:50,046 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-10-22 08:54:50,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:50,046 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-10-22 08:54:50,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-10-22 08:54:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:54:50,047 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,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-10-22 08:54:50,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,249 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,250 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-10-22 08:54:50,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820979460] [2019-10-22 08:54:50,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820979460] [2019-10-22 08:54:50,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140751537] [2019-10-22 08:54:50,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:50,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:50,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-10-22 08:54:50,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480484139] [2019-10-22 08:54:50,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:50,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:50,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:50,442 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-10-22 08:54:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:50,589 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-10-22 08:54:50,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:50,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-22 08:54:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:50,591 INFO L225 Difference]: With dead ends: 93 [2019-10-22 08:54:50,591 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 08:54:50,591 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-10-22 08:54:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 08:54:50,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-22 08:54:50,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:50,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-10-22 08:54:50,597 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-10-22 08:54:50,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:50,598 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-10-22 08:54:50,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-10-22 08:54:50,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:50,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,599 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-10-22 08:54:50,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:50,800 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:50,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-10-22 08:54:50,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155385922] [2019-10-22 08:54:50,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:50,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155385922] [2019-10-22 08:54:50,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590907590] [2019-10-22 08:54:50,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:50,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:54:50,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:50,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:50,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-10-22 08:54:50,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084812323] [2019-10-22 08:54:50,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:50,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:50,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:50,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:54:50,962 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-10-22 08:54:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,053 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-22 08:54:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:51,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 08:54:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,054 INFO L225 Difference]: With dead ends: 76 [2019-10-22 08:54:51,054 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 08:54:51,055 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:54:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 08:54:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-10-22 08:54:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:54:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-10-22 08:54:51,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-10-22 08:54:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,064 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-10-22 08:54:51,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-10-22 08:54:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:51,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,069 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-10-22 08:54:51,271 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:51,271 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-10-22 08:54:51,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115733956] [2019-10-22 08:54:51,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:51,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115733956] [2019-10-22 08:54:51,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:51,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111600538] [2019-10-22 08:54:51,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:51,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:51,323 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-10-22 08:54:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,390 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-10-22 08:54:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:54:51,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 08:54:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,392 INFO L225 Difference]: With dead ends: 71 [2019-10-22 08:54:51,392 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 08:54:51,392 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-10-22 08:54:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 08:54:51,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-22 08:54:51,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-10-22 08:54:51,396 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-10-22 08:54:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,397 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-10-22 08:54:51,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-10-22 08:54:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:54:51,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,398 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-10-22 08:54:51,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,399 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-10-22 08:54:51,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004184538] [2019-10-22 08:54:51,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004184538] [2019-10-22 08:54:51,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473351413] [2019-10-22 08:54:51,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:54:51,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:51,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:51,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-22 08:54:51,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345994895] [2019-10-22 08:54:51,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:51,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:51,556 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-10-22 08:54:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,703 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-10-22 08:54:51,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:54:51,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-10-22 08:54:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,704 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:54:51,705 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 08:54:51,705 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-10-22 08:54:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 08:54:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-10-22 08:54:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-10-22 08:54:51,709 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-10-22 08:54:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,709 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-10-22 08:54:51,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-10-22 08:54:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:54:51,710 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,710 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-10-22 08:54:51,910 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:51,911 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:51,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-10-22 08:54:51,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417835025] [2019-10-22 08:54:51,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417835025] [2019-10-22 08:54:51,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161378587] [2019-10-22 08:54:51,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:52,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:52,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-10-22 08:54:52,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757085232] [2019-10-22 08:54:52,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:54:52,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:54:52,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:54:52,127 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 9 states. [2019-10-22 08:54:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,302 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-10-22 08:54:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:54:52,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-10-22 08:54:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,303 INFO L225 Difference]: With dead ends: 91 [2019-10-22 08:54:52,304 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:54:52,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:54:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:54:52,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-10-22 08:54:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:54:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2019-10-22 08:54:52,307 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 41 [2019-10-22 08:54:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,308 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-10-22 08:54:52,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:54:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2019-10-22 08:54:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:54:52,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,308 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-10-22 08:54:52,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:52,514 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1516783191, now seen corresponding path program 1 times [2019-10-22 08:54:52,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915285376] [2019-10-22 08:54:52,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,515 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915285376] [2019-10-22 08:54:52,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900977403] [2019-10-22 08:54:52,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/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-10-22 08:54:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:54:52,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:54:52,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:54:52,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:54:52,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2019-10-22 08:54:52,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33673418] [2019-10-22 08:54:52,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:54:52,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:54:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:54:52,692 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2019-10-22 08:54:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,839 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-10-22 08:54:52,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:54:52,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-22 08:54:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,841 INFO L225 Difference]: With dead ends: 66 [2019-10-22 08:54:52,841 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:54:52,841 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-10-22 08:54:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:54:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:54:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:54:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:54:52,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-10-22 08:54:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,842 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:52,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:54:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:52,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:54:53,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:54:53,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:54:53,160 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:54:53,161 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:54:53,161 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-10-22 08:54:53,162 INFO L439 ceAbstractionStarter]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,162 INFO L439 ceAbstractionStarter]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,162 INFO L439 ceAbstractionStarter]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,162 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:54:53,162 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-10-22 08:54:53,162 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-10-22 08:54:53,162 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-10-22 08:54:53,162 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:54:53,162 INFO L439 ceAbstractionStarter]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,162 INFO L439 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-10-22 08:54:53,163 INFO L439 ceAbstractionStarter]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:54:53,163 INFO L439 ceAbstractionStarter]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,163 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:54:53,163 INFO L439 ceAbstractionStarter]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:54:53,163 INFO L439 ceAbstractionStarter]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-10-22 08:54:53,163 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-10-22 08:54:53,164 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-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:54:53,164 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-10-22 08:54:53,164 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-10-22 08:54:53,165 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-10-22 08:54:53,165 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:54:53,165 INFO L443 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:54:53,167 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:54:53,167 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:54:53,167 INFO L443 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-10-22 08:54:53,167 INFO L439 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-10-22 08:54:53,168 INFO L439 ceAbstractionStarter]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,168 INFO L439 ceAbstractionStarter]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L446 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-10-22 08:54:53,168 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L446 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-10-22 08:54:53,169 INFO L443 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-10-22 08:54:53,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:53 BoogieIcfgContainer [2019-10-22 08:54:53,189 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:53,190 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:53,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:53,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:53,191 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:48" (3/4) ... [2019-10-22 08:54:53,195 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:54:53,211 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-10-22 08:54:53,211 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 08:54:53,239 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-10-22 08:54:53,241 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sb)) || sb + 1 <= 0 [2019-10-22 08:54:53,304 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1e18c7cc-072b-4c11-a501-147d39095f76/bin/uautomizer/witness.graphml [2019-10-22 08:54:53,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:53,308 INFO L168 Benchmark]: Toolchain (without parser) took 5724.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 944.5 MB in the beginning and 982.4 MB in the end (delta: -37.9 MB). Peak memory consumption was 170.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,308 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:53,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,309 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.43 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-10-22 08:54:53,309 INFO L168 Benchmark]: Boogie Preprocessor took 52.42 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,309 INFO L168 Benchmark]: RCFGBuilder took 601.91 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,310 INFO L168 Benchmark]: TraceAbstraction took 4560.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 992.6 MB in the end (delta: 98.6 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,310 INFO L168 Benchmark]: Witness Printer took 116.02 ms. Allocated memory is still 1.2 GB. Free memory was 992.6 MB in the beginning and 982.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:53,312 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.42 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 601.91 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: 36.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4560.11 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 992.6 MB in the end (delta: 98.6 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. * Witness Printer took 116.02 ms. Allocated memory is still 1.2 GB. Free memory was 992.6 MB in the beginning and 982.4 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 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: 4.4s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1042 SDtfs, 434 SDslu, 2213 SDs, 0 SdLazy, 814 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s 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.0s 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.3s SatisfiabilityAnalysisTime, 0.9s 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...