./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem16_label59_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem16_label59_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 fa9f7121969fd508bfc2a70123a715e64e895bca .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:43:33,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:43:33,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:43:33,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:43:33,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:43:33,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:43:33,778 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:43:33,788 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:43:33,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:43:33,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:43:33,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:43:33,793 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:43:33,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:43:33,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:43:33,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:43:33,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:43:33,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:43:33,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:43:33,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:43:33,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:43:33,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:43:33,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:43:33,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:43:33,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:43:33,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:43:33,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:43:33,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:43:33,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:43:33,813 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:43:33,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:43:33,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:43:33,816 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:43:33,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:43:33,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:43:33,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:43:33,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:43:33,818 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:43:33,834 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:43:33,834 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:43:33,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:43:33,836 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:43:33,836 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:43:33,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:43:33,837 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:43:33,837 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:43:33,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:43:33,838 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:43:33,839 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:43:33,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:43:33,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:43:33,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:43:33,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:43:33,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:43:33,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:43:33,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:43:33,842 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:43:33,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:43:33,842 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:43:33,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:43:33,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:43:33,842 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> fa9f7121969fd508bfc2a70123a715e64e895bca [2019-01-12 04:43:33,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:43:33,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:43:33,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:43:33,903 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:43:33,903 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:43:33,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem16_label59_true-unreach-call.c [2019-01-12 04:43:33,969 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8858c1f9/543debe5b56d4b8bae15f7da219141e1/FLAG02384d87a [2019-01-12 04:43:34,639 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:43:34,640 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem16_label59_true-unreach-call.c [2019-01-12 04:43:34,658 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8858c1f9/543debe5b56d4b8bae15f7da219141e1/FLAG02384d87a [2019-01-12 04:43:34,784 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8858c1f9/543debe5b56d4b8bae15f7da219141e1 [2019-01-12 04:43:34,788 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:43:34,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:43:34,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:43:34,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:43:34,796 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:43:34,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:43:34" (1/1) ... [2019-01-12 04:43:34,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:34, skipping insertion in model container [2019-01-12 04:43:34,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:43:34" (1/1) ... [2019-01-12 04:43:34,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:43:34,896 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:43:35,698 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:43:35,707 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:43:36,013 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:43:36,039 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:43:36,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36 WrapperNode [2019-01-12 04:43:36,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:43:36,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:43:36,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:43:36,042 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:43:36,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:43:36,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:43:36,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:43:36,377 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:43:36,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... [2019-01-12 04:43:36,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:43:36,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:43:36,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:43:36,551 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:43:36,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:43:36,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:43:36,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:43:42,418 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:43:42,419 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:43:42,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:43:42 BoogieIcfgContainer [2019-01-12 04:43:42,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:43:42,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:43:42,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:43:42,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:43:42,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:43:34" (1/3) ... [2019-01-12 04:43:42,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214fc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:43:42, skipping insertion in model container [2019-01-12 04:43:42,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:43:36" (2/3) ... [2019-01-12 04:43:42,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2214fc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:43:42, skipping insertion in model container [2019-01-12 04:43:42,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:43:42" (3/3) ... [2019-01-12 04:43:42,428 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label59_true-unreach-call.c [2019-01-12 04:43:42,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:43:42,447 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:43:42,464 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:43:42,499 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:43:42,500 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:43:42,500 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:43:42,500 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:43:42,501 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:43:42,501 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:43:42,501 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:43:42,501 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:43:42,501 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:43:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-01-12 04:43:42,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 04:43:42,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:42,544 INFO L402 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] [2019-01-12 04:43:42,547 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:42,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 626000386, now seen corresponding path program 1 times [2019-01-12 04:43:42,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:42,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:42,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:43,035 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:43:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:43:43,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:43,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:43:43,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:43,079 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-01-12 04:43:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:49,329 INFO L93 Difference]: Finished difference Result 1469 states and 2777 transitions. [2019-01-12 04:43:49,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:43:49,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-12 04:43:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:49,358 INFO L225 Difference]: With dead ends: 1469 [2019-01-12 04:43:49,359 INFO L226 Difference]: Without dead ends: 991 [2019-01-12 04:43:49,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-01-12 04:43:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 662. [2019-01-12 04:43:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-01-12 04:43:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2019-01-12 04:43:49,460 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 44 [2019-01-12 04:43:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:49,460 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2019-01-12 04:43:49,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:43:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2019-01-12 04:43:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-12 04:43:49,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:49,466 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:49,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:49,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:49,467 INFO L82 PathProgramCache]: Analyzing trace with hash -228214936, now seen corresponding path program 1 times [2019-01-12 04:43:49,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:49,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:49,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:43:49,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 04:43:49,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:43:49,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:43:49,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:43:49,706 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand 3 states. [2019-01-12 04:43:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:54,527 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2019-01-12 04:43:54,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:43:54,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-01-12 04:43:54,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:54,536 INFO L225 Difference]: With dead ends: 1980 [2019-01-12 04:43:54,536 INFO L226 Difference]: Without dead ends: 1320 [2019-01-12 04:43:54,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:43:54,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-01-12 04:43:54,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2019-01-12 04:43:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2019-01-12 04:43:54,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1927 transitions. [2019-01-12 04:43:54,589 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1927 transitions. Word has length 109 [2019-01-12 04:43:54,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:54,590 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1927 transitions. [2019-01-12 04:43:54,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:43:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1927 transitions. [2019-01-12 04:43:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 04:43:54,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:43:54,594 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:43:54,594 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:43:54,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:43:54,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1204197230, now seen corresponding path program 1 times [2019-01-12 04:43:54,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:43:54,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:43:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:54,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:43:54,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:43:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:43:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:43:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:43:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:43:54,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:43:54,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:43:54,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:43:54,757 INFO L87 Difference]: Start difference. First operand 1320 states and 1927 transitions. Second operand 4 states. [2019-01-12 04:44:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:00,446 INFO L93 Difference]: Finished difference Result 4612 states and 6932 transitions. [2019-01-12 04:44:00,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:00,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-12 04:44:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:00,464 INFO L225 Difference]: With dead ends: 4612 [2019-01-12 04:44:00,464 INFO L226 Difference]: Without dead ends: 3294 [2019-01-12 04:44:00,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-01-12 04:44:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2019-01-12 04:44:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3294 states. [2019-01-12 04:44:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4551 transitions. [2019-01-12 04:44:00,531 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4551 transitions. Word has length 116 [2019-01-12 04:44:00,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:00,532 INFO L480 AbstractCegarLoop]: Abstraction has 3294 states and 4551 transitions. [2019-01-12 04:44:00,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:00,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4551 transitions. [2019-01-12 04:44:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-12 04:44:00,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:00,535 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:00,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash -912563919, now seen corresponding path program 1 times [2019-01-12 04:44:00,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:00,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:00,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:00,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:44:00,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:00,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:44:00,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:44:00,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:44:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:00,655 INFO L87 Difference]: Start difference. First operand 3294 states and 4551 transitions. Second operand 4 states. [2019-01-12 04:44:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:02,863 INFO L93 Difference]: Finished difference Result 8560 states and 12175 transitions. [2019-01-12 04:44:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:44:02,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-01-12 04:44:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:02,887 INFO L225 Difference]: With dead ends: 8560 [2019-01-12 04:44:02,887 INFO L226 Difference]: Without dead ends: 5268 [2019-01-12 04:44:02,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2019-01-12 04:44:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2019-01-12 04:44:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5268 states. [2019-01-12 04:44:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 6771 transitions. [2019-01-12 04:44:02,986 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 6771 transitions. Word has length 131 [2019-01-12 04:44:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:02,987 INFO L480 AbstractCegarLoop]: Abstraction has 5268 states and 6771 transitions. [2019-01-12 04:44:02,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 6771 transitions. [2019-01-12 04:44:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-01-12 04:44:02,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:02,999 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-01-12 04:44:03,000 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:03,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:03,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1000998639, now seen corresponding path program 1 times [2019-01-12 04:44:03,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:03,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:03,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:03,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:03,446 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 5 [2019-01-12 04:44:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 04:44:03,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:03,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:44:03,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:44:03,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:44:03,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:03,523 INFO L87 Difference]: Start difference. First operand 5268 states and 6771 transitions. Second operand 4 states. [2019-01-12 04:44:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:06,603 INFO L93 Difference]: Finished difference Result 16127 states and 20742 transitions. [2019-01-12 04:44:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:06,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-01-12 04:44:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:06,640 INFO L225 Difference]: With dead ends: 16127 [2019-01-12 04:44:06,640 INFO L226 Difference]: Without dead ends: 10861 [2019-01-12 04:44:06,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-01-12 04:44:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 7900. [2019-01-12 04:44:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-01-12 04:44:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 9974 transitions. [2019-01-12 04:44:06,823 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 9974 transitions. Word has length 298 [2019-01-12 04:44:06,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:06,823 INFO L480 AbstractCegarLoop]: Abstraction has 7900 states and 9974 transitions. [2019-01-12 04:44:06,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 9974 transitions. [2019-01-12 04:44:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-12 04:44:06,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:06,836 INFO L402 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:44:06,836 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1131873446, now seen corresponding path program 1 times [2019-01-12 04:44:06,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:06,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-12 04:44:07,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:07,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 04:44:07,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:44:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:44:07,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:44:07,140 INFO L87 Difference]: Start difference. First operand 7900 states and 9974 transitions. Second operand 3 states. [2019-01-12 04:44:08,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:08,884 INFO L93 Difference]: Finished difference Result 19746 states and 25385 transitions. [2019-01-12 04:44:08,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:44:08,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-01-12 04:44:08,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:08,923 INFO L225 Difference]: With dead ends: 19746 [2019-01-12 04:44:08,923 INFO L226 Difference]: Without dead ends: 10203 [2019-01-12 04:44:08,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:44:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10203 states. [2019-01-12 04:44:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 10203. [2019-01-12 04:44:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10203 states. [2019-01-12 04:44:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 11074 transitions. [2019-01-12 04:44:09,092 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 11074 transitions. Word has length 311 [2019-01-12 04:44:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:09,092 INFO L480 AbstractCegarLoop]: Abstraction has 10203 states and 11074 transitions. [2019-01-12 04:44:09,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:44:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 11074 transitions. [2019-01-12 04:44:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-01-12 04:44:09,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:09,184 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:09,185 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:09,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:09,185 INFO L82 PathProgramCache]: Analyzing trace with hash 418111556, now seen corresponding path program 1 times [2019-01-12 04:44:09,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:09,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:09,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:09,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:09,609 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:44:09,990 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-01-12 04:44:10,202 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-12 04:44:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-12 04:44:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:44:10,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:44:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:44:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:44:10,699 INFO L87 Difference]: Start difference. First operand 10203 states and 11074 transitions. Second operand 7 states. [2019-01-12 04:44:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:14,807 INFO L93 Difference]: Finished difference Result 20077 states and 21816 transitions. [2019-01-12 04:44:14,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:14,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 354 [2019-01-12 04:44:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:14,836 INFO L225 Difference]: With dead ends: 20077 [2019-01-12 04:44:14,836 INFO L226 Difference]: Without dead ends: 10205 [2019-01-12 04:44:14,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:44:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10205 states. [2019-01-12 04:44:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10205 to 10203. [2019-01-12 04:44:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10203 states. [2019-01-12 04:44:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 11073 transitions. [2019-01-12 04:44:14,997 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 11073 transitions. Word has length 354 [2019-01-12 04:44:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:14,997 INFO L480 AbstractCegarLoop]: Abstraction has 10203 states and 11073 transitions. [2019-01-12 04:44:14,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:44:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 11073 transitions. [2019-01-12 04:44:15,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-01-12 04:44:15,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:15,007 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2019-01-12 04:44:15,007 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:15,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:15,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1410952424, now seen corresponding path program 1 times [2019-01-12 04:44:15,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:15,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-01-12 04:44:15,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:15,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:44:15,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:44:15,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:44:15,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:15,398 INFO L87 Difference]: Start difference. First operand 10203 states and 11073 transitions. Second operand 4 states. [2019-01-12 04:44:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:17,788 INFO L93 Difference]: Finished difference Result 22378 states and 24337 transitions. [2019-01-12 04:44:17,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:17,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 437 [2019-01-12 04:44:17,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:17,808 INFO L225 Difference]: With dead ends: 22378 [2019-01-12 04:44:17,808 INFO L226 Difference]: Without dead ends: 12506 [2019-01-12 04:44:17,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:17,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12506 states. [2019-01-12 04:44:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12506 to 11848. [2019-01-12 04:44:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-01-12 04:44:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12571 transitions. [2019-01-12 04:44:18,071 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12571 transitions. Word has length 437 [2019-01-12 04:44:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:18,072 INFO L480 AbstractCegarLoop]: Abstraction has 11848 states and 12571 transitions. [2019-01-12 04:44:18,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12571 transitions. [2019-01-12 04:44:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2019-01-12 04:44:18,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:18,157 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:44:18,157 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:18,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:18,157 INFO L82 PathProgramCache]: Analyzing trace with hash 999066414, now seen corresponding path program 1 times [2019-01-12 04:44:18,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:18,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:18,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2098 backedges. 1502 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2019-01-12 04:44:19,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:19,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:44:19,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:44:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:44:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:19,160 INFO L87 Difference]: Start difference. First operand 11848 states and 12571 transitions. Second operand 4 states. [2019-01-12 04:44:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:21,111 INFO L93 Difference]: Finished difference Result 23694 states and 25146 transitions. [2019-01-12 04:44:21,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:21,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1016 [2019-01-12 04:44:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:21,132 INFO L225 Difference]: With dead ends: 23694 [2019-01-12 04:44:21,132 INFO L226 Difference]: Without dead ends: 12177 [2019-01-12 04:44:21,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:21,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2019-01-12 04:44:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 11848. [2019-01-12 04:44:21,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11848 states. [2019-01-12 04:44:21,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12373 transitions. [2019-01-12 04:44:21,361 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12373 transitions. Word has length 1016 [2019-01-12 04:44:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:21,362 INFO L480 AbstractCegarLoop]: Abstraction has 11848 states and 12373 transitions. [2019-01-12 04:44:21,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12373 transitions. [2019-01-12 04:44:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-01-12 04:44:21,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:21,455 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:44:21,455 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:21,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:21,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1470911910, now seen corresponding path program 1 times [2019-01-12 04:44:21,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:21,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1973 backedges. 1306 proven. 0 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2019-01-12 04:44:22,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:22,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:44:22,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:44:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:44:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:22,676 INFO L87 Difference]: Start difference. First operand 11848 states and 12373 transitions. Second operand 4 states. [2019-01-12 04:44:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:24,940 INFO L93 Difference]: Finished difference Result 25997 states and 27211 transitions. [2019-01-12 04:44:24,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:44:24,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1108 [2019-01-12 04:44:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:24,958 INFO L225 Difference]: With dead ends: 25997 [2019-01-12 04:44:24,958 INFO L226 Difference]: Without dead ends: 14480 [2019-01-12 04:44:24,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:44:24,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2019-01-12 04:44:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13822. [2019-01-12 04:44:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-01-12 04:44:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14362 transitions. [2019-01-12 04:44:25,149 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14362 transitions. Word has length 1108 [2019-01-12 04:44:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:25,150 INFO L480 AbstractCegarLoop]: Abstraction has 13822 states and 14362 transitions. [2019-01-12 04:44:25,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:44:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14362 transitions. [2019-01-12 04:44:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2019-01-12 04:44:25,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:25,185 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-01-12 04:44:25,186 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1961660346, now seen corresponding path program 1 times [2019-01-12 04:44:25,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:25,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:25,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:26,039 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:44:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 1784 proven. 0 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2019-01-12 04:44:27,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:44:27,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:44:27,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:44:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:44:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:44:27,584 INFO L87 Difference]: Start difference. First operand 13822 states and 14362 transitions. Second operand 6 states. [2019-01-12 04:44:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:29,987 INFO L93 Difference]: Finished difference Result 27980 states and 29065 transitions. [2019-01-12 04:44:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:44:29,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1253 [2019-01-12 04:44:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:30,003 INFO L225 Difference]: With dead ends: 27980 [2019-01-12 04:44:30,003 INFO L226 Difference]: Without dead ends: 14489 [2019-01-12 04:44:30,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:44:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2019-01-12 04:44:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 14151. [2019-01-12 04:44:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14151 states. [2019-01-12 04:44:30,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14683 transitions. [2019-01-12 04:44:30,164 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14683 transitions. Word has length 1253 [2019-01-12 04:44:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:30,165 INFO L480 AbstractCegarLoop]: Abstraction has 14151 states and 14683 transitions. [2019-01-12 04:44:30,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:44:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14683 transitions. [2019-01-12 04:44:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1510 [2019-01-12 04:44:30,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:44:30,214 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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] [2019-01-12 04:44:30,214 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:44:30,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:44:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1170929571, now seen corresponding path program 1 times [2019-01-12 04:44:30,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:44:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:44:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:30,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:44:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1422 proven. 42 refuted. 0 times theorem prover too weak. 2234 trivial. 0 not checked. [2019-01-12 04:44:32,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:44:32,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-12 04:44:32,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:44:32,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:44:32,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:44:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 2159 proven. 0 refuted. 0 times theorem prover too weak. 1539 trivial. 0 not checked. [2019-01-12 04:44:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:44:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 04:44:34,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:44:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:44:34,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:44:34,145 INFO L87 Difference]: Start difference. First operand 14151 states and 14683 transitions. Second operand 5 states. [2019-01-12 04:44:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:44:39,118 INFO L93 Difference]: Finished difference Result 31588 states and 32825 transitions. [2019-01-12 04:44:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:44:39,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1509 [2019-01-12 04:44:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:44:39,125 INFO L225 Difference]: With dead ends: 31588 [2019-01-12 04:44:39,125 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:44:39,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1511 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:44:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:44:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:44:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:44:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:44:39,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1509 [2019-01-12 04:44:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:44:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:44:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:44:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:44:39,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:44:39,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:44:39,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:44:39,332 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 113 [2019-01-12 04:44:39,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:44:39,542 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 111 [2019-01-12 04:44:39,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:44:39,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:44:39,723 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 113 [2019-01-12 04:44:42,733 WARN L181 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-01-12 04:44:43,341 WARN L181 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-01-12 04:44:43,922 WARN L181 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 54 [2019-01-12 04:44:43,925 INFO L448 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,926 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,927 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:44:43,928 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:44:43,928 INFO L444 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse2 (= ~a12~0 9)) (.cse0 (= ~a16~0 9)) (.cse5 (< 0 (+ ~a18~0 156))) (.cse1 (<= 4 ~a15~0)) (.cse7 (not (= 9 ~a12~0))) (.cse4 (= ~a16~0 8)) (.cse6 (not (= ~a16~0 11))) (.cse8 (= ~a15~0 3)) (.cse3 (= ~a12~0 7))) (or (and (<= (+ ~a18~0 87) 0) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse4 .cse1 .cse5 .cse2) (and .cse6 .cse1 (= ~a12~0 5)) (and (and .cse5 (<= (+ ~a18~0 79) 0)) .cse0 .cse1) (and .cse0 .cse1 .cse5 .cse7) (and .cse8 (not (= 5 ~a12~0)) (not .cse3)) (and .cse8 .cse5) (and .cse6 .cse1 (= ~a12~0 6)) (and .cse4 .cse1 (<= ~a18~0 134) .cse7) (and .cse4 .cse8) (and .cse6 (and .cse8 .cse3)))) [2019-01-12 04:44:43,928 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,928 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,928 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,928 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,929 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:44:43,930 INFO L448 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,931 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,932 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,934 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,934 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,934 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,935 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:44:43,936 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L444 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse2 (= ~a12~0 9)) (.cse0 (= ~a16~0 9)) (.cse5 (< 0 (+ ~a18~0 156))) (.cse1 (<= 4 ~a15~0)) (.cse7 (not (= 9 ~a12~0))) (.cse4 (= ~a16~0 8)) (.cse6 (not (= ~a16~0 11))) (.cse8 (= ~a15~0 3)) (.cse3 (= ~a12~0 7))) (or (and (<= (+ ~a18~0 87) 0) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse4 .cse1 .cse5 .cse2) (and .cse6 .cse1 (= ~a12~0 5)) (and (and .cse5 (<= (+ ~a18~0 79) 0)) .cse0 .cse1) (and .cse0 .cse1 .cse5 .cse7) (and .cse8 (not (= 5 ~a12~0)) (not .cse3)) (and .cse8 .cse5) (and .cse6 .cse1 (= ~a12~0 6)) (and .cse4 .cse1 (<= ~a18~0 134) .cse7) (and .cse4 .cse8) (and .cse6 (and .cse8 .cse3)))) [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,937 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L451 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,938 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:44:43,939 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,940 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,947 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:44:43,948 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:44:43,949 INFO L444 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse2 (= ~a12~0 9)) (.cse0 (= ~a16~0 9)) (.cse5 (< 0 (+ ~a18~0 156))) (.cse1 (<= 4 ~a15~0)) (.cse7 (not (= 9 ~a12~0))) (.cse4 (= ~a16~0 8)) (.cse6 (not (= ~a16~0 11))) (.cse8 (= ~a15~0 3)) (.cse3 (= ~a12~0 7))) (or (and (<= (+ ~a18~0 87) 0) .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse1) (and .cse4 .cse1 .cse5 .cse2) (and .cse6 .cse1 (= ~a12~0 5)) (and (and .cse5 (<= (+ ~a18~0 79) 0)) .cse0 .cse1) (and .cse0 .cse1 .cse5 .cse7) (and .cse8 (not (= 5 ~a12~0)) (not .cse3)) (and .cse8 .cse5) (and .cse6 .cse1 (= ~a12~0 6)) (and .cse4 .cse1 (<= ~a18~0 134) .cse7) (and .cse4 .cse8) (and .cse6 (and .cse8 .cse3)))) [2019-01-12 04:44:43,949 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,952 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,952 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,952 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,952 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:44:43,953 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,954 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:44:43,955 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,956 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,957 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,958 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:44:43,959 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,960 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,961 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,962 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,963 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,964 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,965 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,966 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,972 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,972 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,972 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,972 INFO L448 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,972 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,973 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,974 INFO L448 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:44:43,975 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,976 INFO L448 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,977 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:44:43,978 INFO L448 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,979 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,983 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,983 INFO L448 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,983 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,984 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,985 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-01-12 04:44:43,986 INFO L448 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-01-12 04:44:44,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:44:44 BoogieIcfgContainer [2019-01-12 04:44:44,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:44:44,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:44:44,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:44:44,033 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:44:44,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:43:42" (3/4) ... [2019-01-12 04:44:44,040 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:44:44,083 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:44:44,087 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:44:44,383 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:44:44,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:44:44,384 INFO L168 Benchmark]: Toolchain (without parser) took 69595.71 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 941.8 MB in the beginning and 1.4 GB in the end (delta: -465.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,386 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:44:44,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1248.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 872.0 MB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 335.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 872.0 MB in the beginning and 1.1 GB in the end (delta: -220.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,387 INFO L168 Benchmark]: Boogie Preprocessor took 173.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,387 INFO L168 Benchmark]: RCFGBuilder took 5869.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.3 MB in the end (delta: 256.8 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,387 INFO L168 Benchmark]: TraceAbstraction took 61610.53 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 821.3 MB in the beginning and 1.5 GB in the end (delta: -629.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,390 INFO L168 Benchmark]: Witness Printer took 351.33 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:44:44,393 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1248.70 ms. Allocated memory is still 1.0 GB. Free memory was 941.8 MB in the beginning and 872.0 MB in the end (delta: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 335.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 872.0 MB in the beginning and 1.1 GB in the end (delta: -220.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 173.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5869.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 821.3 MB in the end (delta: 256.8 MB). Peak memory consumption was 256.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61610.53 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 821.3 MB in the beginning and 1.5 GB in the end (delta: -629.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 351.33 ms. Allocated memory is still 3.1 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: 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: 23]: Loop Invariant Derived loop invariant: (((((((((((((a18 + 87 <= 0 && a16 == 9) && 4 <= a15) && a12 == 9) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && 4 <= a15) && 0 < a18 + 156) && a12 == 9)) || ((!(a16 == 11) && 4 <= a15) && a12 == 5)) || (((0 < a18 + 156 && a18 + 79 <= 0) && a16 == 9) && 4 <= a15)) || (((a16 == 9 && 4 <= a15) && 0 < a18 + 156) && !(9 == a12))) || ((a15 == 3 && !(5 == a12)) && !(a12 == 7))) || (a15 == 3 && 0 < a18 + 156)) || ((!(a16 == 11) && 4 <= a15) && a12 == 6)) || (((a16 == 8 && 4 <= a15) && a18 <= 134) && !(9 == a12))) || (a16 == 8 && a15 == 3)) || (!(a16 == 11) && a15 == 3 && a12 == 7) - InvariantResult [Line: 1494]: Loop Invariant Derived loop invariant: (((((((((((((a18 + 87 <= 0 && a16 == 9) && 4 <= a15) && a12 == 9) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && 4 <= a15) && 0 < a18 + 156) && a12 == 9)) || ((!(a16 == 11) && 4 <= a15) && a12 == 5)) || (((0 < a18 + 156 && a18 + 79 <= 0) && a16 == 9) && 4 <= a15)) || (((a16 == 9 && 4 <= a15) && 0 < a18 + 156) && !(9 == a12))) || ((a15 == 3 && !(5 == a12)) && !(a12 == 7))) || (a15 == 3 && 0 < a18 + 156)) || ((!(a16 == 11) && 4 <= a15) && a12 == 6)) || (((a16 == 8 && 4 <= a15) && a18 <= 134) && !(9 == a12))) || (a16 == 8 && a15 == 3)) || (!(a16 == 11) && a15 == 3 && a12 == 7) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant Derived loop invariant: (((((((((((((a18 + 87 <= 0 && a16 == 9) && 4 <= a15) && a12 == 9) || ((a16 == 9 && a12 == 7) && 4 <= a15)) || (((a16 == 8 && 4 <= a15) && 0 < a18 + 156) && a12 == 9)) || ((!(a16 == 11) && 4 <= a15) && a12 == 5)) || (((0 < a18 + 156 && a18 + 79 <= 0) && a16 == 9) && 4 <= a15)) || (((a16 == 9 && 4 <= a15) && 0 < a18 + 156) && !(9 == a12))) || ((a15 == 3 && !(5 == a12)) && !(a12 == 7))) || (a15 == 3 && 0 < a18 + 156)) || ((!(a16 == 11) && 4 <= a15) && a12 == 6)) || (((a16 == 8 && 4 <= a15) && a18 <= 134) && !(9 == a12))) || (a16 == 8 && a15 == 3)) || (!(a16 == 11) && a15 == 3 && a12 == 7) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. SAFE Result, 61.4s OverallTime, 12 OverallIterations, 8 TraceHistogramMax, 42.2s AutomataDifference, 0.0s DeadEndRemovalTime, 4.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2527 SDtfs, 7055 SDslu, 151 SDs, 0 SdLazy, 19489 SolverSat, 2960 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1568 GetRequests, 1531 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14151occurred in iteration=11, 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: 1.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 5275 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 187 NumberOfFragments, 454 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3849 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 4181 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 8195 NumberOfCodeBlocks, 8195 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 8182 ConstructedInterpolants, 0 QuantifiedInterpolants, 20185382 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1722 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 14930/14972 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...