./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem03_label48_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/Problem03_label48_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 ed0ef8676714c03e409913657b72922b069856bc ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:05:40,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 01:05:40,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 01:05:40,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 01:05:40,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 01:05:40,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 01:05:40,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 01:05:40,018 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 01:05:40,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 01:05:40,020 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 01:05:40,021 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 01:05:40,021 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 01:05:40,022 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 01:05:40,023 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 01:05:40,024 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 01:05:40,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 01:05:40,025 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 01:05:40,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 01:05:40,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 01:05:40,031 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 01:05:40,032 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 01:05:40,033 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 01:05:40,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 01:05:40,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 01:05:40,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 01:05:40,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 01:05:40,038 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 01:05:40,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 01:05:40,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 01:05:40,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 01:05:40,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 01:05:40,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 01:05:40,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 01:05:40,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 01:05:40,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 01:05:40,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 01:05:40,046 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 01:05:40,065 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 01:05:40,066 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 01:05:40,068 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 01:05:40,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 01:05:40,069 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 01:05:40,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 01:05:40,069 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 01:05:40,070 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 01:05:40,071 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 01:05:40,072 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 01:05:40,072 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 01:05:40,073 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 01:05:40,073 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 01:05:40,073 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 01:05:40,073 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 01:05:40,073 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 01:05:40,073 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 01:05:40,074 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 01:05:40,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 01:05:40,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 01:05:40,076 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 01:05:40,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 01:05:40,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 01:05:40,077 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 -> ed0ef8676714c03e409913657b72922b069856bc [2019-01-12 01:05:40,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 01:05:40,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 01:05:40,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 01:05:40,166 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 01:05:40,167 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 01:05:40,168 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem03_label48_true-unreach-call.c [2019-01-12 01:05:40,226 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319374e31/bf5e45c9a8c2465dbb9d74c21426bf52/FLAG5e15a1f94 [2019-01-12 01:05:40,815 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 01:05:40,816 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem03_label48_true-unreach-call.c [2019-01-12 01:05:40,833 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319374e31/bf5e45c9a8c2465dbb9d74c21426bf52/FLAG5e15a1f94 [2019-01-12 01:05:41,000 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319374e31/bf5e45c9a8c2465dbb9d74c21426bf52 [2019-01-12 01:05:41,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 01:05:41,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 01:05:41,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 01:05:41,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 01:05:41,012 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 01:05:41,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:05:41" (1/1) ... [2019-01-12 01:05:41,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f18ab64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:41, skipping insertion in model container [2019-01-12 01:05:41,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:05:41" (1/1) ... [2019-01-12 01:05:41,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 01:05:41,120 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 01:05:41,824 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:05:41,830 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 01:05:42,134 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:05:42,323 INFO L195 MainTranslator]: Completed translation [2019-01-12 01:05:42,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42 WrapperNode [2019-01-12 01:05:42,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 01:05:42,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 01:05:42,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 01:05:42,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 01:05:42,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 01:05:42,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 01:05:42,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 01:05:42,470 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 01:05:42,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (1/1) ... [2019-01-12 01:05:42,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 01:05:42,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 01:05:42,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 01:05:42,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 01:05:42,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (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 01:05:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 01:05:42,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 01:05:47,646 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 01:05:47,647 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 01:05:47,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:47 BoogieIcfgContainer [2019-01-12 01:05:47,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 01:05:47,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 01:05:47,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 01:05:47,653 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 01:05:47,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 01:05:41" (1/3) ... [2019-01-12 01:05:47,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456da5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:05:47, skipping insertion in model container [2019-01-12 01:05:47,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:05:42" (2/3) ... [2019-01-12 01:05:47,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456da5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:05:47, skipping insertion in model container [2019-01-12 01:05:47,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:47" (3/3) ... [2019-01-12 01:05:47,656 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label48_true-unreach-call.c [2019-01-12 01:05:47,666 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 01:05:47,674 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 01:05:47,690 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 01:05:47,725 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 01:05:47,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 01:05:47,726 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 01:05:47,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 01:05:47,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 01:05:47,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 01:05:47,727 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 01:05:47,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 01:05:47,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 01:05:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-01-12 01:05:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-12 01:05:47,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:47,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:47,773 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:47,780 INFO L82 PathProgramCache]: Analyzing trace with hash -819677325, now seen corresponding path program 1 times [2019-01-12 01:05:47,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:47,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:47,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:48,702 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 01:05:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:48,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:48,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:48,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:48,731 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-01-12 01:05:52,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:52,143 INFO L93 Difference]: Finished difference Result 1075 states and 1929 transitions. [2019-01-12 01:05:52,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:52,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-01-12 01:05:52,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:52,169 INFO L225 Difference]: With dead ends: 1075 [2019-01-12 01:05:52,169 INFO L226 Difference]: Without dead ends: 677 [2019-01-12 01:05:52,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 01:05:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-12 01:05:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 451. [2019-01-12 01:05:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-01-12 01:05:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 700 transitions. [2019-01-12 01:05:52,252 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 700 transitions. Word has length 183 [2019-01-12 01:05:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:52,253 INFO L480 AbstractCegarLoop]: Abstraction has 451 states and 700 transitions. [2019-01-12 01:05:52,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 700 transitions. [2019-01-12 01:05:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-12 01:05:52,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:52,260 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 01:05:52,260 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1598798580, now seen corresponding path program 1 times [2019-01-12 01:05:52,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:52,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:52,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:52,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:05:52,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:05:52,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:05:52,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:52,428 INFO L87 Difference]: Start difference. First operand 451 states and 700 transitions. Second operand 3 states. [2019-01-12 01:05:54,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:54,209 INFO L93 Difference]: Finished difference Result 1323 states and 2069 transitions. [2019-01-12 01:05:54,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:05:54,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-01-12 01:05:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:54,218 INFO L225 Difference]: With dead ends: 1323 [2019-01-12 01:05:54,218 INFO L226 Difference]: Without dead ends: 874 [2019-01-12 01:05:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:05:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-01-12 01:05:54,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 859. [2019-01-12 01:05:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-01-12 01:05:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1316 transitions. [2019-01-12 01:05:54,272 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1316 transitions. Word has length 191 [2019-01-12 01:05:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:54,273 INFO L480 AbstractCegarLoop]: Abstraction has 859 states and 1316 transitions. [2019-01-12 01:05:54,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:05:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1316 transitions. [2019-01-12 01:05:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-12 01:05:54,278 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:54,278 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 01:05:54,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:54,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1173366829, now seen corresponding path program 1 times [2019-01-12 01:05:54,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:05:54,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:54,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:05:54,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:54,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:54,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:54,392 INFO L87 Difference]: Start difference. First operand 859 states and 1316 transitions. Second operand 4 states. [2019-01-12 01:05:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:05:59,041 INFO L93 Difference]: Finished difference Result 3364 states and 5170 transitions. [2019-01-12 01:05:59,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:05:59,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-12 01:05:59,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:05:59,055 INFO L225 Difference]: With dead ends: 3364 [2019-01-12 01:05:59,055 INFO L226 Difference]: Without dead ends: 2507 [2019-01-12 01:05:59,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 01:05:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2019-01-12 01:05:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1682. [2019-01-12 01:05:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-01-12 01:05:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2434 transitions. [2019-01-12 01:05:59,111 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2434 transitions. Word has length 192 [2019-01-12 01:05:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:05:59,112 INFO L480 AbstractCegarLoop]: Abstraction has 1682 states and 2434 transitions. [2019-01-12 01:05:59,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:05:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2434 transitions. [2019-01-12 01:05:59,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-12 01:05:59,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:05:59,118 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-01-12 01:05:59,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:05:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:05:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -73581847, now seen corresponding path program 1 times [2019-01-12 01:05:59,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:05:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:05:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:59,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:05:59,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:05:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:05:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:05:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:05:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:05:59,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:05:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:05:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:05:59,567 INFO L87 Difference]: Start difference. First operand 1682 states and 2434 transitions. Second operand 4 states. [2019-01-12 01:06:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:01,367 INFO L93 Difference]: Finished difference Result 6614 states and 9588 transitions. [2019-01-12 01:06:01,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:06:01,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-01-12 01:06:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:01,393 INFO L225 Difference]: With dead ends: 6614 [2019-01-12 01:06:01,393 INFO L226 Difference]: Without dead ends: 4934 [2019-01-12 01:06:01,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 01:06:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-01-12 01:06:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-01-12 01:06:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-01-12 01:06:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 6537 transitions. [2019-01-12 01:06:01,498 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 6537 transitions. Word has length 198 [2019-01-12 01:06:01,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:01,499 INFO L480 AbstractCegarLoop]: Abstraction has 4932 states and 6537 transitions. [2019-01-12 01:06:01,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:01,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 6537 transitions. [2019-01-12 01:06:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-12 01:06:01,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:01,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:01,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1185291772, now seen corresponding path program 1 times [2019-01-12 01:06:01,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:01,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:01,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:01,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:01,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:01,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:06:01,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:06:01,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:06:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:01,769 INFO L87 Difference]: Start difference. First operand 4932 states and 6537 transitions. Second operand 3 states. [2019-01-12 01:06:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:03,571 INFO L93 Difference]: Finished difference Result 11905 states and 15682 transitions. [2019-01-12 01:06:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:03,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-01-12 01:06:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:03,601 INFO L225 Difference]: With dead ends: 11905 [2019-01-12 01:06:03,602 INFO L226 Difference]: Without dead ends: 6975 [2019-01-12 01:06:03,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states. [2019-01-12 01:06:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 6974. [2019-01-12 01:06:03,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6974 states. [2019-01-12 01:06:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8983 transitions. [2019-01-12 01:06:03,728 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8983 transitions. Word has length 224 [2019-01-12 01:06:03,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:03,729 INFO L480 AbstractCegarLoop]: Abstraction has 6974 states and 8983 transitions. [2019-01-12 01:06:03,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:06:03,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8983 transitions. [2019-01-12 01:06:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-12 01:06:03,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:03,745 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:03,745 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash -321194833, now seen corresponding path program 1 times [2019-01-12 01:06:03,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:03,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:03,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:04,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:06:04,026 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 01:06:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:04,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:06:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:06:04,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:06:04,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 01:06:04,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 01:06:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 01:06:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 01:06:04,393 INFO L87 Difference]: Start difference. First operand 6974 states and 8983 transitions. Second operand 7 states. [2019-01-12 01:06:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:10,589 INFO L93 Difference]: Finished difference Result 27155 states and 34834 transitions. [2019-01-12 01:06:10,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 01:06:10,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-01-12 01:06:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:10,644 INFO L225 Difference]: With dead ends: 27155 [2019-01-12 01:06:10,644 INFO L226 Difference]: Without dead ends: 20183 [2019-01-12 01:06:10,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 01:06:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20183 states. [2019-01-12 01:06:10,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20183 to 19365. [2019-01-12 01:06:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19365 states. [2019-01-12 01:06:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19365 states to 19365 states and 22674 transitions. [2019-01-12 01:06:10,932 INFO L78 Accepts]: Start accepts. Automaton has 19365 states and 22674 transitions. Word has length 231 [2019-01-12 01:06:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:10,933 INFO L480 AbstractCegarLoop]: Abstraction has 19365 states and 22674 transitions. [2019-01-12 01:06:10,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 01:06:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 19365 states and 22674 transitions. [2019-01-12 01:06:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-12 01:06:10,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:10,968 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, 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] [2019-01-12 01:06:10,968 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 768090626, now seen corresponding path program 1 times [2019-01-12 01:06:10,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:10,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:11,440 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 01:06:11,528 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:11,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:06:11,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:06:11,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:11,532 INFO L87 Difference]: Start difference. First operand 19365 states and 22674 transitions. Second operand 4 states. [2019-01-12 01:06:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:14,146 INFO L93 Difference]: Finished difference Result 47914 states and 55772 transitions. [2019-01-12 01:06:14,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:06:14,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-01-12 01:06:14,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:14,208 INFO L225 Difference]: With dead ends: 47914 [2019-01-12 01:06:14,208 INFO L226 Difference]: Without dead ends: 28551 [2019-01-12 01:06:14,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28551 states. [2019-01-12 01:06:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28551 to 22221. [2019-01-12 01:06:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22221 states. [2019-01-12 01:06:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22221 states to 22221 states and 25706 transitions. [2019-01-12 01:06:14,882 INFO L78 Accepts]: Start accepts. Automaton has 22221 states and 25706 transitions. Word has length 246 [2019-01-12 01:06:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:14,883 INFO L480 AbstractCegarLoop]: Abstraction has 22221 states and 25706 transitions. [2019-01-12 01:06:14,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 22221 states and 25706 transitions. [2019-01-12 01:06:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-12 01:06:14,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:14,927 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:14,927 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:14,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1718686317, now seen corresponding path program 1 times [2019-01-12 01:06:14,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:14,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:14,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:14,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:14,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:06:15,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:06:15,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:06:15,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:15,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:06:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:06:15,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:06:15,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 01:06:15,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 01:06:15,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 01:06:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 01:06:15,719 INFO L87 Difference]: Start difference. First operand 22221 states and 25706 transitions. Second operand 6 states. [2019-01-12 01:06:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:20,667 INFO L93 Difference]: Finished difference Result 91262 states and 107370 transitions. [2019-01-12 01:06:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 01:06:20,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-01-12 01:06:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:20,778 INFO L225 Difference]: With dead ends: 91262 [2019-01-12 01:06:20,778 INFO L226 Difference]: Without dead ends: 69043 [2019-01-12 01:06:20,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 01:06:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69043 states. [2019-01-12 01:06:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69043 to 67360. [2019-01-12 01:06:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67360 states. [2019-01-12 01:06:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67360 states to 67360 states and 77199 transitions. [2019-01-12 01:06:22,153 INFO L78 Accepts]: Start accepts. Automaton has 67360 states and 77199 transitions. Word has length 253 [2019-01-12 01:06:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:22,153 INFO L480 AbstractCegarLoop]: Abstraction has 67360 states and 77199 transitions. [2019-01-12 01:06:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 01:06:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 67360 states and 77199 transitions. [2019-01-12 01:06:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-12 01:06:22,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:22,217 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:22,218 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:22,218 INFO L82 PathProgramCache]: Analyzing trace with hash -856441899, now seen corresponding path program 1 times [2019-01-12 01:06:22,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-01-12 01:06:22,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:06:22,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:06:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:06:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:22,582 INFO L87 Difference]: Start difference. First operand 67360 states and 77199 transitions. Second operand 3 states. [2019-01-12 01:06:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:24,044 INFO L93 Difference]: Finished difference Result 124300 states and 141905 transitions. [2019-01-12 01:06:24,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:24,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-01-12 01:06:24,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:24,111 INFO L225 Difference]: With dead ends: 124300 [2019-01-12 01:06:24,111 INFO L226 Difference]: Without dead ends: 56942 [2019-01-12 01:06:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:24,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56942 states. [2019-01-12 01:06:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56942 to 50040. [2019-01-12 01:06:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50040 states. [2019-01-12 01:06:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50040 states to 50040 states and 56696 transitions. [2019-01-12 01:06:25,324 INFO L78 Accepts]: Start accepts. Automaton has 50040 states and 56696 transitions. Word has length 350 [2019-01-12 01:06:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:25,325 INFO L480 AbstractCegarLoop]: Abstraction has 50040 states and 56696 transitions. [2019-01-12 01:06:25,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:06:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 50040 states and 56696 transitions. [2019-01-12 01:06:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2019-01-12 01:06:25,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:25,383 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-01-12 01:06:25,384 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:25,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2041124126, now seen corresponding path program 1 times [2019-01-12 01:06:25,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:25,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:25,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:25,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:25,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-01-12 01:06:25,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:25,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:25,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:06:25,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:06:25,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:06:25,914 INFO L87 Difference]: Start difference. First operand 50040 states and 56696 transitions. Second operand 4 states. [2019-01-12 01:06:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:27,328 INFO L93 Difference]: Finished difference Result 102950 states and 116548 transitions. [2019-01-12 01:06:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:27,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 407 [2019-01-12 01:06:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:27,380 INFO L225 Difference]: With dead ends: 102950 [2019-01-12 01:06:27,380 INFO L226 Difference]: Without dead ends: 52912 [2019-01-12 01:06:27,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 01:06:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52912 states. [2019-01-12 01:06:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52912 to 50040. [2019-01-12 01:06:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50040 states. [2019-01-12 01:06:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50040 states to 50040 states and 56321 transitions. [2019-01-12 01:06:27,936 INFO L78 Accepts]: Start accepts. Automaton has 50040 states and 56321 transitions. Word has length 407 [2019-01-12 01:06:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:27,937 INFO L480 AbstractCegarLoop]: Abstraction has 50040 states and 56321 transitions. [2019-01-12 01:06:27,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:06:27,937 INFO L276 IsEmpty]: Start isEmpty. Operand 50040 states and 56321 transitions. [2019-01-12 01:06:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-12 01:06:27,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:27,980 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:27,980 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1920691293, now seen corresponding path program 1 times [2019-01-12 01:06:27,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:27,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:27,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:27,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-01-12 01:06:28,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:28,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:06:28,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:06:28,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:06:28,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:28,851 INFO L87 Difference]: Start difference. First operand 50040 states and 56321 transitions. Second operand 3 states. [2019-01-12 01:06:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:31,106 INFO L93 Difference]: Finished difference Result 96226 states and 108267 transitions. [2019-01-12 01:06:31,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:06:31,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 416 [2019-01-12 01:06:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:31,147 INFO L225 Difference]: With dead ends: 96226 [2019-01-12 01:06:31,147 INFO L226 Difference]: Without dead ends: 46188 [2019-01-12 01:06:31,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:06:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46188 states. [2019-01-12 01:06:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46188 to 39281. [2019-01-12 01:06:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39281 states. [2019-01-12 01:06:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39281 states to 39281 states and 43381 transitions. [2019-01-12 01:06:31,577 INFO L78 Accepts]: Start accepts. Automaton has 39281 states and 43381 transitions. Word has length 416 [2019-01-12 01:06:31,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:31,578 INFO L480 AbstractCegarLoop]: Abstraction has 39281 states and 43381 transitions. [2019-01-12 01:06:31,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:06:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 39281 states and 43381 transitions. [2019-01-12 01:06:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-01-12 01:06:31,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:31,604 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:31,604 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1750583566, now seen corresponding path program 1 times [2019-01-12 01:06:31,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:31,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:31,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:31,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-01-12 01:06:32,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:06:32,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:06:32,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 01:06:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 01:06:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:06:32,454 INFO L87 Difference]: Start difference. First operand 39281 states and 43381 transitions. Second operand 5 states. [2019-01-12 01:06:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:35,328 INFO L93 Difference]: Finished difference Result 175015 states and 192810 transitions. [2019-01-12 01:06:35,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 01:06:35,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 428 [2019-01-12 01:06:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:35,461 INFO L225 Difference]: With dead ends: 175015 [2019-01-12 01:06:35,462 INFO L226 Difference]: Without dead ends: 135736 [2019-01-12 01:06:35,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:06:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135736 states. [2019-01-12 01:06:36,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135736 to 98290. [2019-01-12 01:06:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98290 states. [2019-01-12 01:06:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98290 states to 98290 states and 107970 transitions. [2019-01-12 01:06:37,673 INFO L78 Accepts]: Start accepts. Automaton has 98290 states and 107970 transitions. Word has length 428 [2019-01-12 01:06:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:37,673 INFO L480 AbstractCegarLoop]: Abstraction has 98290 states and 107970 transitions. [2019-01-12 01:06:37,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 01:06:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 98290 states and 107970 transitions. [2019-01-12 01:06:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2019-01-12 01:06:37,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:06:37,709 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:06:37,710 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:06:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:06:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1234793160, now seen corresponding path program 1 times [2019-01-12 01:06:37,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:06:37,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:06:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:06:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 297 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-12 01:06:38,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:06:38,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:06:38,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:06:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:06:39,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:06:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-01-12 01:06:39,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:06:39,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 01:06:39,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 01:06:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 01:06:39,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 01:06:39,597 INFO L87 Difference]: Start difference. First operand 98290 states and 107970 transitions. Second operand 7 states. [2019-01-12 01:06:39,889 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 6 [2019-01-12 01:06:46,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:06:46,291 INFO L93 Difference]: Finished difference Result 280946 states and 308448 transitions. [2019-01-12 01:06:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 01:06:46,292 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 450 [2019-01-12 01:06:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:06:46,293 INFO L225 Difference]: With dead ends: 280946 [2019-01-12 01:06:46,293 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 01:06:46,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 01:06:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 01:06:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 01:06:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 01:06:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 01:06:46,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 450 [2019-01-12 01:06:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:06:46,352 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 01:06:46,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 01:06:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 01:06:46,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 01:06:46,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 01:06:47,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:47,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:48,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:49,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:49,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:49,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:49,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:50,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:50,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:50,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:51,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:53,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:53,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:54,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:55,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:55,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:55,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:56,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:56,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:56,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:56,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:56,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:57,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:58,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:58,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:58,892 WARN L181 SmtUtils]: Spent 12.52 s on a formula simplification. DAG size of input: 1780 DAG size of output: 1173 [2019-01-12 01:06:59,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,388 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:06:59,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:00,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:00,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:00,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:00,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:00,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:01,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:02,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:02,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:02,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:02,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:03,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:04,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:04,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:04,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:05,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:06,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:07,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:07,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:07:07,912 WARN L181 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 1780 DAG size of output: 1173 [2019-01-12 01:07:26,044 WARN L181 SmtUtils]: Spent 18.12 s on a formula simplification. DAG size of input: 1063 DAG size of output: 82 [2019-01-12 01:07:43,605 WARN L181 SmtUtils]: Spent 17.55 s on a formula simplification. DAG size of input: 1063 DAG size of output: 82 [2019-01-12 01:07:43,608 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:07:43,608 INFO L448 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:07:43,608 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-01-12 01:07:43,609 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,610 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,611 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-01-12 01:07:43,612 INFO L448 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-01-12 01:07:43,613 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,613 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:07:43,620 INFO L448 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:07:43,621 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,621 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,621 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,621 INFO L448 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,624 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,625 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:07:43,626 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:07:43,627 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,627 INFO L448 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-01-12 01:07:43,630 INFO L448 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,631 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:07:43,632 INFO L448 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,632 INFO L448 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-01-12 01:07:43,632 INFO L448 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,635 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,636 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,636 INFO L444 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse2 (= ~a6~0 1))) (let ((.cse5 (= ~a11~0 1)) (.cse7 (= ~a3~0 1)) (.cse15 (= ~a27~0 1)) (.cse13 (not (= ~a12~0 1))) (.cse16 (not .cse2))) (let ((.cse18 (and .cse13 .cse16)) (.cse6 (= ~a16~0 1)) (.cse1 (= ~a27~0 ~a7~0)) (.cse8 (= ~a10~0 1)) (.cse20 (and .cse13 .cse15 .cse16)) (.cse0 (= ~a7~0 0)) (.cse11 (not .cse7)) (.cse3 (<= ~a26~0 0)) (.cse19 (not .cse5)) (.cse17 (<= ~a27~0 0)) (.cse9 (or (= 0 ~a7~0) (= ~a7~0 1))) (.cse10 (and .cse15 .cse16)) (.cse4 (= ~a5~0 1)) (.cse12 (= ~a26~0 1)) (.cse14 (= ~a3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse5 .cse4 .cse12) (and .cse9 .cse2 .cse13 .cse4 .cse12 .cse6 .cse14) (and .cse0 .cse15 .cse11 .cse3 .cse4) (and .cse0 .cse3 (and .cse15 .cse13 .cse4)) (and .cse16 .cse9 .cse3 .cse4 .cse14 .cse17) (and .cse9 .cse18 .cse3 .cse4 .cse19 .cse17) (and .cse0 .cse3 .cse4 .cse14 .cse17) (and .cse9 .cse11 .cse4 .cse12 .cse6 .cse17) (and (and .cse15 .cse13 .cse11 .cse4) .cse9 .cse3) (and .cse9 .cse10 .cse11 .cse3 .cse4) (and .cse9 .cse18 .cse4 .cse12 .cse17) (and .cse16 .cse9 .cse11 .cse4 .cse12 .cse17) (and .cse0 .cse2 .cse13 .cse11 .cse4 .cse19 .cse12 .cse6) (and .cse15 .cse9 .cse2 .cse4 .cse12) (and .cse16 .cse9 .cse4 .cse5 .cse12 .cse6 .cse14) (and .cse0 (and .cse13 .cse8 .cse2 .cse11 .cse3 .cse4)) (and .cse0 (and .cse8 .cse2 .cse13 .cse4 .cse19 .cse12 .cse14)) (and .cse15 .cse9 .cse13 .cse3 .cse4 .cse19) (and .cse9 .cse4 .cse19 .cse12 .cse7 .cse20) (and .cse9 .cse18 .cse11 .cse3 .cse4 .cse6 .cse17) (and (and .cse15 .cse5 .cse3 .cse4 .cse14) .cse9) (and .cse9 .cse5 .cse4 .cse12 .cse14 .cse17) (and .cse16 .cse9 .cse4 .cse5 .cse12 .cse17) (and .cse0 .cse1 (and .cse8 .cse2 .cse3 .cse4)) (and .cse9 .cse13 .cse4 .cse5 .cse12 .cse17) (and .cse9 .cse2 .cse13 .cse11 .cse3 .cse4 .cse19 .cse6) (and .cse0 .cse13 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse4 .cse12 .cse17) (and .cse8 .cse9 .cse2 .cse13 .cse11 .cse3 .cse4 .cse19) (and .cse9 (and .cse11 .cse4 .cse5 .cse20) .cse12) (and (and .cse11 .cse20) .cse8 .cse9 .cse4 .cse12) (and .cse8 .cse15 .cse9 .cse11 .cse3 .cse4) (and .cse9 .cse3 .cse4 .cse20) (and .cse0 .cse15 .cse4 .cse12) (and .cse9 .cse13 .cse11 .cse3 .cse4 .cse19 .cse17) (and .cse9 .cse10 .cse4 .cse12 .cse14))))) [2019-01-12 01:07:43,637 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 01:07:43,643 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L451 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,644 INFO L448 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:07:43,645 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L444 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse2 (= ~a6~0 1))) (let ((.cse5 (= ~a11~0 1)) (.cse7 (= ~a3~0 1)) (.cse15 (= ~a27~0 1)) (.cse13 (not (= ~a12~0 1))) (.cse16 (not .cse2))) (let ((.cse18 (and .cse13 .cse16)) (.cse6 (= ~a16~0 1)) (.cse1 (= ~a27~0 ~a7~0)) (.cse8 (= ~a10~0 1)) (.cse20 (and .cse13 .cse15 .cse16)) (.cse0 (= ~a7~0 0)) (.cse11 (not .cse7)) (.cse3 (<= ~a26~0 0)) (.cse19 (not .cse5)) (.cse17 (<= ~a27~0 0)) (.cse9 (or (= 0 ~a7~0) (= ~a7~0 1))) (.cse10 (and .cse15 .cse16)) (.cse4 (= ~a5~0 1)) (.cse12 (= ~a26~0 1)) (.cse14 (= ~a3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse5 .cse4 .cse12) (and .cse9 .cse2 .cse13 .cse4 .cse12 .cse6 .cse14) (and .cse0 .cse15 .cse11 .cse3 .cse4) (and .cse0 .cse3 (and .cse15 .cse13 .cse4)) (and .cse16 .cse9 .cse3 .cse4 .cse14 .cse17) (and .cse9 .cse18 .cse3 .cse4 .cse19 .cse17) (and .cse0 .cse3 .cse4 .cse14 .cse17) (and .cse9 .cse11 .cse4 .cse12 .cse6 .cse17) (and (and .cse15 .cse13 .cse11 .cse4) .cse9 .cse3) (and .cse9 .cse10 .cse11 .cse3 .cse4) (and .cse9 .cse18 .cse4 .cse12 .cse17) (and .cse16 .cse9 .cse11 .cse4 .cse12 .cse17) (and .cse0 .cse2 .cse13 .cse11 .cse4 .cse19 .cse12 .cse6) (and .cse15 .cse9 .cse2 .cse4 .cse12) (and .cse16 .cse9 .cse4 .cse5 .cse12 .cse6 .cse14) (and .cse0 (and .cse13 .cse8 .cse2 .cse11 .cse3 .cse4)) (and .cse0 (and .cse8 .cse2 .cse13 .cse4 .cse19 .cse12 .cse14)) (and .cse15 .cse9 .cse13 .cse3 .cse4 .cse19) (and .cse9 .cse4 .cse19 .cse12 .cse7 .cse20) (and .cse9 .cse18 .cse11 .cse3 .cse4 .cse6 .cse17) (and (and .cse15 .cse5 .cse3 .cse4 .cse14) .cse9) (and .cse9 .cse5 .cse4 .cse12 .cse14 .cse17) (and .cse16 .cse9 .cse4 .cse5 .cse12 .cse17) (and .cse0 .cse1 (and .cse8 .cse2 .cse3 .cse4)) (and .cse9 .cse13 .cse4 .cse5 .cse12 .cse17) (and .cse9 .cse2 .cse13 .cse11 .cse3 .cse4 .cse19 .cse6) (and .cse0 .cse13 .cse1 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse4 .cse12 .cse17) (and .cse8 .cse9 .cse2 .cse13 .cse11 .cse3 .cse4 .cse19) (and .cse9 (and .cse11 .cse4 .cse5 .cse20) .cse12) (and (and .cse11 .cse20) .cse8 .cse9 .cse4 .cse12) (and .cse8 .cse15 .cse9 .cse11 .cse3 .cse4) (and .cse9 .cse3 .cse4 .cse20) (and .cse0 .cse15 .cse4 .cse12) (and .cse9 .cse13 .cse11 .cse3 .cse4 .cse19 .cse17) (and .cse9 .cse10 .cse4 .cse12 .cse14))))) [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-01-12 01:07:43,646 INFO L448 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-01-12 01:07:43,647 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,647 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:07:43,650 INFO L448 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-01-12 01:07:43,651 INFO L448 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,652 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,653 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,653 INFO L448 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,653 INFO L448 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,656 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,657 INFO L448 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1584) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,658 INFO L448 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-01-12 01:07:43,659 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,659 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 01:07:43,661 INFO L448 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,662 INFO L448 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,663 INFO L448 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-01-12 01:07:43,664 INFO L448 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-01-12 01:07:43,664 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,664 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-01-12 01:07:43,664 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-01-12 01:07:43,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 01:07:43 BoogieIcfgContainer [2019-01-12 01:07:43,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 01:07:43,759 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 01:07:43,760 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 01:07:43,763 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 01:07:43,764 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:05:47" (3/4) ... [2019-01-12 01:07:43,774 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 01:07:43,820 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 01:07:43,824 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 01:07:44,203 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 01:07:44,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 01:07:44,204 INFO L168 Benchmark]: Toolchain (without parser) took 123198.38 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 942.0 MB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,205 INFO L168 Benchmark]: CDTParser took 0.17 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 01:07:44,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1316.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,206 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,206 INFO L168 Benchmark]: Boogie Preprocessor took 121.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,207 INFO L168 Benchmark]: RCFGBuilder took 5057.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.7 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,207 INFO L168 Benchmark]: TraceAbstraction took 116109.60 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 878.7 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,207 INFO L168 Benchmark]: Witness Printer took 443.81 ms. Allocated memory is still 5.2 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-01-12 01:07:44,212 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.17 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 1316.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 942.0 MB in the beginning and 1.2 GB in the end (delta: -209.8 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5057.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 878.7 MB in the end (delta: 246.7 MB). Peak memory consumption was 246.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116109.60 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 878.7 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 443.81 ms. Allocated memory is still 5.2 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1584]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a7 == 0 && a27 == a7) && a6 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1) && a3 == 1) || ((((((a10 == 1 && (0 == a7 || a7 == 1)) && a27 == 1 && !(a6 == 1)) && !(a3 == 1)) && a11 == 1) && a5 == 1) && a26 == 1)) || (((((((0 == a7 || a7 == 1) && a6 == 1) && !(a12 == 1)) && a5 == 1) && a26 == 1) && a16 == 1) && a3 == 0)) || ((((a7 == 0 && a27 == 1) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((a7 == 0 && a26 <= 0) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a26 <= 0) && a5 == 1) && a3 == 0) && a27 <= 0)) || ((((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || ((((a7 == 0 && a26 <= 0) && a5 == 1) && a3 == 0) && a27 <= 0)) || ((((((0 == a7 || a7 == 1) && !(a3 == 1)) && a5 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((((a27 == 1 && !(a12 == 1)) && !(a3 == 1)) && a5 == 1) && (0 == a7 || a7 == 1)) && a26 <= 0)) || (((((0 == a7 || a7 == 1) && a27 == 1 && !(a6 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || (((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && !(a3 == 1)) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((((a7 == 0 && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || ((((a27 == 1 && (0 == a7 || a7 == 1)) && a6 == 1) && a5 == 1) && a26 == 1)) || ((((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a3 == 0)) || (a7 == 0 && ((((!(a12 == 1) && a10 == 1) && a6 == 1) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || (a7 == 0 && (((((a10 == 1 && a6 == 1) && !(a12 == 1)) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a3 == 0)) || (((((a27 == 1 && (0 == a7 || a7 == 1)) && !(a12 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || ((((((0 == a7 || a7 == 1) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a3 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && a16 == 1) && a27 <= 0)) || (((((a27 == 1 && a11 == 1) && a26 <= 0) && a5 == 1) && a3 == 0) && (0 == a7 || a7 == 1))) || ((((((0 == a7 || a7 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a3 == 0) && a27 <= 0)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a27 <= 0)) || ((a7 == 0 && a27 == a7) && ((a10 == 1 && a6 == 1) && a26 <= 0) && a5 == 1)) || ((((((0 == a7 || a7 == 1) && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a27 <= 0)) || ((((((((0 == a7 || a7 == 1) && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a16 == 1)) || (((((a7 == 0 && !(a12 == 1)) && a27 == a7) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((((a7 == 0 && a6 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((((a10 == 1 && (0 == a7 || a7 == 1)) && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || (((0 == a7 || a7 == 1) && ((!(a3 == 1) && a5 == 1) && a11 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a26 == 1)) || (((((!(a3 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a10 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && (0 == a7 || a7 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((((0 == a7 || a7 == 1) && a26 <= 0) && a5 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((a7 == 0 && a27 == 1) && a5 == 1) && a26 == 1)) || (((((((0 == a7 || a7 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || (((((0 == a7 || a7 == 1) && a27 == 1 && !(a6 == 1)) && a5 == 1) && a26 == 1) && a3 == 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((a7 == 0 && a27 == a7) && a6 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && a16 == 1) && a3 == 1) || ((((((a10 == 1 && (0 == a7 || a7 == 1)) && a27 == 1 && !(a6 == 1)) && !(a3 == 1)) && a11 == 1) && a5 == 1) && a26 == 1)) || (((((((0 == a7 || a7 == 1) && a6 == 1) && !(a12 == 1)) && a5 == 1) && a26 == 1) && a16 == 1) && a3 == 0)) || ((((a7 == 0 && a27 == 1) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((a7 == 0 && a26 <= 0) && (a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a26 <= 0) && a5 == 1) && a3 == 0) && a27 <= 0)) || ((((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || ((((a7 == 0 && a26 <= 0) && a5 == 1) && a3 == 0) && a27 <= 0)) || ((((((0 == a7 || a7 == 1) && !(a3 == 1)) && a5 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || (((((a27 == 1 && !(a12 == 1)) && !(a3 == 1)) && a5 == 1) && (0 == a7 || a7 == 1)) && a26 <= 0)) || (((((0 == a7 || a7 == 1) && a27 == 1 && !(a6 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || (((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && !(a3 == 1)) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((((a7 == 0 && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1)) || ((((a27 == 1 && (0 == a7 || a7 == 1)) && a6 == 1) && a5 == 1) && a26 == 1)) || ((((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a3 == 0)) || (a7 == 0 && ((((!(a12 == 1) && a10 == 1) && a6 == 1) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || (a7 == 0 && (((((a10 == 1 && a6 == 1) && !(a12 == 1)) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a3 == 0)) || (((((a27 == 1 && (0 == a7 || a7 == 1)) && !(a12 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || ((((((0 == a7 || a7 == 1) && a5 == 1) && !(a11 == 1)) && a26 == 1) && a3 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((((((0 == a7 || a7 == 1) && !(a12 == 1) && !(a6 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && a16 == 1) && a27 <= 0)) || (((((a27 == 1 && a11 == 1) && a26 <= 0) && a5 == 1) && a3 == 0) && (0 == a7 || a7 == 1))) || ((((((0 == a7 || a7 == 1) && a11 == 1) && a5 == 1) && a26 == 1) && a3 == 0) && a27 <= 0)) || (((((!(a6 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a27 <= 0)) || ((a7 == 0 && a27 == a7) && ((a10 == 1 && a6 == 1) && a26 <= 0) && a5 == 1)) || ((((((0 == a7 || a7 == 1) && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a27 <= 0)) || ((((((((0 == a7 || a7 == 1) && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a16 == 1)) || (((((a7 == 0 && !(a12 == 1)) && a27 == a7) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((((a7 == 0 && a6 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((((((a10 == 1 && (0 == a7 || a7 == 1)) && a6 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1))) || (((0 == a7 || a7 == 1) && ((!(a3 == 1) && a5 == 1) && a11 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a26 == 1)) || (((((!(a3 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a10 == 1) && (0 == a7 || a7 == 1)) && a5 == 1) && a26 == 1)) || (((((a10 == 1 && a27 == 1) && (0 == a7 || a7 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1)) || ((((0 == a7 || a7 == 1) && a26 <= 0) && a5 == 1) && (!(a12 == 1) && a27 == 1) && !(a6 == 1))) || (((a7 == 0 && a27 == 1) && a5 == 1) && a26 == 1)) || (((((((0 == a7 || a7 == 1) && !(a12 == 1)) && !(a3 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || (((((0 == a7 || a7 == 1) && a27 == 1 && !(a6 == 1)) && a5 == 1) && a26 == 1) && a3 == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. SAFE Result, 115.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 42.8s AutomataDifference, 0.0s DeadEndRemovalTime, 57.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2000 SDtfs, 9158 SDslu, 919 SDs, 0 SdLazy, 17591 SolverSat, 4087 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1007 GetRequests, 958 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98290occurred in iteration=12, 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: 6.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 64027 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1746 NumberOfFragments, 1875 HoareAnnotationTreeSize, 3 FomulaSimplifications, 132196 FormulaSimplificationTreeSizeReduction, 21.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 106052 FormulaSimplificationTreeSizeReductionInter, 35.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 4703 NumberOfCodeBlocks, 4703 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4687 ConstructedInterpolants, 0 QuantifiedInterpolants, 3514062 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1571 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 2600/2716 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...