./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.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_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:23,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:20:23,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:20:23,447 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:20:23,447 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:20:23,448 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:20:23,449 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:20:23,450 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:20:23,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:20:23,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:20:23,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:20:23,453 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:20:23,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:20:23,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:20:23,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:20:23,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:20:23,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:20:23,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:20:23,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:20:23,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:20:23,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:20:23,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:20:23,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:20:23,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:20:23,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:20:23,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:20:23,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:20:23,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:20:23,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:20:23,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:20:23,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:20:23,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:20:23,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:20:23,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:20:23,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:20:23,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:20:23,469 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:20:23,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:20:23,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:20:23,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:20:23,480 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:20:23,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:20:23,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:20:23,480 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:20:23,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:20:23,481 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:20:23,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:20:23,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:20:23,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:20:23,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:20:23,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:20:23,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:20:23,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:20:23,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:20:23,484 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_0fa21af6-8199-49b2-8ea0-0510b31d041c/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2018-11-10 07:20:23,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:20:23,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:20:23,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:20:23,518 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:20:23,518 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:20:23,519 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-10 07:20:23,555 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/data/d9ee2a5ea/2fa710c4526942d4b29e4e9656ac1b19/FLAGbc3400248 [2018-11-10 07:20:23,958 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:20:23,958 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/sv-benchmarks/c/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-10 07:20:23,967 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/data/d9ee2a5ea/2fa710c4526942d4b29e4e9656ac1b19/FLAGbc3400248 [2018-11-10 07:20:23,978 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/data/d9ee2a5ea/2fa710c4526942d4b29e4e9656ac1b19 [2018-11-10 07:20:23,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:20:23,982 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:20:23,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:20:23,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:20:23,985 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:20:23,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:23" (1/1) ... [2018-11-10 07:20:23,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c7d5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:23, skipping insertion in model container [2018-11-10 07:20:23,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:20:23" (1/1) ... [2018-11-10 07:20:23,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:20:24,030 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:20:24,236 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:20:24,239 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:20:24,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:20:24,314 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:20:24,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24 WrapperNode [2018-11-10 07:20:24,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:20:24,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:20:24,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:20:24,315 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:20:24,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... [2018-11-10 07:20:24,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:20:24,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:20:24,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:20:24,440 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:20:24,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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:20:24,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:20:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:20:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 07:20:24,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:20:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 07:20:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:20:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:20:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 07:20:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:20:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:20:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:20:25,229 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:20:25,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:25 BoogieIcfgContainer [2018-11-10 07:20:25,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:20:25,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:20:25,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:20:25,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:20:25,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:20:23" (1/3) ... [2018-11-10 07:20:25,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccfc776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:20:25, skipping insertion in model container [2018-11-10 07:20:25,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:20:24" (2/3) ... [2018-11-10 07:20:25,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ccfc776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:20:25, skipping insertion in model container [2018-11-10 07:20:25,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:25" (3/3) ... [2018-11-10 07:20:25,238 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-10 07:20:25,244 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:20:25,251 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:20:25,260 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:20:25,283 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:20:25,284 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:20:25,284 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:20:25,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:20:25,284 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:20:25,284 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:20:25,284 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:20:25,284 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:20:25,284 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:20:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-10 07:20:25,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-10 07:20:25,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:25,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:25,314 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:25,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-11-10 07:20:25,319 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:25,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:25,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:25,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:25,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:25,635 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:20:25,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:25,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:20:25,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:20:25,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:20:25,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:20:25,650 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-10 07:20:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:26,198 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-10 07:20:26,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:20:26,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-10 07:20:26,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:26,211 INFO L225 Difference]: With dead ends: 621 [2018-11-10 07:20:26,212 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 07:20:26,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:20:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 07:20:26,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-10 07:20:26,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 07:20:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-10 07:20:26,260 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-11-10 07:20:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:26,261 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-10 07:20:26,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:20:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-10 07:20:26,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 07:20:26,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:26,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:26,267 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:26,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-11-10 07:20:26,268 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:26,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:26,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:26,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:26,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:26,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:26,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:26,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:20:26,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:20:26,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:26,496 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-10 07:20:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:26,990 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-10 07:20:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:20:26,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-10 07:20:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:26,992 INFO L225 Difference]: With dead ends: 903 [2018-11-10 07:20:26,993 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 07:20:26,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:26,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 07:20:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-10 07:20:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-10 07:20:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-10 07:20:27,012 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-11-10 07:20:27,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:27,012 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-10 07:20:27,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:20:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-10 07:20:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 07:20:27,014 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:27,014 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,014 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:27,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:27,014 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-11-10 07:20:27,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:27,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:27,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:27,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:27,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:27,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:27,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:20:27,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:20:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:27,240 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-10 07:20:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:27,748 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-10 07:20:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:20:27,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-10 07:20:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:27,751 INFO L225 Difference]: With dead ends: 901 [2018-11-10 07:20:27,751 INFO L226 Difference]: Without dead ends: 380 [2018-11-10 07:20:27,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-10 07:20:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-10 07:20:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-10 07:20:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-10 07:20:27,761 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-11-10 07:20:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:27,762 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-10 07:20:27,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:20:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-10 07:20:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 07:20:27,764 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:27,764 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,764 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:27,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:27,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-11-10 07:20:27,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:27,842 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:27,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:27,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:20:27,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:20:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:20:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:20:27,843 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-10 07:20:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:28,430 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-10 07:20:28,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:20:28,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-11-10 07:20:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:28,433 INFO L225 Difference]: With dead ends: 1193 [2018-11-10 07:20:28,434 INFO L226 Difference]: Without dead ends: 819 [2018-11-10 07:20:28,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:20:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-10 07:20:28,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-10 07:20:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-10 07:20:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-10 07:20:28,457 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-11-10 07:20:28,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:28,457 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-10 07:20:28,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:20:28,458 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-10 07:20:28,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 07:20:28,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:28,460 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:28,460 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:28,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:28,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-11-10 07:20:28,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:28,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:28,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:28,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:28,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:28,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:28,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:28,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:20:28,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:20:28,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:28,600 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-10 07:20:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:29,082 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-10 07:20:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:20:29,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-11-10 07:20:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:29,085 INFO L225 Difference]: With dead ends: 1753 [2018-11-10 07:20:29,085 INFO L226 Difference]: Without dead ends: 804 [2018-11-10 07:20:29,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:29,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-10 07:20:29,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-10 07:20:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-10 07:20:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-10 07:20:29,101 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-11-10 07:20:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:29,101 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-10 07:20:29,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:20:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-10 07:20:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 07:20:29,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:29,104 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,104 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:29,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-11-10 07:20:29,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:29,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:29,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:29,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:20:29,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:20:29,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:20:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:29,236 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-10 07:20:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:29,673 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-10 07:20:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:20:29,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-10 07:20:29,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:29,675 INFO L225 Difference]: With dead ends: 1747 [2018-11-10 07:20:29,675 INFO L226 Difference]: Without dead ends: 801 [2018-11-10 07:20:29,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:20:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-10 07:20:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-10 07:20:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-10 07:20:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-10 07:20:29,692 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-11-10 07:20:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:29,692 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-10 07:20:29,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:20:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-10 07:20:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 07:20:29,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:29,695 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:29,695 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:29,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:29,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-11-10 07:20:29,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:29,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:29,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:29,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:29,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:29,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:29,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:20:29,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:20:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:20:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:20:29,759 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-10 07:20:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:30,419 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-10 07:20:30,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:20:30,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-10 07:20:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:30,426 INFO L225 Difference]: With dead ends: 2381 [2018-11-10 07:20:30,426 INFO L226 Difference]: Without dead ends: 1586 [2018-11-10 07:20:30,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:20:30,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-10 07:20:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-10 07:20:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-10 07:20:30,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-10 07:20:30,465 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-11-10 07:20:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:30,465 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-10 07:20:30,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:20:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-10 07:20:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 07:20:30,470 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:30,470 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:30,470 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:30,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-11-10 07:20:30,470 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:30,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:30,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:30,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:30,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:30,604 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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:20:30,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:30,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:30,736 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:20:30,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:20:30,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2018-11-10 07:20:30,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 07:20:30,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 07:20:30,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:20:30,764 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 8 states. [2018-11-10 07:20:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:32,438 INFO L93 Difference]: Finished difference Result 6944 states and 10873 transitions. [2018-11-10 07:20:32,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:20:32,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 184 [2018-11-10 07:20:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:32,466 INFO L225 Difference]: With dead ends: 6944 [2018-11-10 07:20:32,466 INFO L226 Difference]: Without dead ends: 5392 [2018-11-10 07:20:32,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:20:32,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2018-11-10 07:20:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 5341. [2018-11-10 07:20:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5341 states. [2018-11-10 07:20:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5341 states to 5341 states and 7131 transitions. [2018-11-10 07:20:32,645 INFO L78 Accepts]: Start accepts. Automaton has 5341 states and 7131 transitions. Word has length 184 [2018-11-10 07:20:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:32,645 INFO L481 AbstractCegarLoop]: Abstraction has 5341 states and 7131 transitions. [2018-11-10 07:20:32,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 07:20:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5341 states and 7131 transitions. [2018-11-10 07:20:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 07:20:32,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:32,666 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,666 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:32,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:32,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1880961448, now seen corresponding path program 1 times [2018-11-10 07:20:32,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:32,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:32,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:20:32,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:20:32,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:20:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:20:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:20:32,864 INFO L87 Difference]: Start difference. First operand 5341 states and 7131 transitions. Second operand 6 states. [2018-11-10 07:20:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:33,763 INFO L93 Difference]: Finished difference Result 12756 states and 17361 transitions. [2018-11-10 07:20:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 07:20:33,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2018-11-10 07:20:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:33,797 INFO L225 Difference]: With dead ends: 12756 [2018-11-10 07:20:33,797 INFO L226 Difference]: Without dead ends: 7426 [2018-11-10 07:20:33,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:20:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2018-11-10 07:20:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 7389. [2018-11-10 07:20:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7389 states. [2018-11-10 07:20:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 9112 transitions. [2018-11-10 07:20:33,999 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 9112 transitions. Word has length 218 [2018-11-10 07:20:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:34,000 INFO L481 AbstractCegarLoop]: Abstraction has 7389 states and 9112 transitions. [2018-11-10 07:20:34,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:20:34,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 9112 transitions. [2018-11-10 07:20:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-10 07:20:34,026 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:34,027 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:34,027 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:34,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:34,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-11-10 07:20:34,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:34,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:34,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:34,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:34,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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:20:34,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:34,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 07:20:34,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2018-11-10 07:20:34,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:20:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:20:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:20:34,472 INFO L87 Difference]: Start difference. First operand 7389 states and 9112 transitions. Second operand 15 states. [2018-11-10 07:20:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:36,051 INFO L93 Difference]: Finished difference Result 18233 states and 24177 transitions. [2018-11-10 07:20:36,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:20:36,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-11-10 07:20:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:36,071 INFO L225 Difference]: With dead ends: 18233 [2018-11-10 07:20:36,071 INFO L226 Difference]: Without dead ends: 6182 [2018-11-10 07:20:36,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2018-11-10 07:20:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6182 states. [2018-11-10 07:20:36,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6182 to 5826. [2018-11-10 07:20:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2018-11-10 07:20:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7234 transitions. [2018-11-10 07:20:36,263 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7234 transitions. Word has length 255 [2018-11-10 07:20:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:36,263 INFO L481 AbstractCegarLoop]: Abstraction has 5826 states and 7234 transitions. [2018-11-10 07:20:36,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:20:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7234 transitions. [2018-11-10 07:20:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-11-10 07:20:36,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:36,279 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:36,279 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:36,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1598158383, now seen corresponding path program 1 times [2018-11-10 07:20:36,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:36,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 116 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 07:20:36,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:36,337 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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:20:36,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:36,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:36,445 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-10 07:20:36,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:20:36,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2018-11-10 07:20:36,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 07:20:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 07:20:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 07:20:36,463 INFO L87 Difference]: Start difference. First operand 5826 states and 7234 transitions. Second operand 9 states. [2018-11-10 07:20:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:37,841 INFO L93 Difference]: Finished difference Result 10277 states and 13033 transitions. [2018-11-10 07:20:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 07:20:37,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 261 [2018-11-10 07:20:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:37,865 INFO L225 Difference]: With dead ends: 10277 [2018-11-10 07:20:37,865 INFO L226 Difference]: Without dead ends: 4140 [2018-11-10 07:20:37,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2018-11-10 07:20:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2018-11-10 07:20:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 3542. [2018-11-10 07:20:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2018-11-10 07:20:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 3987 transitions. [2018-11-10 07:20:37,978 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 3987 transitions. Word has length 261 [2018-11-10 07:20:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:37,978 INFO L481 AbstractCegarLoop]: Abstraction has 3542 states and 3987 transitions. [2018-11-10 07:20:37,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 07:20:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 3987 transitions. [2018-11-10 07:20:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 07:20:37,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:20:37,989 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,990 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:20:37,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:20:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-11-10 07:20:37,990 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:20:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:20:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:37,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:37,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:20:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:20:38,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:20:38,317 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/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:20:38,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:20:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:20:38,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:20:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 07:20:38,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:20:38,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2018-11-10 07:20:38,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 07:20:38,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 07:20:38,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-10 07:20:38,548 INFO L87 Difference]: Start difference. First operand 3542 states and 3987 transitions. Second operand 13 states. [2018-11-10 07:20:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:20:40,625 INFO L93 Difference]: Finished difference Result 6563 states and 7518 transitions. [2018-11-10 07:20:40,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 07:20:40,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-11-10 07:20:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:20:40,626 INFO L225 Difference]: With dead ends: 6563 [2018-11-10 07:20:40,626 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:20:40,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 07:20:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:20:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:20:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:20:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:20:40,637 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 313 [2018-11-10 07:20:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:20:40,637 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:20:40,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 07:20:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:20:40,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:20:40,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:20:40,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:40,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,112 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 160 [2018-11-10 07:20:41,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:20:41,400 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 331 DAG size of output: 160 [2018-11-10 07:20:42,453 WARN L179 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 94 [2018-11-10 07:20:43,087 WARN L179 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 79 [2018-11-10 07:20:43,713 WARN L179 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 79 [2018-11-10 07:20:43,715 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:20:43,715 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-10 07:20:43,716 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-10 07:20:43,717 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-10 07:20:43,718 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-10 07:20:43,719 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-10 07:20:43,720 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,721 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-10 07:20:43,722 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,723 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,724 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-10 07:20:43,725 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-10 07:20:43,726 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,727 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse4 (not (= ~a11~0 1))) (.cse5 (= 1 |old(~a25~0)|)) (.cse21 (= 10 |old(~a28~0)|)) (.cse28 (= ~a17~0 |old(~a17~0)|)) (.cse29 (= ~a19~0 |old(~a19~0)|)) (.cse30 (= ~a25~0 |old(~a25~0)|)) (.cse9 (= 1 |old(~a19~0)|)) (.cse27 (= |old(~a28~0)| ~a28~0)) (.cse26 (= 7 ~a17~0)) (.cse17 (= |old(~a25~0)| ~a25~0)) (.cse1 (= 1 |old(~a11~0)|))) (let ((.cse14 (= 8 ~a17~0)) (.cse10 (not (= 7 |old(~a28~0)|))) (.cse16 (not .cse1)) (.cse12 (= 7 ~a28~0)) (.cse13 (= 1 ~a11~0)) (.cse15 (= 1 ~a19~0)) (.cse3 (= 9 |old(~a28~0)|)) (.cse23 (= 11 |old(~a28~0)|)) (.cse25 (and .cse27 (= |old(~a19~0)| ~a19~0) .cse26 .cse17)) (.cse2 (= |old(~a17~0)| |old(~a28~0)|)) (.cse6 (not (= 7 |old(~a17~0)|))) (.cse7 (not .cse9)) (.cse11 (not (= 8 |old(~a17~0)|))) (.cse24 (and .cse27 .cse28 .cse29 .cse30)) (.cse0 (not (= 1 ~a21~0))) (.cse18 (not .cse21)) (.cse19 (not .cse5)) (.cse8 (not (= |old(~a17~0)| 8))) (.cse22 (< 0 |old(~a19~0)|)) (.cse20 (and .cse4 .cse27 .cse28 .cse29 .cse30))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse4 .cse1 .cse7 .cse2 .cse8) (or .cse9 .cse0 .cse10 .cse11 (and .cse12 (not (= ~a25~0 1)) .cse13 .cse14 (not .cse15)) .cse16 .cse5) (or (and .cse13 .cse14 .cse15 .cse17 (= 10 ~a28~0)) .cse0 .cse18 .cse19 .cse7 .cse11 .cse16) (or .cse20 (or .cse0 .cse1 .cse21 .cse2 .cse3 .cse8 .cse22 .cse23)) (or .cse0 .cse1 .cse20 .cse7 .cse21 .cse2 .cse3 .cse23 .cse5) (or .cse0 .cse1 .cse21 .cse3 .cse8 .cse22 .cse23 .cse5 .cse20) (or .cse0 .cse24 .cse7 .cse21 .cse2 .cse8 .cse23 .cse5) (or .cse0 .cse21 .cse2 .cse3 .cse25 .cse23 .cse5 .cse6) (or .cse25 .cse9 .cse0 .cse21 .cse2 .cse23 .cse6) (or .cse0 .cse19 .cse7 .cse11 (and .cse13 (= 1 ~a25~0) (= 9 ~a28~0) .cse14 .cse15) (not .cse3) .cse16) (or .cse24 .cse0 .cse1 .cse7 .cse2 .cse8) (or .cse0 .cse10 .cse19 .cse7 .cse16 (and .cse12 .cse13 .cse26 .cse15 .cse17) .cse6) (or .cse0 .cse1 .cse2 .cse25 .cse3 .cse5 .cse6) (or (or .cse0 .cse1 .cse19 .cse7 .cse8) (and (and .cse4 .cse27 .cse28 .cse29) .cse30)) (or .cse9 .cse0 .cse1 .cse21 .cse2 .cse4 .cse23 .cse6) (or .cse9 .cse0 .cse25 .cse2 .cse5 .cse6) (or .cse0 .cse7 .cse11 (not (= |old(~a28~0)| 7)) .cse24) (or .cse0 .cse1 .cse18 .cse19 .cse8 .cse22 .cse20)))) [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-10 07:20:43,728 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-10 07:20:43,729 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-10 07:20:43,730 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a28~0 ~a17~0)) (not (= 11 ~a28~0)) (not (= ~a25~0 1)) (= ~a19~0 1) (= ~a21~0 1) (not (= ~a11~0 1)) (not (= ~a28~0 9)) (not (= ~a28~0 10))) [2018-11-10 07:20:43,731 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (and (not (= ~a11~0 1)) (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (not (= 1 |old(~a19~0)|)) (= 10 |old(~a28~0)|) (= |old(~a17~0)| |old(~a28~0)|) (= 9 |old(~a28~0)|) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|)) [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse4 (not .cse2)) (.cse11 (= 7 ~a28~0)) (.cse12 (= 1 ~a11~0)) (.cse15 (= 8 ~a17~0)) (.cse14 (= 1 ~a19~0)) (.cse0 (= |old(~a28~0)| ~a28~0)) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse16 (<= ~a19~0 0)) (.cse13 (= 1 ~a25~0)) (.cse19 (= 10 ~a28~0)) (.cse9 (= |old(~a17~0)| ~a17~0)) (.cse17 (not (= ~a11~0 1))) (.cse3 (= |old(~a17~0)| 8)) (.cse5 (not (= ~a28~0 ~a17~0))) (.cse8 (not (= 11 ~a28~0))) (.cse6 (not (= ~a25~0 1))) (.cse7 (= 7 ~a17~0)) (.cse18 (not (= ~a28~0 9))) (.cse10 (not (= ~a28~0 10)))) (or (not (= 1 ~a21~0)) (and .cse0 (= |old(~a28~0)| 7) .cse1 .cse2 (= 8 |old(~a17~0)|)) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse5 .cse8 .cse6 .cse9 .cse2 .cse10) (and .cse11 .cse12 .cse7 .cse13 .cse14) (= 10 |old(~a28~0)|) (and .cse12 .cse13 (= 9 ~a28~0) .cse15 .cse14) (= 9 |old(~a28~0)|) (and .cse3 .cse16 .cse8 .cse6 .cse9 .cse17 .cse18 .cse10) (and .cse3 .cse4 .cse5 .cse8 .cse7 .cse10) (not (= 1 |old(~a19~0)|)) (and .cse12 .cse13 .cse15 .cse14 .cse19) (and .cse3 .cse5 .cse6 .cse7 .cse17 .cse18) (and .cse3 .cse16 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10) (and .cse11 .cse6 .cse12 .cse15 (not .cse14)) (and .cse3 .cse9 .cse13 .cse2 .cse17) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and .cse17 .cse0 .cse1 (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (and .cse0 .cse1 .cse6 .cse7 .cse17 (<= 1 ~a19~0)) (= |old(~a17~0)| |old(~a28~0)|) (and .cse3 .cse16 .cse9 .cse13 .cse19 .cse17) (and .cse3 .cse5 .cse9 .cse2 .cse17) (and .cse3 .cse5 .cse8 .cse6 .cse7 .cse18 .cse10)))) [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-10 07:20:43,731 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-10 07:20:43,732 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse2 (= ~a19~0 1))) (let ((.cse4 (not .cse2)) (.cse11 (= 7 ~a28~0)) (.cse12 (= 1 ~a11~0)) (.cse15 (= 8 ~a17~0)) (.cse14 (= 1 ~a19~0)) (.cse0 (= |old(~a28~0)| ~a28~0)) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse16 (<= ~a19~0 0)) (.cse13 (= 1 ~a25~0)) (.cse19 (= 10 ~a28~0)) (.cse9 (= |old(~a17~0)| ~a17~0)) (.cse17 (not (= ~a11~0 1))) (.cse3 (= |old(~a17~0)| 8)) (.cse5 (not (= ~a28~0 ~a17~0))) (.cse8 (not (= 11 ~a28~0))) (.cse6 (not (= ~a25~0 1))) (.cse7 (= 7 ~a17~0)) (.cse18 (not (= ~a28~0 9))) (.cse10 (not (= ~a28~0 10)))) (or (not (= 1 ~a21~0)) (and .cse0 (= |old(~a28~0)| 7) .cse1 .cse2 (= 8 |old(~a17~0)|)) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse5 .cse8 .cse6 .cse9 .cse2 .cse10) (and .cse11 .cse12 .cse7 .cse13 .cse14) (= 10 |old(~a28~0)|) (and .cse12 .cse13 (= 9 ~a28~0) .cse15 .cse14) (= 9 |old(~a28~0)|) (and .cse3 .cse16 .cse8 .cse6 .cse9 .cse17 .cse18 .cse10) (and .cse3 .cse4 .cse5 .cse8 .cse7 .cse10) (not (= 1 |old(~a19~0)|)) (and .cse12 .cse13 .cse15 .cse14 .cse19) (and .cse3 .cse5 .cse6 .cse7 .cse17 .cse18) (and .cse3 .cse16 .cse5 .cse8 .cse9 .cse17 .cse18 .cse10) (and .cse11 .cse6 .cse12 .cse15 (not .cse14)) (and .cse3 .cse9 .cse13 .cse2 .cse17) (= 11 |old(~a28~0)|) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and .cse17 .cse0 .cse1 (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) (and .cse0 .cse1 .cse6 .cse7 .cse17 (<= 1 ~a19~0)) (= |old(~a17~0)| |old(~a28~0)|) (and .cse3 .cse16 .cse9 .cse13 .cse19 .cse17) (and .cse3 .cse5 .cse9 .cse2 .cse17) (and .cse3 .cse5 .cse8 .cse6 .cse7 .cse18 .cse10)))) [2018-11-10 07:20:43,732 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-10 07:20:43,732 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-10 07:20:43,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:20:43 BoogieIcfgContainer [2018-11-10 07:20:43,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:20:43,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:20:43,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:20:43,746 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:20:43,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:20:25" (3/4) ... [2018-11-10 07:20:43,751 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:20:43,757 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:20:43,757 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 07:20:43,758 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:20:43,767 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 07:20:43,768 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 07:20:43,788 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(1 == a21) || ((((\old(a28) == a28 && \old(a28) == 7) && a17 == \old(a17)) && a19 == 1) && 8 == \old(a17))) || ((((\old(a17) == 8 && !(a19 == 1)) && !(a28 == a17)) && !(a25 == 1)) && 7 == a17)) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(11 == a28)) && !(a25 == 1)) && \old(a17) == a17) && a19 == 1) && !(a28 == 10))) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || 10 == \old(a28)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || 9 == \old(a28)) || (((((((\old(a17) == 8 && a19 <= 0) && !(11 == a28)) && !(a25 == 1)) && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 10))) || (((((\old(a17) == 8 && !(a19 == 1)) && !(a28 == a17)) && !(11 == a28)) && 7 == a17) && !(a28 == 10))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || (((((\old(a17) == 8 && !(a28 == a17)) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || (((((((\old(a17) == 8 && a19 <= 0) && !(a28 == a17)) && !(11 == a28)) && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 10))) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || ((((\old(a17) == 8 && \old(a17) == a17) && 1 == a25) && a19 == 1) && !(a11 == 1))) || 11 == \old(a28)) || 1 == \old(a25)) || 1 == \old(a11)) || ((((!(a11 == 1) && \old(a28) == a28) && a17 == \old(a17)) && a19 == \old(a19)) && a25 == \old(a25))) || (((((\old(a28) == a28 && a17 == \old(a17)) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && 1 <= a19)) || \old(a17) == \old(a28)) || (((((\old(a17) == 8 && a19 <= 0) && \old(a17) == a17) && 1 == a25) && 10 == a28) && !(a11 == 1))) || ((((\old(a17) == 8 && !(a28 == a17)) && \old(a17) == a17) && a19 == 1) && !(a11 == 1))) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(11 == a28)) && !(a25 == 1)) && 7 == a17) && !(a28 == 9)) && !(a28 == 10)) [2018-11-10 07:20:43,854 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0fa21af6-8199-49b2-8ea0-0510b31d041c/bin-2019/uautomizer/witness.graphml [2018-11-10 07:20:43,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:20:43,855 INFO L168 Benchmark]: Toolchain (without parser) took 19873.97 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 757.6 MB). Free memory was 951.8 MB in the beginning and 1.0 GB in the end (delta: -88.3 MB). Peak memory consumption was 669.3 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,855 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:20:43,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 916.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,856 INFO L168 Benchmark]: Boogie Preprocessor took 124.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 916.9 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,856 INFO L168 Benchmark]: RCFGBuilder took 791.21 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,856 INFO L168 Benchmark]: TraceAbstraction took 18513.25 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 622.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.8 MB). Peak memory consumption was 745.6 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,856 INFO L168 Benchmark]: Witness Printer took 108.73 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:20:43,858 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 916.9 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 916.9 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 791.21 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: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18513.25 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 622.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.8 MB). Peak memory consumption was 745.6 MB. Max. memory is 11.5 GB. * Witness Printer took 108.73 ms. Allocated memory is still 1.8 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(1 == a21) || ((((\old(a28) == a28 && \old(a28) == 7) && a17 == \old(a17)) && a19 == 1) && 8 == \old(a17))) || ((((\old(a17) == 8 && !(a19 == 1)) && !(a28 == a17)) && !(a25 == 1)) && 7 == a17)) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(11 == a28)) && !(a25 == 1)) && \old(a17) == a17) && a19 == 1) && !(a28 == 10))) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || 10 == \old(a28)) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || 9 == \old(a28)) || (((((((\old(a17) == 8 && a19 <= 0) && !(11 == a28)) && !(a25 == 1)) && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 10))) || (((((\old(a17) == 8 && !(a19 == 1)) && !(a28 == a17)) && !(11 == a28)) && 7 == a17) && !(a28 == 10))) || !(1 == \old(a19))) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || (((((\old(a17) == 8 && !(a28 == a17)) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || (((((((\old(a17) == 8 && a19 <= 0) && !(a28 == a17)) && !(11 == a28)) && \old(a17) == a17) && !(a11 == 1)) && !(a28 == 9)) && !(a28 == 10))) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || ((((\old(a17) == 8 && \old(a17) == a17) && 1 == a25) && a19 == 1) && !(a11 == 1))) || 11 == \old(a28)) || 1 == \old(a25)) || 1 == \old(a11)) || ((((!(a11 == 1) && \old(a28) == a28) && a17 == \old(a17)) && a19 == \old(a19)) && a25 == \old(a25))) || (((((\old(a28) == a28 && a17 == \old(a17)) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && 1 <= a19)) || \old(a17) == \old(a28)) || (((((\old(a17) == 8 && a19 <= 0) && \old(a17) == a17) && 1 == a25) && 10 == a28) && !(a11 == 1))) || ((((\old(a17) == 8 && !(a28 == a17)) && \old(a17) == a17) && a19 == 1) && !(a11 == 1))) || ((((((\old(a17) == 8 && !(a28 == a17)) && !(11 == a28)) && !(a25 == 1)) && 7 == a17) && !(a28 == 9)) && !(a28 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 18.4s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 11.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1342 SDtfs, 11509 SDslu, 1849 SDs, 0 SdLazy, 17553 SolverSat, 2744 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1245 GetRequests, 1096 SyntacticMatches, 10 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7389occurred 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.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1082 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 441 PreInvPairs, 751 NumberOfFragments, 1541 HoareAnnotationTreeSize, 441 FomulaSimplifications, 25922 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9917 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3403 NumberOfCodeBlocks, 3403 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3387 ConstructedInterpolants, 0 QuantifiedInterpolants, 3018275 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2173 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 1356/1450 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...