./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem03_label30_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_label30_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 a6cbe3293b85565129a3e8511797ba8de37ca63e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03:21,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 01:03:21,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 01:03:21,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 01:03:21,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 01:03:21,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 01:03:21,660 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 01:03:21,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 01:03:21,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 01:03:21,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 01:03:21,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 01:03:21,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 01:03:21,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 01:03:21,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 01:03:21,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 01:03:21,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 01:03:21,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 01:03:21,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 01:03:21,676 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 01:03:21,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 01:03:21,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 01:03:21,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 01:03:21,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 01:03:21,684 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 01:03:21,684 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 01:03:21,685 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 01:03:21,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 01:03:21,687 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 01:03:21,688 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 01:03:21,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 01:03:21,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 01:03:21,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 01:03:21,691 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 01:03:21,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 01:03:21,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 01:03:21,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 01:03:21,693 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:03:21,709 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 01:03:21,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 01:03:21,711 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 01:03:21,711 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 01:03:21,711 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 01:03:21,712 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 01:03:21,712 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 01:03:21,712 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 01:03:21,712 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 01:03:21,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 01:03:21,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 01:03:21,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 01:03:21,715 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 01:03:21,715 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 01:03:21,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 01:03:21,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 01:03:21,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 01:03:21,716 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 01:03:21,716 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 01:03:21,716 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 01:03:21,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 01:03:21,718 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 01:03:21,718 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 01:03:21,718 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 -> a6cbe3293b85565129a3e8511797ba8de37ca63e [2019-01-12 01:03:21,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 01:03:21,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 01:03:21,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 01:03:21,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 01:03:21,772 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 01:03:21,773 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem03_label30_true-unreach-call.c [2019-01-12 01:03:21,831 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b31f50/e5300c3e68ab47ef8806eebc2548b907/FLAG1ad7d5cf5 [2019-01-12 01:03:22,429 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 01:03:22,430 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem03_label30_true-unreach-call.c [2019-01-12 01:03:22,453 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b31f50/e5300c3e68ab47ef8806eebc2548b907/FLAG1ad7d5cf5 [2019-01-12 01:03:22,604 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c38b31f50/e5300c3e68ab47ef8806eebc2548b907 [2019-01-12 01:03:22,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 01:03:22,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 01:03:22,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 01:03:22,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 01:03:22,616 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 01:03:22,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:03:22" (1/1) ... [2019-01-12 01:03:22,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755d3b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:22, skipping insertion in model container [2019-01-12 01:03:22,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 01:03:22" (1/1) ... [2019-01-12 01:03:22,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 01:03:22,714 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 01:03:23,512 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:03:23,523 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 01:03:24,011 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 01:03:24,227 INFO L195 MainTranslator]: Completed translation [2019-01-12 01:03:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24 WrapperNode [2019-01-12 01:03:24,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 01:03:24,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 01:03:24,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 01:03:24,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 01:03:24,246 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:03:24" (1/1) ... [2019-01-12 01:03:24,298 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:03:24" (1/1) ... [2019-01-12 01:03:24,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 01:03:24,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 01:03:24,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 01:03:24,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 01:03:24,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (1/1) ... [2019-01-12 01:03:24,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 01:03:24,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 01:03:24,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 01:03:24,533 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 01:03:24,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (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:03:24,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 01:03:24,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 01:03:30,145 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 01:03:30,147 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 01:03:30,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:03:30 BoogieIcfgContainer [2019-01-12 01:03:30,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 01:03:30,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 01:03:30,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 01:03:30,153 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 01:03:30,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 01:03:22" (1/3) ... [2019-01-12 01:03:30,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af1e924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:03:30, skipping insertion in model container [2019-01-12 01:03:30,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 01:03:24" (2/3) ... [2019-01-12 01:03:30,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af1e924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:03:30, skipping insertion in model container [2019-01-12 01:03:30,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:03:30" (3/3) ... [2019-01-12 01:03:30,159 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label30_true-unreach-call.c [2019-01-12 01:03:30,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 01:03:30,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 01:03:30,195 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 01:03:30,230 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 01:03:30,231 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 01:03:30,231 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 01:03:30,231 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 01:03:30,231 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 01:03:30,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 01:03:30,232 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 01:03:30,232 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 01:03:30,232 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 01:03:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-01-12 01:03:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 01:03:30,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:30,276 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] [2019-01-12 01:03:30,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:30,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:30,285 INFO L82 PathProgramCache]: Analyzing trace with hash 174616531, now seen corresponding path program 1 times [2019-01-12 01:03:30,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:30,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:30,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:30,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:31,193 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:03:31,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:31,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:03:31,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:03:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:03:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:03:31,223 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-01-12 01:03:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:34,877 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-01-12 01:03:34,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:03:34,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-01-12 01:03:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:34,904 INFO L225 Difference]: With dead ends: 1023 [2019-01-12 01:03:34,904 INFO L226 Difference]: Without dead ends: 654 [2019-01-12 01:03:34,910 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:03:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-01-12 01:03:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-01-12 01:03:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-01-12 01:03:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-01-12 01:03:34,995 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 175 [2019-01-12 01:03:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:34,997 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-01-12 01:03:34,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:03:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-01-12 01:03:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-12 01:03:35,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:35,008 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] [2019-01-12 01:03:35,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash -93879212, now seen corresponding path program 1 times [2019-01-12 01:03:35,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:35,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:35,189 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:03:35,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:35,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:03:35,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:03:35,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:03:35,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:35,194 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-01-12 01:03:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:36,803 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-01-12 01:03:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:03:36,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-01-12 01:03:36,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:36,813 INFO L225 Difference]: With dead ends: 1929 [2019-01-12 01:03:36,814 INFO L226 Difference]: Without dead ends: 1279 [2019-01-12 01:03:36,819 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:03:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-01-12 01:03:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-01-12 01:03:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-01-12 01:03:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1831 transitions. [2019-01-12 01:03:36,887 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1831 transitions. Word has length 183 [2019-01-12 01:03:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 1831 transitions. [2019-01-12 01:03:36,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:03:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1831 transitions. [2019-01-12 01:03:36,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-12 01:03:36,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:36,896 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2019-01-12 01:03:36,896 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 800099661, now seen corresponding path program 1 times [2019-01-12 01:03:36,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:36,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:36,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:36,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 01:03:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:37,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:03:37,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:03:37,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:03:37,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:37,070 INFO L87 Difference]: Start difference. First operand 1265 states and 1831 transitions. Second operand 3 states. [2019-01-12 01:03:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:39,655 INFO L93 Difference]: Finished difference Result 3779 states and 5474 transitions. [2019-01-12 01:03:39,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:03:39,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-01-12 01:03:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:39,671 INFO L225 Difference]: With dead ends: 3779 [2019-01-12 01:03:39,671 INFO L226 Difference]: Without dead ends: 2516 [2019-01-12 01:03:39,674 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:03:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-01-12 01:03:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2513. [2019-01-12 01:03:39,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-01-12 01:03:39,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3630 transitions. [2019-01-12 01:03:39,734 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3630 transitions. Word has length 195 [2019-01-12 01:03:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:39,735 INFO L480 AbstractCegarLoop]: Abstraction has 2513 states and 3630 transitions. [2019-01-12 01:03:39,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:03:39,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3630 transitions. [2019-01-12 01:03:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-12 01:03:39,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:39,743 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-01-12 01:03:39,744 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:39,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:39,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1457983073, now seen corresponding path program 1 times [2019-01-12 01:03:39,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:39,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:39,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 01:03:39,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:39,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:03:39,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:03:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:03:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:39,892 INFO L87 Difference]: Start difference. First operand 2513 states and 3630 transitions. Second operand 3 states. [2019-01-12 01:03:41,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:41,971 INFO L93 Difference]: Finished difference Result 4986 states and 7206 transitions. [2019-01-12 01:03:41,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:03:41,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-01-12 01:03:41,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:41,985 INFO L225 Difference]: With dead ends: 4986 [2019-01-12 01:03:41,985 INFO L226 Difference]: Without dead ends: 2475 [2019-01-12 01:03:41,990 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:03:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-01-12 01:03:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2019-01-12 01:03:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-01-12 01:03:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3502 transitions. [2019-01-12 01:03:42,042 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3502 transitions. Word has length 203 [2019-01-12 01:03:42,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:42,042 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3502 transitions. [2019-01-12 01:03:42,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:03:42,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3502 transitions. [2019-01-12 01:03:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-12 01:03:42,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:42,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:42,050 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:42,051 INFO L82 PathProgramCache]: Analyzing trace with hash 808786063, now seen corresponding path program 1 times [2019-01-12 01:03:42,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:42,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:42,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:42,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:42,530 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 01:03:42,583 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:03:42,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:42,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:03:42,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 01:03:42,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 01:03:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:03:42,585 INFO L87 Difference]: Start difference. First operand 2475 states and 3502 transitions. Second operand 5 states. [2019-01-12 01:03:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:45,314 INFO L93 Difference]: Finished difference Result 5981 states and 8557 transitions. [2019-01-12 01:03:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 01:03:45,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-01-12 01:03:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:45,334 INFO L225 Difference]: With dead ends: 5981 [2019-01-12 01:03:45,334 INFO L226 Difference]: Without dead ends: 3508 [2019-01-12 01:03:45,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:03:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-01-12 01:03:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2881. [2019-01-12 01:03:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-01-12 01:03:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4092 transitions. [2019-01-12 01:03:45,410 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4092 transitions. Word has length 213 [2019-01-12 01:03:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:45,411 INFO L480 AbstractCegarLoop]: Abstraction has 2881 states and 4092 transitions. [2019-01-12 01:03:45,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 01:03:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4092 transitions. [2019-01-12 01:03:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-12 01:03:45,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:45,421 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:45,421 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:45,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1889254973, now seen corresponding path program 1 times [2019-01-12 01:03:45,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:45,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:45,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:45,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:45,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-12 01:03:45,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:03:45,696 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:03:45,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:45,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:03:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-01-12 01:03:46,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:03:46,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 01:03:46,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:03:46,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:03:46,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:03:46,036 INFO L87 Difference]: Start difference. First operand 2881 states and 4092 transitions. Second operand 4 states. [2019-01-12 01:03:48,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:48,659 INFO L93 Difference]: Finished difference Result 11512 states and 16355 transitions. [2019-01-12 01:03:48,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:03:48,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-01-12 01:03:48,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:48,694 INFO L225 Difference]: With dead ends: 11512 [2019-01-12 01:03:48,695 INFO L226 Difference]: Without dead ends: 8633 [2019-01-12 01:03:48,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 247 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:03:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8633 states. [2019-01-12 01:03:48,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8633 to 5754. [2019-01-12 01:03:48,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5754 states. [2019-01-12 01:03:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 8152 transitions. [2019-01-12 01:03:48,845 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 8152 transitions. Word has length 247 [2019-01-12 01:03:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:48,845 INFO L480 AbstractCegarLoop]: Abstraction has 5754 states and 8152 transitions. [2019-01-12 01:03:48,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:03:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 8152 transitions. [2019-01-12 01:03:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-12 01:03:48,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:48,858 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:48,858 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2041686795, now seen corresponding path program 1 times [2019-01-12 01:03:48,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:48,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:48,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:48,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:48,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:03:49,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:49,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:03:49,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:03:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:03:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:49,066 INFO L87 Difference]: Start difference. First operand 5754 states and 8152 transitions. Second operand 3 states. [2019-01-12 01:03:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:50,864 INFO L93 Difference]: Finished difference Result 16799 states and 23740 transitions. [2019-01-12 01:03:50,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:03:50,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-01-12 01:03:50,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:50,911 INFO L225 Difference]: With dead ends: 16799 [2019-01-12 01:03:50,912 INFO L226 Difference]: Without dead ends: 11047 [2019-01-12 01:03:50,923 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:03:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2019-01-12 01:03:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 11043. [2019-01-12 01:03:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11043 states. [2019-01-12 01:03:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 14549 transitions. [2019-01-12 01:03:51,121 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 14549 transitions. Word has length 248 [2019-01-12 01:03:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:51,122 INFO L480 AbstractCegarLoop]: Abstraction has 11043 states and 14549 transitions. [2019-01-12 01:03:51,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:03:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 14549 transitions. [2019-01-12 01:03:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-01-12 01:03:51,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:51,140 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, 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] [2019-01-12 01:03:51,141 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash -213655855, now seen corresponding path program 1 times [2019-01-12 01:03:51,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:51,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:51,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:51,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:03:51,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:51,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:03:51,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:03:51,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:03:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:03:51,619 INFO L87 Difference]: Start difference. First operand 11043 states and 14549 transitions. Second operand 4 states. [2019-01-12 01:03:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:54,310 INFO L93 Difference]: Finished difference Result 38762 states and 50829 transitions. [2019-01-12 01:03:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:03:54,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 253 [2019-01-12 01:03:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:54,373 INFO L225 Difference]: With dead ends: 38762 [2019-01-12 01:03:54,373 INFO L226 Difference]: Without dead ends: 27721 [2019-01-12 01:03:54,391 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:03:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27721 states. [2019-01-12 01:03:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27721 to 20787. [2019-01-12 01:03:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-01-12 01:03:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 26353 transitions. [2019-01-12 01:03:54,790 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 26353 transitions. Word has length 253 [2019-01-12 01:03:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:54,790 INFO L480 AbstractCegarLoop]: Abstraction has 20787 states and 26353 transitions. [2019-01-12 01:03:54,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:03:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 26353 transitions. [2019-01-12 01:03:54,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 01:03:54,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:54,817 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:54,817 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash -204474263, now seen corresponding path program 1 times [2019-01-12 01:03:54,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:54,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:54,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:54,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 01:03:54,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:03:54,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:03:54,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:03:54,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:03:54,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:54,974 INFO L87 Difference]: Start difference. First operand 20787 states and 26353 transitions. Second operand 3 states. [2019-01-12 01:03:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:03:57,073 INFO L93 Difference]: Finished difference Result 41580 states and 52718 transitions. [2019-01-12 01:03:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:03:57,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-01-12 01:03:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:03:57,122 INFO L225 Difference]: With dead ends: 41580 [2019-01-12 01:03:57,122 INFO L226 Difference]: Without dead ends: 20795 [2019-01-12 01:03:57,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:03:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20795 states. [2019-01-12 01:03:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20795 to 20787. [2019-01-12 01:03:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-01-12 01:03:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 24474 transitions. [2019-01-12 01:03:57,535 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 24474 transitions. Word has length 254 [2019-01-12 01:03:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:03:57,536 INFO L480 AbstractCegarLoop]: Abstraction has 20787 states and 24474 transitions. [2019-01-12 01:03:57,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:03:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 24474 transitions. [2019-01-12 01:03:57,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-12 01:03:57,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:03:57,573 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:57,574 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:03:57,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:03:57,574 INFO L82 PathProgramCache]: Analyzing trace with hash 949666247, now seen corresponding path program 1 times [2019-01-12 01:03:57,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:03:57,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:03:57,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:57,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:57,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:03:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:58,218 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-01-12 01:03:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:03:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:03:58,339 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:03:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:03:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:03:58,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:03:58,572 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 01:03:58,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:03:58,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 01:03:58,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 01:03:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 01:03:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 01:03:58,594 INFO L87 Difference]: Start difference. First operand 20787 states and 24474 transitions. Second operand 8 states. [2019-01-12 01:04:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:04:06,415 INFO L93 Difference]: Finished difference Result 111352 states and 129916 transitions. [2019-01-12 01:04:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 01:04:06,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 268 [2019-01-12 01:04:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:04:06,516 INFO L225 Difference]: With dead ends: 111352 [2019-01-12 01:04:06,517 INFO L226 Difference]: Without dead ends: 90567 [2019-01-12 01:04:06,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2019-01-12 01:04:06,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90567 states. [2019-01-12 01:04:07,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90567 to 54524. [2019-01-12 01:04:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54524 states. [2019-01-12 01:04:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 62272 transitions. [2019-01-12 01:04:07,523 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 62272 transitions. Word has length 268 [2019-01-12 01:04:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:04:07,523 INFO L480 AbstractCegarLoop]: Abstraction has 54524 states and 62272 transitions. [2019-01-12 01:04:07,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 01:04:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 62272 transitions. [2019-01-12 01:04:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-01-12 01:04:07,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:04:07,569 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 01:04:07,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:04:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:04:07,570 INFO L82 PathProgramCache]: Analyzing trace with hash 212970977, now seen corresponding path program 1 times [2019-01-12 01:04:07,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:04:07,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:04:07,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:04:07,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:04:07,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:04:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:04:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-12 01:04:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:04:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:04:07,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:04:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:04:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:04:07,746 INFO L87 Difference]: Start difference. First operand 54524 states and 62272 transitions. Second operand 3 states. [2019-01-12 01:04:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:04:09,391 INFO L93 Difference]: Finished difference Result 135310 states and 154597 transitions. [2019-01-12 01:04:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:04:09,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-01-12 01:04:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:04:09,477 INFO L225 Difference]: With dead ends: 135310 [2019-01-12 01:04:09,477 INFO L226 Difference]: Without dead ends: 80788 [2019-01-12 01:04:09,515 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:04:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80788 states. [2019-01-12 01:04:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80788 to 80781. [2019-01-12 01:04:10,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80781 states. [2019-01-12 01:04:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80781 states to 80781 states and 92165 transitions. [2019-01-12 01:04:11,027 INFO L78 Accepts]: Start accepts. Automaton has 80781 states and 92165 transitions. Word has length 277 [2019-01-12 01:04:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:04:11,028 INFO L480 AbstractCegarLoop]: Abstraction has 80781 states and 92165 transitions. [2019-01-12 01:04:11,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:04:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 80781 states and 92165 transitions. [2019-01-12 01:04:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-01-12 01:04:11,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:04:11,060 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 01:04:11,060 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:04:11,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:04:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash -418025450, now seen corresponding path program 1 times [2019-01-12 01:04:11,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:04:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:04:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:04:11,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:04:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:04:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:04:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 71 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-12 01:04:11,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:04:11,309 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:04:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:04:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:04:11,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:04:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:04:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:04:11,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 01:04:11,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 01:04:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 01:04:11,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 01:04:11,548 INFO L87 Difference]: Start difference. First operand 80781 states and 92165 transitions. Second operand 6 states. [2019-01-12 01:04:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:04:16,782 INFO L93 Difference]: Finished difference Result 228579 states and 261370 transitions. [2019-01-12 01:04:16,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 01:04:16,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-01-12 01:04:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:04:16,783 INFO L225 Difference]: With dead ends: 228579 [2019-01-12 01:04:16,783 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 01:04:16,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 01:04:16,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 01:04:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 01:04:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 01:04:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 01:04:16,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2019-01-12 01:04:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:04:16,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 01:04:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 01:04:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 01:04:16,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 01:04:16,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 01:04:19,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:20,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:23,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:23,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:23,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:24,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:24,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:26,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:26,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:26,302 WARN L181 SmtUtils]: Spent 9.43 s on a formula simplification. DAG size of input: 1299 DAG size of output: 835 [2019-01-12 01:04:27,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,952 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:29,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:31,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:31,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:33,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:33,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:33,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:33,468 WARN L181 SmtUtils]: Spent 7.16 s on a formula simplification. DAG size of input: 1299 DAG size of output: 835 [2019-01-12 01:04:45,836 WARN L181 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 724 DAG size of output: 43 [2019-01-12 01:04:58,042 WARN L181 SmtUtils]: Spent 12.20 s on a formula simplification. DAG size of input: 724 DAG size of output: 43 [2019-01-12 01:04:58,044 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-01-12 01:04:58,045 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,046 INFO L448 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-01-12 01:04:58,047 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,048 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,049 INFO L448 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,049 INFO L448 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,052 INFO L448 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,052 INFO L448 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-01-12 01:04:58,052 INFO L448 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-01-12 01:04:58,052 INFO L448 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-01-12 01:04:58,052 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,053 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-01-12 01:04:58,054 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-01-12 01:04:58,055 INFO L448 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-01-12 01:04:58,056 INFO L448 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-01-12 01:04:58,057 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,057 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,057 INFO L448 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1560) no Hoare annotation was computed. [2019-01-12 01:04:58,057 INFO L448 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,058 INFO L448 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-01-12 01:04:58,059 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:04:58,060 INFO L448 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-01-12 01:04:58,061 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,062 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,062 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,062 INFO L444 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse3 (= ~a27~0 1)) (.cse0 (= ~a5~0 1))) (let ((.cse5 (and (not .cse3) .cse0 (= ~a16~0 1))) (.cse2 (= ~a12~0 1)) (.cse1 (<= ~a6~0 0)) (.cse4 (= ~a11~0 1)) (.cse6 (not (= ~a3~0 0)))) (or (and .cse0 (= ~a3~0 1)) (and .cse1 .cse2 .cse0) (and (<= ~a3~0 0) (and .cse3 .cse0)) (and (= 1 ~a6~0) .cse0) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4 (= ~a15~0 1)) (and .cse2 (and .cse0 .cse6)) (and .cse5 .cse2) (and .cse1 .cse0 .cse4 .cse6) (and (and (not (= ~a20~0 1)) .cse3 .cse0) (= ~a1~0 1))))) [2019-01-12 01:04:58,062 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,062 INFO L448 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,062 INFO L448 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,063 INFO L448 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-01-12 01:04:58,063 INFO L448 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L451 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,064 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,065 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:04:58,066 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L444 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse3 (= ~a27~0 1)) (.cse0 (= ~a5~0 1))) (let ((.cse5 (and (not .cse3) .cse0 (= ~a16~0 1))) (.cse2 (= ~a12~0 1)) (.cse1 (<= ~a6~0 0)) (.cse4 (= ~a11~0 1)) (.cse6 (not (= ~a3~0 0)))) (or (and .cse0 (= ~a3~0 1)) (and .cse1 .cse2 .cse0) (and (<= ~a3~0 0) (and .cse3 .cse0)) (and (= 1 ~a6~0) .cse0) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4 (= ~a15~0 1)) (and .cse2 (and .cse0 .cse6)) (and .cse5 .cse2) (and .cse1 .cse0 .cse4 .cse6) (and (and (not (= ~a20~0 1)) .cse3 .cse0) (= ~a1~0 1))))) [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,067 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,068 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,068 INFO L448 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,068 INFO L448 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,069 INFO L448 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,070 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,071 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-01-12 01:04:58,072 INFO L448 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:04:58,073 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,074 INFO L448 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,075 INFO L448 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,076 INFO L448 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-01-12 01:04:58,077 INFO L448 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,078 INFO L448 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-01-12 01:04:58,079 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,080 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-01-12 01:04:58,080 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-01-12 01:04:58,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 01:04:58 BoogieIcfgContainer [2019-01-12 01:04:58,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 01:04:58,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 01:04:58,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 01:04:58,121 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 01:04:58,122 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:03:30" (3/4) ... [2019-01-12 01:04:58,132 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 01:04:58,187 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 01:04:58,190 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 01:04:58,476 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 01:04:58,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 01:04:58,478 INFO L168 Benchmark]: Toolchain (without parser) took 95868.91 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 947.3 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 799.2 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,480 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 01:04:58,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1620.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.88 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,482 INFO L168 Benchmark]: Boogie Preprocessor took 128.59 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.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,482 INFO L168 Benchmark]: RCFGBuilder took 5617.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,483 INFO L168 Benchmark]: TraceAbstraction took 87971.30 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 874.4 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,483 INFO L168 Benchmark]: Witness Printer took 355.80 ms. Allocated memory is still 3.8 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:58,488 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1620.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 118.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 167.88 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: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.59 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.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5617.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.4 MB in the end (delta: 247.7 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87971.30 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 874.4 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 355.80 ms. Allocated memory is still 3.8 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1560]: 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: (((((((((a5 == 1 && a3 == 1) || ((a6 <= 0 && a12 == 1) && a5 == 1)) || (a3 <= 0 && a27 == 1 && a5 == 1)) || (1 == a6 && a5 == 1)) || ((a27 == 1 && a5 == 1) && a11 == 1)) || (((a6 <= 0 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a15 == 1)) || (a12 == 1 && a5 == 1 && !(a3 == 0))) || (((!(a27 == 1) && a5 == 1) && a16 == 1) && a12 == 1)) || (((a6 <= 0 && a5 == 1) && a11 == 1) && !(a3 == 0))) || (((!(a20 == 1) && a27 == 1) && a5 == 1) && a1 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((a5 == 1 && a3 == 1) || ((a6 <= 0 && a12 == 1) && a5 == 1)) || (a3 <= 0 && a27 == 1 && a5 == 1)) || (1 == a6 && a5 == 1)) || ((a27 == 1 && a5 == 1) && a11 == 1)) || (((a6 <= 0 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a15 == 1)) || (a12 == 1 && a5 == 1 && !(a3 == 0))) || (((!(a27 == 1) && a5 == 1) && a16 == 1) && a12 == 1)) || (((a6 <= 0 && a5 == 1) && a11 == 1) && !(a3 == 0))) || (((!(a20 == 1) && a27 == 1) && a5 == 1) && a1 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. SAFE Result, 87.8s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 41.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2103 SDtfs, 9951 SDslu, 1917 SDs, 0 SdLazy, 13091 SolverSat, 3023 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 867 GetRequests, 823 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80781occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 46521 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 1394 NumberOfFragments, 247 HoareAnnotationTreeSize, 3 FomulaSimplifications, 24936 FormulaSimplificationTreeSizeReduction, 16.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 78050 FormulaSimplificationTreeSizeReductionInter, 24.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3599 NumberOfCodeBlocks, 3599 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1628307 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1522 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1274/1293 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...