./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:52:46,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:52:46,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:52:46,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:52:46,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:52:46,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:52:46,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:52:46,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:52:46,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:52:46,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:52:46,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:52:46,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:52:46,682 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:52:46,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:52:46,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:52:46,684 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:52:46,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:52:46,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:52:46,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:52:46,687 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:52:46,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:52:46,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:52:46,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:52:46,689 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:52:46,689 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:52:46,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:52:46,690 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:52:46,691 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:52:46,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:52:46,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:52:46,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:52:46,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:52:46,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:52:46,693 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:52:46,693 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:52:46,694 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:52:46,694 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:52:46,703 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:52:46,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:52:46,704 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:52:46,704 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:52:46,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:52:46,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:52:46,705 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:52:46,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:52:46,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:52:46,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:52:46,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:52:46,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ceb806ae997f94b7f09b4e2dce31a0e63ff1a329 [2018-11-10 07:52:46,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:52:46,740 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:52:46,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:52:46,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:52:46,744 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:52:46,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-10 07:52:46,789 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/data/fb76b0b4f/3a660113fe0a47c49ddb181ccbd590f7/FLAG5fc88aab8 [2018-11-10 07:52:47,102 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:52:47,102 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/sv-benchmarks/c/recursive-simple/id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-10 07:52:47,107 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/data/fb76b0b4f/3a660113fe0a47c49ddb181ccbd590f7/FLAG5fc88aab8 [2018-11-10 07:52:47,119 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/data/fb76b0b4f/3a660113fe0a47c49ddb181ccbd590f7 [2018-11-10 07:52:47,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:52:47,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:52:47,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:52:47,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:52:47,127 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:52:47,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aa896ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47, skipping insertion in model container [2018-11-10 07:52:47,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:52:47,151 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:52:47,252 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:52:47,255 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:52:47,265 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:52:47,274 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:52:47,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47 WrapperNode [2018-11-10 07:52:47,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:52:47,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:52:47,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:52:47,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:52:47,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... [2018-11-10 07:52:47,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:52:47,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:52:47,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:52:47,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:52:47,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:52:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:52:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:52:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-10 07:52:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-10 07:52:47,358 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:52:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 07:52:47,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:52:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-10 07:52:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-10 07:52:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:52:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:52:47,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:52:47,460 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:52:47,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:52:47 BoogieIcfgContainer [2018-11-10 07:52:47,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:52:47,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:52:47,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:52:47,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:52:47,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:52:47" (1/3) ... [2018-11-10 07:52:47,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3f3d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:47, skipping insertion in model container [2018-11-10 07:52:47,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:52:47" (2/3) ... [2018-11-10 07:52:47,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3f3d03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:52:47, skipping insertion in model container [2018-11-10 07:52:47,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:52:47" (3/3) ... [2018-11-10 07:52:47,467 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o5_true-unreach-call_true-termination_true-no-overflow.c [2018-11-10 07:52:47,473 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:52:47,477 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:52:47,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:52:47,508 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:52:47,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:52:47,509 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:52:47,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:52:47,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:52:47,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:52:47,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:52:47,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:52:47,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:52:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 07:52:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 07:52:47,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:47,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:47,529 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:47,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-10 07:52:47,536 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:47,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:47,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:52:47,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:52:47,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:52:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:47,709 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-10 07:52:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:47,740 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-10 07:52:47,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:52:47,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-10 07:52:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:47,748 INFO L225 Difference]: With dead ends: 40 [2018-11-10 07:52:47,748 INFO L226 Difference]: Without dead ends: 26 [2018-11-10 07:52:47,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-10 07:52:47,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 07:52:47,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 07:52:47,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-10 07:52:47,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-10 07:52:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:47,777 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-10 07:52:47,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:52:47,777 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-10 07:52:47,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:52:47,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:47,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:47,778 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:47,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:47,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-10 07:52:47,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:47,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:47,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:47,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:47,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:52:47,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:52:47,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:52:47,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:47,853 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-10 07:52:47,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:47,896 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-10 07:52:47,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:52:47,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-10 07:52:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:47,898 INFO L225 Difference]: With dead ends: 44 [2018-11-10 07:52:47,898 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 07:52:47,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 07:52:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 07:52:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 07:52:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-10 07:52:47,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-10 07:52:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:47,903 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-10 07:52:47,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:52:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-10 07:52:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 07:52:47,904 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:47,904 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:47,905 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:47,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-10 07:52:47,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:47,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:47,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:52:48,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:48,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 07:52:48,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:52:48,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:52:48,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:52:48,010 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-10 07:52:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:48,045 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-10 07:52:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:52:48,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-10 07:52:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:48,047 INFO L225 Difference]: With dead ends: 36 [2018-11-10 07:52:48,047 INFO L226 Difference]: Without dead ends: 32 [2018-11-10 07:52:48,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:52:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-10 07:52:48,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-10 07:52:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 07:52:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-10 07:52:48,051 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-10 07:52:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:48,051 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-10 07:52:48,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:52:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-10 07:52:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:52:48,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:48,052 INFO L375 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] [2018-11-10 07:52:48,052 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-10 07:52:48,054 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:52:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:48,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:52:48,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:52:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:52:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,120 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-10 07:52:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:48,134 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-10 07:52:48,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:52:48,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 07:52:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:48,136 INFO L225 Difference]: With dead ends: 48 [2018-11-10 07:52:48,136 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 07:52:48,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 07:52:48,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-10 07:52:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 07:52:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 07:52:48,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-10 07:52:48,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:48,141 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 07:52:48,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:52:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 07:52:48,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:52:48,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:48,142 INFO L375 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] [2018-11-10 07:52:48,142 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:48,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:48,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-10 07:52:48,143 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:48,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:52:48,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:48,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:52:48,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:52:48,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:52:48,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,177 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-10 07:52:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:48,191 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-10 07:52:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:52:48,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-10 07:52:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:48,193 INFO L225 Difference]: With dead ends: 40 [2018-11-10 07:52:48,193 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 07:52:48,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 07:52:48,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-10 07:52:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 07:52:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 07:52:48,196 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-10 07:52:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:48,196 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 07:52:48,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:52:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 07:52:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:52:48,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:48,197 INFO L375 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] [2018-11-10 07:52:48,197 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:48,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:48,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-10 07:52:48,198 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:48,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:52:48,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:52:48,316 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:52:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:48,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:52:48,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:52:48,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-10 07:52:48,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 07:52:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:52:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:52:48,407 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2018-11-10 07:52:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:48,493 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-10 07:52:48,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:52:48,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-10 07:52:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:48,494 INFO L225 Difference]: With dead ends: 56 [2018-11-10 07:52:48,494 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 07:52:48,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:52:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 07:52:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-10 07:52:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 07:52:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 07:52:48,501 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-10 07:52:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:48,501 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 07:52:48,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 07:52:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 07:52:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:52:48,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:48,502 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:48,503 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:48,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:48,503 INFO L82 PathProgramCache]: Analyzing trace with hash 906172561, now seen corresponding path program 1 times [2018-11-10 07:52:48,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:48,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:52:48,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:52:48,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:52:48,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:52:48,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:52:48,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,569 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-10 07:52:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:48,591 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-10 07:52:48,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:52:48,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-10 07:52:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:48,594 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:52:48,594 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 07:52:48,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:52:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 07:52:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-10 07:52:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-10 07:52:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-10 07:52:48,599 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 34 [2018-11-10 07:52:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:48,600 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-10 07:52:48,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:52:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-10 07:52:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:52:48,601 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:48,601 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:48,601 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:48,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:48,601 INFO L82 PathProgramCache]: Analyzing trace with hash 709659056, now seen corresponding path program 1 times [2018-11-10 07:52:48,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:48,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:52:48,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:52:48,776 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:52:48,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:48,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 07:52:48,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:52:48,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-10 07:52:48,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:52:48,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:52:48,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:52:48,837 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 14 states. [2018-11-10 07:52:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:49,019 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-10 07:52:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:52:49,020 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-10 07:52:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:49,021 INFO L225 Difference]: With dead ends: 74 [2018-11-10 07:52:49,021 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 07:52:49,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:52:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 07:52:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-10 07:52:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 07:52:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-10 07:52:49,027 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 34 [2018-11-10 07:52:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:49,027 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-10 07:52:49,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:52:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-10 07:52:49,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 07:52:49,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:49,028 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:49,029 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:49,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:49,029 INFO L82 PathProgramCache]: Analyzing trace with hash -797786941, now seen corresponding path program 2 times [2018-11-10 07:52:49,029 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:49,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:52:49,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:52:49,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:52:49,231 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:52:49,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:52:49,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:52:49,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:52:49,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 07:52:49,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:52:49,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 17 [2018-11-10 07:52:49,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 07:52:49,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:52:49,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:52:49,275 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 17 states. [2018-11-10 07:52:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:49,378 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-10 07:52:49,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:52:49,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-10 07:52:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:49,379 INFO L225 Difference]: With dead ends: 78 [2018-11-10 07:52:49,379 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 07:52:49,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:52:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 07:52:49,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-10 07:52:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-10 07:52:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-10 07:52:49,385 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 41 [2018-11-10 07:52:49,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:49,385 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-10 07:52:49,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 07:52:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-10 07:52:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 07:52:49,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:52:49,387 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:52:49,387 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:52:49,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:52:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1496626328, now seen corresponding path program 2 times [2018-11-10 07:52:49,388 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:52:49,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:52:49,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:49,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:52:49,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:52:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:52:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 07:52:49,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:52:49,503 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:52:49,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:52:49,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 07:52:49,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:52:49,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:52:49,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 07:52:49,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:52:49,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2018-11-10 07:52:49,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 07:52:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:52:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-11-10 07:52:49,610 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 17 states. [2018-11-10 07:52:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:52:49,690 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-11-10 07:52:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 07:52:49,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 48 [2018-11-10 07:52:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:52:49,691 INFO L225 Difference]: With dead ends: 66 [2018-11-10 07:52:49,691 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:52:49,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:52:49,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:52:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:52:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:52:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:52:49,692 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-11-10 07:52:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:52:49,693 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:52:49,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 07:52:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:52:49,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:52:49,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:52:49,706 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:52:49,706 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:52:49,706 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 07:52:49,706 INFO L428 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2018-11-10 07:52:49,706 INFO L425 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-11-10 07:52:49,706 INFO L425 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-11-10 07:52:49,706 INFO L425 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2018-11-10 07:52:49,706 INFO L428 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 21 27) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 21 27) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L24-2(lines 21 27) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L425 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2018-11-10 07:52:49,707 INFO L428 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2018-11-10 07:52:49,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:52:49 BoogieIcfgContainer [2018-11-10 07:52:49,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:52:49,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:52:49,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:52:49,710 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:52:49,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:52:47" (3/4) ... [2018-11-10 07:52:49,713 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:52:49,717 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:52:49,717 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2018-11-10 07:52:49,717 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:52:49,717 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2018-11-10 07:52:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 07:52:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:52:49,720 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:52:49,747 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2fe10b95-5e4f-457f-9aa0-ab4184baeffc/bin-2019/uautomizer/witness.graphml [2018-11-10 07:52:49,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:52:49,747 INFO L168 Benchmark]: Toolchain (without parser) took 2624.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -80.3 MB). Peak memory consumption was 53.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:49,748 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:52:49,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:49,749 INFO L168 Benchmark]: Boogie Preprocessor took 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:52:49,749 INFO L168 Benchmark]: RCFGBuilder took 170.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:49,750 INFO L168 Benchmark]: TraceAbstraction took 2247.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:49,750 INFO L168 Benchmark]: Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:52:49,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 150.47 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2247.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 11.5 GB. * Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 2.2s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 301 SDtfs, 36 SDslu, 2074 SDs, 0 SdLazy, 525 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 9 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 441 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 42135 SizeOfPredicates, 13 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 121/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...