./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8cb7a54337f31cc721bc63892cae8fcf685402 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:57:18,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:18,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:18,119 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:18,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:18,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:18,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:18,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:18,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:18,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:18,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:18,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:18,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:18,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:18,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:18,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:18,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:18,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:18,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:18,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:18,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:18,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:18,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:18,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:18,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:18,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:18,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:18,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:18,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:18,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:18,144 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:18,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:18,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:18,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:18,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:18,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:18,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:18,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:18,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:18,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:18,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:18,150 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:18,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:18,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:18,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:18,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:18,163 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:18,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:18,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:18,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:18,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:18,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:18,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:18,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:18,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:18,165 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:18,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:18,165 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:18,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:18,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:18,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:18,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:18,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:18,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:18,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:18,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:18,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:18,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:18,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:18,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:18,168 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_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8cb7a54337f31cc721bc63892cae8fcf685402 [2019-10-22 08:57:18,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:18,205 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:18,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:18,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:18,210 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:18,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-10-22 08:57:18,267 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/data/5078e1fd5/78034def6b9f4a85807054260ae54e37/FLAG9d0560f8a [2019-10-22 08:57:18,663 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:18,663 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-10-22 08:57:18,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/data/5078e1fd5/78034def6b9f4a85807054260ae54e37/FLAG9d0560f8a [2019-10-22 08:57:19,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/data/5078e1fd5/78034def6b9f4a85807054260ae54e37 [2019-10-22 08:57:19,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:19,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:19,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:19,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:19,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:19,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551655be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19, skipping insertion in model container [2019-10-22 08:57:19,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,059 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:19,087 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:19,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:19,375 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:19,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:19,433 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:19,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19 WrapperNode [2019-10-22 08:57:19,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:19,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:19,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:19,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:19,444 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:57:19" (1/1) ... [2019-10-22 08:57:19,451 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:57:19" (1/1) ... [2019-10-22 08:57:19,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:19,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:19,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:19,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:19,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... [2019-10-22 08:57:19,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:19,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:19,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:19,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:19,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:20,004 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:20,004 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-10-22 08:57:20,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:20 BoogieIcfgContainer [2019-10-22 08:57:20,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:20,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:20,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:20,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:20,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:19" (1/3) ... [2019-10-22 08:57:20,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb0b627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:20, skipping insertion in model container [2019-10-22 08:57:20,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:19" (2/3) ... [2019-10-22 08:57:20,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb0b627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:20, skipping insertion in model container [2019-10-22 08:57:20,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:20" (3/3) ... [2019-10-22 08:57:20,014 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2019-10-22 08:57:20,023 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:20,031 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:57:20,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:57:20,065 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:20,065 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:20,065 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:20,066 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:20,066 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:20,066 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:20,066 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:20,066 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-10-22 08:57:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:57:20,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:20,089 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:57:20,091 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-10-22 08:57:20,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809170168] [2019-10-22 08:57:20,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,275 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:57:20,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809170168] [2019-10-22 08:57:20,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:20,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:20,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550477282] [2019-10-22 08:57:20,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:20,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:20,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:20,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:20,296 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-10-22 08:57:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:20,336 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-10-22 08:57:20,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:20,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:57:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:20,349 INFO L225 Difference]: With dead ends: 149 [2019-10-22 08:57:20,349 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:57:20,352 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:57:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:57:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 08:57:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:57:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-10-22 08:57:20,390 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-10-22 08:57:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:20,390 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-10-22 08:57:20,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-10-22 08:57:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:20,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:20,392 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:57:20,392 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-10-22 08:57:20,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147033480] [2019-10-22 08:57:20,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,393 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,462 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:57:20,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147033480] [2019-10-22 08:57:20,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:20,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:20,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083837513] [2019-10-22 08:57:20,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:20,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:20,466 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-10-22 08:57:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:20,501 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-10-22 08:57:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:20,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-22 08:57:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:20,503 INFO L225 Difference]: With dead ends: 87 [2019-10-22 08:57:20,504 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 08:57:20,505 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:57:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 08:57:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 08:57:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:57:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-10-22 08:57:20,513 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-10-22 08:57:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:20,513 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-10-22 08:57:20,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-10-22 08:57:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:57:20,514 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:20,514 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:57:20,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:20,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-10-22 08:57:20,515 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575532555] [2019-10-22 08:57:20,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,516 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,587 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:57:20,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575532555] [2019-10-22 08:57:20,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:20,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:20,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711857308] [2019-10-22 08:57:20,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:20,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:20,589 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-10-22 08:57:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:20,696 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-10-22 08:57:20,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:20,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-22 08:57:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:20,698 INFO L225 Difference]: With dead ends: 121 [2019-10-22 08:57:20,698 INFO L226 Difference]: Without dead ends: 75 [2019-10-22 08:57:20,698 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:57:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-22 08:57:20,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-10-22 08:57:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 08:57:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-10-22 08:57:20,706 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-10-22 08:57:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:20,706 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-10-22 08:57:20,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-10-22 08:57:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 08:57:20,707 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:20,708 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:57:20,708 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:20,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-10-22 08:57:20,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437251765] [2019-10-22 08:57:20,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:20,779 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:57:20,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437251765] [2019-10-22 08:57:20,780 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:20,780 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:20,780 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193099546] [2019-10-22 08:57:20,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:20,781 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:20,781 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-10-22 08:57:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:20,907 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-10-22 08:57:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:20,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-10-22 08:57:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:20,911 INFO L225 Difference]: With dead ends: 155 [2019-10-22 08:57:20,911 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 08:57:20,911 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:57:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 08:57:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-10-22 08:57:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-10-22 08:57:20,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-10-22 08:57:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:20,928 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-10-22 08:57:20,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-10-22 08:57:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-22 08:57:20,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:20,929 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:57:20,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-10-22 08:57:20,930 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:20,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913425471] [2019-10-22 08:57:20,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:20,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,042 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:57:21,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913425471] [2019-10-22 08:57:21,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:21,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:21,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006294446] [2019-10-22 08:57:21,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:21,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:21,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:21,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:21,044 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-10-22 08:57:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:21,107 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-10-22 08:57:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:21,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-22 08:57:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:21,109 INFO L225 Difference]: With dead ends: 108 [2019-10-22 08:57:21,109 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 08:57:21,110 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:57:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 08:57:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-10-22 08:57:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-22 08:57:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-10-22 08:57:21,115 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-10-22 08:57:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:21,115 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-10-22 08:57:21,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-10-22 08:57:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 08:57:21,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:21,116 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:57:21,116 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-10-22 08:57:21,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26802493] [2019-10-22 08:57:21,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,117 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,179 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:57:21,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26802493] [2019-10-22 08:57:21,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:21,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:21,181 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411135497] [2019-10-22 08:57:21,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:21,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:21,182 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-10-22 08:57:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:21,269 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-10-22 08:57:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:21,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-22 08:57:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:21,271 INFO L225 Difference]: With dead ends: 110 [2019-10-22 08:57:21,271 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:57:21,272 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:57:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:57:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-10-22 08:57:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-22 08:57:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-10-22 08:57:21,276 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-10-22 08:57:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:21,284 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-10-22 08:57:21,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:21,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-10-22 08:57:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:57:21,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:21,285 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:57:21,285 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:21,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-10-22 08:57:21,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748180506] [2019-10-22 08:57:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,351 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:57:21,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748180506] [2019-10-22 08:57:21,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209005788] [2019-10-22 08:57:21,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:57:21,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:21,439 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:57:21,445 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:57:21,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-10-22 08:57:21,446 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590385170] [2019-10-22 08:57:21,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:21,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:21,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:21,447 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-10-22 08:57:21,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:21,553 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-10-22 08:57:21,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:21,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-10-22 08:57:21,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:21,555 INFO L225 Difference]: With dead ends: 133 [2019-10-22 08:57:21,556 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 08:57:21,556 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:57:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 08:57:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-10-22 08:57:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-10-22 08:57:21,566 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-10-22 08:57:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:21,567 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-10-22 08:57:21,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-10-22 08:57:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-22 08:57:21,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:21,568 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:57:21,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:21,772 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:21,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-10-22 08:57:21,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:21,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872581202] [2019-10-22 08:57:21,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:21,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:21,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872581202] [2019-10-22 08:57:21,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338133928] [2019-10-22 08:57:21,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:21,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:57:21,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:21,973 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:57:21,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:21,974 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-10-22 08:57:21,974 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043172599] [2019-10-22 08:57:21,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:21,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:21,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:21,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:21,975 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-10-22 08:57:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,124 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-10-22 08:57:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:22,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-10-22 08:57:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:22,125 INFO L225 Difference]: With dead ends: 93 [2019-10-22 08:57:22,126 INFO L226 Difference]: Without dead ends: 89 [2019-10-22 08:57:22,126 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:57:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-10-22 08:57:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-10-22 08:57:22,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:22,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-10-22 08:57:22,132 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-10-22 08:57:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:22,132 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-10-22 08:57:22,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:22,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-10-22 08:57:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:57:22,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:22,133 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:57:22,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:22,334 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:22,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-10-22 08:57:22,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,335 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211201449] [2019-10-22 08:57:22,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,335 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,418 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:57:22,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211201449] [2019-10-22 08:57:22,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910224431] [2019-10-22 08:57:22,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:57:22,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:22,524 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:57:22,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:22,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-10-22 08:57:22,525 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678394401] [2019-10-22 08:57:22,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:22,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:22,526 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-10-22 08:57:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:22,635 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-10-22 08:57:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:22,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 08:57:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:22,636 INFO L225 Difference]: With dead ends: 76 [2019-10-22 08:57:22,636 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 08:57:22,637 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:57:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 08:57:22,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-10-22 08:57:22,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-22 08:57:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-10-22 08:57:22,648 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-10-22 08:57:22,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:22,648 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-10-22 08:57:22,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-10-22 08:57:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:57:22,649 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:22,649 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:57:22,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:22,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-10-22 08:57:22,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:22,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117917620] [2019-10-22 08:57:22,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:22,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:22,914 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:57:22,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117917620] [2019-10-22 08:57:22,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:22,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:22,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200851932] [2019-10-22 08:57:22,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:22,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:22,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:22,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:22,916 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-10-22 08:57:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,008 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-10-22 08:57:23,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:57:23,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-10-22 08:57:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,009 INFO L225 Difference]: With dead ends: 71 [2019-10-22 08:57:23,010 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 08:57:23,010 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:57:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 08:57:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-22 08:57:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-10-22 08:57:23,013 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-10-22 08:57:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,014 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-10-22 08:57:23,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-10-22 08:57:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 08:57:23,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,014 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:57:23,015 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-10-22 08:57:23,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915361192] [2019-10-22 08:57:23,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,110 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:57:23,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915361192] [2019-10-22 08:57:23,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762789861] [2019-10-22 08:57:23,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,212 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:57:23,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:23,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-22 08:57:23,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138907370] [2019-10-22 08:57:23,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:57:23,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:57:23,214 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-10-22 08:57:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,362 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-10-22 08:57:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:23,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-10-22 08:57:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,363 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:57:23,363 INFO L226 Difference]: Without dead ends: 65 [2019-10-22 08:57:23,364 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:57:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-22 08:57:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-10-22 08:57:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-10-22 08:57:23,367 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-10-22 08:57:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,368 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-10-22 08:57:23,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:57:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-10-22 08:57:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:57:23,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,372 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:57:23,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:23,573 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:23,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-10-22 08:57:23,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:23,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203491114] [2019-10-22 08:57:23,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:23,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,636 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:57:23,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203491114] [2019-10-22 08:57:23,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069593011] [2019-10-22 08:57:23,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:23,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 08:57:23,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:23,747 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:57:23,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:23,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-10-22 08:57:23,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287451278] [2019-10-22 08:57:23,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:57:23,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:57:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:57:23,749 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 8 states. [2019-10-22 08:57:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:23,922 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2019-10-22 08:57:23,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:57:23,923 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-22 08:57:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:23,923 INFO L225 Difference]: With dead ends: 99 [2019-10-22 08:57:23,924 INFO L226 Difference]: Without dead ends: 63 [2019-10-22 08:57:23,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:57:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-22 08:57:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-22 08:57:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-22 08:57:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-10-22 08:57:23,929 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 41 [2019-10-22 08:57:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:23,930 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-10-22 08:57:23,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:57:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-10-22 08:57:23,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 08:57:23,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:23,931 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, 1, 1, 1, 1] [2019-10-22 08:57:24,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:24,132 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1115909698, now seen corresponding path program 1 times [2019-10-22 08:57:24,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:24,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218894853] [2019-10-22 08:57:24,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:24,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,212 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:57:24,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218894853] [2019-10-22 08:57:24,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045731467] [2019-10-22 08:57:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/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:57:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:24,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 08:57:24,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:57:24,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:57:24,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-10-22 08:57:24,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186516735] [2019-10-22 08:57:24,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:57:24,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:24,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:57:24,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:57:24,361 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 9 states. [2019-10-22 08:57:24,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:24,556 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-22 08:57:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:57:24,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2019-10-22 08:57:24,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:24,557 INFO L225 Difference]: With dead ends: 64 [2019-10-22 08:57:24,557 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:24,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-10-22 08:57:24,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:24,558 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-10-22 08:57:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:24,558 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:24,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:57:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:24,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:24,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:57:24,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:57:24,889 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:57:24,890 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:57:24,890 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-10-22 08:57:24,890 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:57:24,890 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:57:24,890 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:57:24,890 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:57:24,890 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:24,890 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-10-22 08:57:24,890 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-10-22 08:57:24,891 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:57:24,891 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:57:24,891 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:57:24,891 INFO L439 ceAbstractionStarter]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-10-22 08:57:24,891 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:57:24,891 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:57:24,891 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:57:24,891 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:57:24,891 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:57:24,891 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:57:24,891 INFO L443 ceAbstractionStarter]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-10-22 08:57:24,892 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:57:24,892 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-10-22 08:57:24,892 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-10-22 08:57:24,893 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-10-22 08:57:24,893 INFO L443 ceAbstractionStarter]: For program point L7(line 7) no Hoare annotation was computed. [2019-10-22 08:57:24,893 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_~sa~0)) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-10-22 08:57:24,893 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:24,893 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:57:24,893 INFO L443 ceAbstractionStarter]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:57:24,894 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:57:24,895 INFO L443 ceAbstractionStarter]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-10-22 08:57:24,895 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_~sa~0)) (<= (+ ULTIMATE.start_main_~sa~0 1) 0)) [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L443 ceAbstractionStarter]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-10-22 08:57:24,896 INFO L439 ceAbstractionStarter]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-10-22 08:57:24,896 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:57:24,896 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:57:24,896 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:57:24,897 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L439 ceAbstractionStarter]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-10-22 08:57:24,897 INFO L439 ceAbstractionStarter]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-10-22 08:57:24,897 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:57:24,897 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:57:24,897 INFO L443 ceAbstractionStarter]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L446 ceAbstractionStarter]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-10-22 08:57:24,897 INFO L443 ceAbstractionStarter]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L443 ceAbstractionStarter]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L443 ceAbstractionStarter]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,897 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L446 ceAbstractionStarter]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-10-22 08:57:24,898 INFO L443 ceAbstractionStarter]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-10-22 08:57:24,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:24 BoogieIcfgContainer [2019-10-22 08:57:24,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:24,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:24,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:24,920 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:24,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:20" (3/4) ... [2019-10-22 08:57:24,923 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:24,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-10-22 08:57:24,934 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 08:57:24,960 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-10-22 08:57:24,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 [2019-10-22 08:57:25,001 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f4897d1b-6eeb-438d-8706-acf71f4a4693/bin/uautomizer/witness.graphml [2019-10-22 08:57:25,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:25,003 INFO L168 Benchmark]: Toolchain (without parser) took 5959.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.9 MB in the beginning and 882.3 MB in the end (delta: 67.6 MB). Peak memory consumption was 214.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,003 INFO L168 Benchmark]: CDTParser took 0.20 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:57:25,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,004 INFO L168 Benchmark]: Boogie Preprocessor took 36.74 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:57:25,005 INFO L168 Benchmark]: RCFGBuilder took 493.46 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,005 INFO L168 Benchmark]: TraceAbstraction took 4912.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.3 MB in the end (delta: 208.0 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,005 INFO L168 Benchmark]: Witness Printer took 81.74 ms. Allocated memory is still 1.2 GB. Free memory was 894.3 MB in the beginning and 882.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:25,007 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.20 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 390.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 949.9 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 493.46 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4912.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.3 MB in the end (delta: 208.0 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. * Witness Printer took 81.74 ms. Allocated memory is still 1.2 GB. Free memory was 894.3 MB in the beginning and 882.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sa)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 == m && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sa) || (0 == __retres10 && 0 == zero)) || sa + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Result: SAFE, OverallTime: 4.8s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1046 SDtfs, 383 SDslu, 2280 SDs, 0 SdLazy, 784 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 106 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 63 NumberOfFragments, 114 HoareAnnotationTreeSize, 24 FomulaSimplifications, 590 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 633 ConstructedInterpolants, 1 QuantifiedInterpolants, 44266 SizeOfPredicates, 35 NumberOfNonLiveVariables, 789 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 18/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...