./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem03_label06_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_label06_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 efd71a57cd4457ad6c114bfe7c857bcc7788c3aa ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:57:20,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:57:20,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:57:20,378 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:57:20,378 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:57:20,379 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:57:20,381 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:57:20,383 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:57:20,385 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:57:20,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:57:20,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:57:20,387 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:57:20,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:57:20,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:57:20,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:57:20,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:57:20,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:57:20,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:57:20,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:57:20,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:57:20,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:57:20,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:57:20,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:57:20,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:57:20,405 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:57:20,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:57:20,407 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:57:20,408 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:57:20,409 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:57:20,410 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:57:20,410 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:57:20,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:57:20,412 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:57:20,412 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:57:20,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:57:20,413 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:57:20,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:57:20,429 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:57:20,429 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:57:20,430 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:57:20,430 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:57:20,430 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:57:20,431 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:57:20,431 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:57:20,432 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:57:20,433 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:57:20,433 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:57:20,433 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:57:20,433 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:57:20,433 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:57:20,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:57:20,435 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:57:20,435 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:57:20,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:57:20,436 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:57:20,436 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:57:20,436 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:57:20,436 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:57:20,436 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:57:20,436 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:57:20,437 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 -> efd71a57cd4457ad6c114bfe7c857bcc7788c3aa [2019-01-12 00:57:20,473 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:57:20,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:57:20,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:57:20,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:57:20,492 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:57:20,493 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem03_label06_true-unreach-call.c [2019-01-12 00:57:20,569 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d039dda45/8e5f69c547d043d0a4a10de51cce7a6a/FLAG05a3bcef2 [2019-01-12 00:57:21,180 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:57:21,182 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem03_label06_true-unreach-call.c [2019-01-12 00:57:21,205 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d039dda45/8e5f69c547d043d0a4a10de51cce7a6a/FLAG05a3bcef2 [2019-01-12 00:57:21,350 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d039dda45/8e5f69c547d043d0a4a10de51cce7a6a [2019-01-12 00:57:21,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:57:21,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:57:21,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:57:21,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:57:21,366 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:57:21,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:57:21" (1/1) ... [2019-01-12 00:57:21,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da80eb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:21, skipping insertion in model container [2019-01-12 00:57:21,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:57:21" (1/1) ... [2019-01-12 00:57:21,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:57:21,466 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:57:22,117 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:57:22,127 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:57:22,464 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:57:22,645 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:57:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22 WrapperNode [2019-01-12 00:57:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:57:22,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:57:22,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:57:22,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:57:22,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:57:22,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:57:22,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:57:22,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:57:22,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (1/1) ... [2019-01-12 00:57:22,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:57:22,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:57:22,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:57:22,958 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:57:22,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (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 00:57:23,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:57:23,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:57:28,129 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:57:28,129 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:57:28,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:57:28 BoogieIcfgContainer [2019-01-12 00:57:28,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:57:28,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:57:28,132 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:57:28,135 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:57:28,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:57:21" (1/3) ... [2019-01-12 00:57:28,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fba3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:57:28, skipping insertion in model container [2019-01-12 00:57:28,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:57:22" (2/3) ... [2019-01-12 00:57:28,136 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fba3ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:57:28, skipping insertion in model container [2019-01-12 00:57:28,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:57:28" (3/3) ... [2019-01-12 00:57:28,138 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label06_true-unreach-call.c [2019-01-12 00:57:28,149 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:57:28,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:57:28,175 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:57:28,210 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:57:28,211 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:57:28,211 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:57:28,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:57:28,212 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:57:28,212 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:57:28,212 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:57:28,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:57:28,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:57:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-01-12 00:57:28,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-01-12 00:57:28,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:28,257 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] [2019-01-12 00:57:28,264 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1533533723, now seen corresponding path program 1 times [2019-01-12 00:57:28,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:28,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:28,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:28,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:28,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:29,255 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 00:57:29,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:29,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:29,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:29,283 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-01-12 00:57:32,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:32,599 INFO L93 Difference]: Finished difference Result 1023 states and 1861 transitions. [2019-01-12 00:57:32,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:32,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-01-12 00:57:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:32,623 INFO L225 Difference]: With dead ends: 1023 [2019-01-12 00:57:32,624 INFO L226 Difference]: Without dead ends: 654 [2019-01-12 00:57:32,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-01-12 00:57:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2019-01-12 00:57:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-01-12 00:57:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 964 transitions. [2019-01-12 00:57:32,709 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 964 transitions. Word has length 169 [2019-01-12 00:57:32,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:32,710 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 964 transitions. [2019-01-12 00:57:32,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:32,710 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 964 transitions. [2019-01-12 00:57:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 00:57:32,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:32,721 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] [2019-01-12 00:57:32,721 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:32,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash 728541020, now seen corresponding path program 1 times [2019-01-12 00:57:32,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:32,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:32,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:32,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:32,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:32,882 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 00:57:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:32,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:57:32,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:32,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:32,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:32,886 INFO L87 Difference]: Start difference. First operand 652 states and 964 transitions. Second operand 3 states. [2019-01-12 00:57:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:34,482 INFO L93 Difference]: Finished difference Result 1929 states and 2864 transitions. [2019-01-12 00:57:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:34,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-01-12 00:57:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:34,490 INFO L225 Difference]: With dead ends: 1929 [2019-01-12 00:57:34,490 INFO L226 Difference]: Without dead ends: 1279 [2019-01-12 00:57:34,493 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 00:57:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2019-01-12 00:57:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1265. [2019-01-12 00:57:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-01-12 00:57:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 1831 transitions. [2019-01-12 00:57:34,537 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 1831 transitions. Word has length 177 [2019-01-12 00:57:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:34,537 INFO L480 AbstractCegarLoop]: Abstraction has 1265 states and 1831 transitions. [2019-01-12 00:57:34,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 1831 transitions. [2019-01-12 00:57:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-12 00:57:34,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:34,543 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] [2019-01-12 00:57:34,543 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:34,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1433788651, now seen corresponding path program 1 times [2019-01-12 00:57:34,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:34,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:34,697 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 00:57:34,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:34,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:57:34,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:34,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:34,699 INFO L87 Difference]: Start difference. First operand 1265 states and 1831 transitions. Second operand 3 states. [2019-01-12 00:57:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:36,055 INFO L93 Difference]: Finished difference Result 3779 states and 5474 transitions. [2019-01-12 00:57:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:36,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-01-12 00:57:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:36,068 INFO L225 Difference]: With dead ends: 3779 [2019-01-12 00:57:36,069 INFO L226 Difference]: Without dead ends: 2516 [2019-01-12 00:57:36,071 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 00:57:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-01-12 00:57:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2513. [2019-01-12 00:57:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-01-12 00:57:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3630 transitions. [2019-01-12 00:57:36,126 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3630 transitions. Word has length 189 [2019-01-12 00:57:36,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:36,127 INFO L480 AbstractCegarLoop]: Abstraction has 2513 states and 3630 transitions. [2019-01-12 00:57:36,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3630 transitions. [2019-01-12 00:57:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 00:57:36,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:36,140 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] [2019-01-12 00:57:36,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:36,142 INFO L82 PathProgramCache]: Analyzing trace with hash 413925161, now seen corresponding path program 1 times [2019-01-12 00:57:36,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:36,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:36,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:36,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:36,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:36,292 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 00:57:36,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:36,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:57:36,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:36,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:36,295 INFO L87 Difference]: Start difference. First operand 2513 states and 3630 transitions. Second operand 3 states. [2019-01-12 00:57:36,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:36,909 INFO L93 Difference]: Finished difference Result 4986 states and 7206 transitions. [2019-01-12 00:57:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:36,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-01-12 00:57:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:36,922 INFO L225 Difference]: With dead ends: 4986 [2019-01-12 00:57:36,923 INFO L226 Difference]: Without dead ends: 2475 [2019-01-12 00:57:36,927 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 00:57:36,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2019-01-12 00:57:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2475. [2019-01-12 00:57:36,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2019-01-12 00:57:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 3502 transitions. [2019-01-12 00:57:36,986 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 3502 transitions. Word has length 197 [2019-01-12 00:57:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:36,986 INFO L480 AbstractCegarLoop]: Abstraction has 2475 states and 3502 transitions. [2019-01-12 00:57:36,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 3502 transitions. [2019-01-12 00:57:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-01-12 00:57:36,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:36,994 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] [2019-01-12 00:57:36,994 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1595982807, now seen corresponding path program 1 times [2019-01-12 00:57:36,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:36,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:37,530 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 00:57:37,622 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 00:57:37,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:37,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:57:37,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:57:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:57:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:57:37,624 INFO L87 Difference]: Start difference. First operand 2475 states and 3502 transitions. Second operand 5 states. [2019-01-12 00:57:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:40,889 INFO L93 Difference]: Finished difference Result 5981 states and 8557 transitions. [2019-01-12 00:57:40,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:57:40,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-01-12 00:57:40,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:40,908 INFO L225 Difference]: With dead ends: 5981 [2019-01-12 00:57:40,908 INFO L226 Difference]: Without dead ends: 3508 [2019-01-12 00:57:40,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:57:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-01-12 00:57:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2881. [2019-01-12 00:57:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-01-12 00:57:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 4092 transitions. [2019-01-12 00:57:40,983 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 4092 transitions. Word has length 207 [2019-01-12 00:57:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:40,984 INFO L480 AbstractCegarLoop]: Abstraction has 2881 states and 4092 transitions. [2019-01-12 00:57:40,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:57:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 4092 transitions. [2019-01-12 00:57:40,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-12 00:57:41,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:41,002 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] [2019-01-12 00:57:41,002 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash -161225717, now seen corresponding path program 1 times [2019-01-12 00:57:41,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:41,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:41,380 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 00:57:41,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:57:41,381 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 00:57:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:41,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:57:41,743 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 00:57:41,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:57:41,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 00:57:41,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:41,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:41,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:41,784 INFO L87 Difference]: Start difference. First operand 2881 states and 4092 transitions. Second operand 4 states. [2019-01-12 00:57:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:43,724 INFO L93 Difference]: Finished difference Result 11512 states and 16355 transitions. [2019-01-12 00:57:43,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:43,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-01-12 00:57:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:43,761 INFO L225 Difference]: With dead ends: 11512 [2019-01-12 00:57:43,762 INFO L226 Difference]: Without dead ends: 8633 [2019-01-12 00:57:43,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 241 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 00:57:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8633 states. [2019-01-12 00:57:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8633 to 5754. [2019-01-12 00:57:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5754 states. [2019-01-12 00:57:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5754 states to 5754 states and 8152 transitions. [2019-01-12 00:57:43,919 INFO L78 Accepts]: Start accepts. Automaton has 5754 states and 8152 transitions. Word has length 241 [2019-01-12 00:57:43,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:43,919 INFO L480 AbstractCegarLoop]: Abstraction has 5754 states and 8152 transitions. [2019-01-12 00:57:43,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5754 states and 8152 transitions. [2019-01-12 00:57:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-01-12 00:57:43,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:43,930 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] [2019-01-12 00:57:43,932 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:43,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1637825347, now seen corresponding path program 1 times [2019-01-12 00:57:43,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:43,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:43,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:43,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:44,136 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 00:57:44,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:44,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:44,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:44,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:44,140 INFO L87 Difference]: Start difference. First operand 5754 states and 8152 transitions. Second operand 3 states. [2019-01-12 00:57:45,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:45,713 INFO L93 Difference]: Finished difference Result 16799 states and 23740 transitions. [2019-01-12 00:57:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:45,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-01-12 00:57:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:45,755 INFO L225 Difference]: With dead ends: 16799 [2019-01-12 00:57:45,756 INFO L226 Difference]: Without dead ends: 11047 [2019-01-12 00:57:45,766 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 00:57:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2019-01-12 00:57:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 11043. [2019-01-12 00:57:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11043 states. [2019-01-12 00:57:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 14555 transitions. [2019-01-12 00:57:45,963 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 14555 transitions. Word has length 242 [2019-01-12 00:57:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:45,963 INFO L480 AbstractCegarLoop]: Abstraction has 11043 states and 14555 transitions. [2019-01-12 00:57:45,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 14555 transitions. [2019-01-12 00:57:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-12 00:57:45,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:45,979 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] [2019-01-12 00:57:45,979 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:45,979 INFO L82 PathProgramCache]: Analyzing trace with hash 759817113, now seen corresponding path program 1 times [2019-01-12 00:57:45,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:45,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:45,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:46,287 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:57:46,506 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 00:57:46,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:46,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:46,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:46,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:46,509 INFO L87 Difference]: Start difference. First operand 11043 states and 14555 transitions. Second operand 4 states. [2019-01-12 00:57:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:48,875 INFO L93 Difference]: Finished difference Result 38760 states and 50844 transitions. [2019-01-12 00:57:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:48,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2019-01-12 00:57:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:48,931 INFO L225 Difference]: With dead ends: 38760 [2019-01-12 00:57:48,931 INFO L226 Difference]: Without dead ends: 27719 [2019-01-12 00:57:48,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27719 states. [2019-01-12 00:57:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27719 to 20787. [2019-01-12 00:57:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-01-12 00:57:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 26355 transitions. [2019-01-12 00:57:49,314 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 26355 transitions. Word has length 247 [2019-01-12 00:57:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:49,315 INFO L480 AbstractCegarLoop]: Abstraction has 20787 states and 26355 transitions. [2019-01-12 00:57:49,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 26355 transitions. [2019-01-12 00:57:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-12 00:57:49,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:49,347 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, 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] [2019-01-12 00:57:49,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1063142085, now seen corresponding path program 1 times [2019-01-12 00:57:49,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:49,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:49,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 00:57:49,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:49,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:49,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:49,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:49,509 INFO L87 Difference]: Start difference. First operand 20787 states and 26355 transitions. Second operand 3 states. [2019-01-12 00:57:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:51,759 INFO L93 Difference]: Finished difference Result 41580 states and 52722 transitions. [2019-01-12 00:57:51,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:51,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-01-12 00:57:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:51,801 INFO L225 Difference]: With dead ends: 41580 [2019-01-12 00:57:51,802 INFO L226 Difference]: Without dead ends: 20795 [2019-01-12 00:57:51,822 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 00:57:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20795 states. [2019-01-12 00:57:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20795 to 20787. [2019-01-12 00:57:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-01-12 00:57:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 24476 transitions. [2019-01-12 00:57:52,103 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 24476 transitions. Word has length 251 [2019-01-12 00:57:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:52,104 INFO L480 AbstractCegarLoop]: Abstraction has 20787 states and 24476 transitions. [2019-01-12 00:57:52,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:57:52,104 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 24476 transitions. [2019-01-12 00:57:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-12 00:57:52,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:52,139 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:52,140 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:52,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1663998635, now seen corresponding path program 1 times [2019-01-12 00:57:52,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:52,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:52,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:52,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:52,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-12 00:57:52,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:52,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:52,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:52,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:52,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:52,450 INFO L87 Difference]: Start difference. First operand 20787 states and 24476 transitions. Second operand 4 states. [2019-01-12 00:57:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:53,726 INFO L93 Difference]: Finished difference Result 41166 states and 48492 transitions. [2019-01-12 00:57:53,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:53,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 268 [2019-01-12 00:57:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:53,746 INFO L225 Difference]: With dead ends: 41166 [2019-01-12 00:57:53,746 INFO L226 Difference]: Without dead ends: 20381 [2019-01-12 00:57:53,763 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 00:57:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20381 states. [2019-01-12 00:57:54,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20381 to 20381. [2019-01-12 00:57:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20381 states. [2019-01-12 00:57:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20381 states to 20381 states and 23026 transitions. [2019-01-12 00:57:54,287 INFO L78 Accepts]: Start accepts. Automaton has 20381 states and 23026 transitions. Word has length 268 [2019-01-12 00:57:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:54,288 INFO L480 AbstractCegarLoop]: Abstraction has 20381 states and 23026 transitions. [2019-01-12 00:57:54,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20381 states and 23026 transitions. [2019-01-12 00:57:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-12 00:57:54,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:54,306 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:54,313 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1558817520, now seen corresponding path program 1 times [2019-01-12 00:57:54,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:54,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:54,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:54,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:54,698 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-01-12 00:57:54,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:54,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:54,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:57:54,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:57:54,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:54,702 INFO L87 Difference]: Start difference. First operand 20381 states and 23026 transitions. Second operand 4 states. [2019-01-12 00:57:56,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:56,958 INFO L93 Difference]: Finished difference Result 78451 states and 88794 transitions. [2019-01-12 00:57:56,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:57:56,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-01-12 00:57:56,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:57,026 INFO L225 Difference]: With dead ends: 78451 [2019-01-12 00:57:57,026 INFO L226 Difference]: Without dead ends: 58072 [2019-01-12 00:57:57,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:57:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58072 states. [2019-01-12 00:57:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58072 to 58068. [2019-01-12 00:57:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58068 states. [2019-01-12 00:57:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58068 states to 58068 states and 65635 transitions. [2019-01-12 00:57:57,944 INFO L78 Accepts]: Start accepts. Automaton has 58068 states and 65635 transitions. Word has length 270 [2019-01-12 00:57:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:57:57,944 INFO L480 AbstractCegarLoop]: Abstraction has 58068 states and 65635 transitions. [2019-01-12 00:57:57,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:57:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 58068 states and 65635 transitions. [2019-01-12 00:57:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-01-12 00:57:57,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:57:57,968 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:57:57,968 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:57:57,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:57:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -187630124, now seen corresponding path program 1 times [2019-01-12 00:57:57,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:57:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:57:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:57,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:57:57,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:57:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:57:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 00:57:58,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:57:58,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:57:58,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:57:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:57:58,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:57:58,144 INFO L87 Difference]: Start difference. First operand 58068 states and 65635 transitions. Second operand 3 states. [2019-01-12 00:57:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:57:59,607 INFO L93 Difference]: Finished difference Result 152125 states and 171505 transitions. [2019-01-12 00:57:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:57:59,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-01-12 00:57:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:57:59,702 INFO L225 Difference]: With dead ends: 152125 [2019-01-12 00:57:59,702 INFO L226 Difference]: Without dead ends: 94059 [2019-01-12 00:57:59,751 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 00:57:59,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94059 states. [2019-01-12 00:58:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94059 to 94023. [2019-01-12 00:58:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94023 states. [2019-01-12 00:58:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94023 states to 94023 states and 104184 transitions. [2019-01-12 00:58:01,146 INFO L78 Accepts]: Start accepts. Automaton has 94023 states and 104184 transitions. Word has length 302 [2019-01-12 00:58:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:58:01,146 INFO L480 AbstractCegarLoop]: Abstraction has 94023 states and 104184 transitions. [2019-01-12 00:58:01,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:58:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand 94023 states and 104184 transitions. [2019-01-12 00:58:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-12 00:58:01,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:58:01,168 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:01,168 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:58:01,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:58:01,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1679996946, now seen corresponding path program 1 times [2019-01-12 00:58:01,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:58:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:58:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:01,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:01,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-01-12 00:58:01,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:58:01,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:58:01,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:58:01,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:58:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:58:01,385 INFO L87 Difference]: Start difference. First operand 94023 states and 104184 transitions. Second operand 3 states. [2019-01-12 00:58:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:58:03,853 INFO L93 Difference]: Finished difference Result 230413 states and 255675 transitions. [2019-01-12 00:58:03,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:58:03,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-01-12 00:58:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:58:04,011 INFO L225 Difference]: With dead ends: 230413 [2019-01-12 00:58:04,011 INFO L226 Difference]: Without dead ends: 136392 [2019-01-12 00:58:04,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:58:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136392 states. [2019-01-12 00:58:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136392 to 136374. [2019-01-12 00:58:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136374 states. [2019-01-12 00:58:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136374 states to 136374 states and 151334 transitions. [2019-01-12 00:58:06,470 INFO L78 Accepts]: Start accepts. Automaton has 136374 states and 151334 transitions. Word has length 305 [2019-01-12 00:58:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:58:06,470 INFO L480 AbstractCegarLoop]: Abstraction has 136374 states and 151334 transitions. [2019-01-12 00:58:06,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:58:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 136374 states and 151334 transitions. [2019-01-12 00:58:06,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-12 00:58:06,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:58:06,487 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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 00:58:06,487 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:58:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:58:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1262892857, now seen corresponding path program 1 times [2019-01-12 00:58:06,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:58:06,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:58:06,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:06,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:06,799 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 00:58:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-01-12 00:58:07,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:58:07,056 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 00:58:07,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:07,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:58:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-01-12 00:58:07,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:58:07,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2019-01-12 00:58:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 00:58:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 00:58:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:58:07,555 INFO L87 Difference]: Start difference. First operand 136374 states and 151334 transitions. Second operand 6 states. [2019-01-12 00:58:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:58:15,184 INFO L93 Difference]: Finished difference Result 386991 states and 430547 transitions. [2019-01-12 00:58:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:58:15,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 312 [2019-01-12 00:58:15,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:58:15,460 INFO L225 Difference]: With dead ends: 386991 [2019-01-12 00:58:15,461 INFO L226 Difference]: Without dead ends: 250619 [2019-01-12 00:58:15,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:58:15,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250619 states. [2019-01-12 00:58:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250619 to 243226. [2019-01-12 00:58:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243226 states. [2019-01-12 00:58:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243226 states to 243226 states and 264515 transitions. [2019-01-12 00:58:18,864 INFO L78 Accepts]: Start accepts. Automaton has 243226 states and 264515 transitions. Word has length 312 [2019-01-12 00:58:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:58:18,865 INFO L480 AbstractCegarLoop]: Abstraction has 243226 states and 264515 transitions. [2019-01-12 00:58:18,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 00:58:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 243226 states and 264515 transitions. [2019-01-12 00:58:18,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-12 00:58:18,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:58:18,902 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:58:18,903 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:58:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:58:18,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1092766776, now seen corresponding path program 1 times [2019-01-12 00:58:18,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:58:18,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:58:18,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:18,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:19,459 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 00:58:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-12 00:58:19,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:58:19,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:58:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:58:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:58:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:58:19,664 INFO L87 Difference]: Start difference. First operand 243226 states and 264515 transitions. Second operand 5 states. [2019-01-12 00:58:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:58:24,619 INFO L93 Difference]: Finished difference Result 641723 states and 693979 transitions. [2019-01-12 00:58:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:58:24,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-01-12 00:58:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:58:25,107 INFO L225 Difference]: With dead ends: 641723 [2019-01-12 00:58:25,107 INFO L226 Difference]: Without dead ends: 398499 [2019-01-12 00:58:25,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:58:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398499 states. [2019-01-12 00:58:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398499 to 367765. [2019-01-12 00:58:35,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367765 states. [2019-01-12 00:58:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367765 states to 367765 states and 397186 transitions. [2019-01-12 00:58:35,592 INFO L78 Accepts]: Start accepts. Automaton has 367765 states and 397186 transitions. Word has length 364 [2019-01-12 00:58:35,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:58:35,593 INFO L480 AbstractCegarLoop]: Abstraction has 367765 states and 397186 transitions. [2019-01-12 00:58:35,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:58:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 367765 states and 397186 transitions. [2019-01-12 00:58:35,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-12 00:58:35,636 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:58:35,637 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:58:35,637 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:58:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:58:35,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1217561795, now seen corresponding path program 1 times [2019-01-12 00:58:35,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:58:35,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:58:35,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:35,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:35,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:35,945 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:58:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-01-12 00:58:36,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:58:36,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:58:36,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:58:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:58:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:58:36,062 INFO L87 Difference]: Start difference. First operand 367765 states and 397186 transitions. Second operand 4 states. [2019-01-12 00:58:42,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:58:42,547 INFO L93 Difference]: Finished difference Result 870064 states and 942411 transitions. [2019-01-12 00:58:42,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:58:42,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-01-12 00:58:42,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:58:43,212 INFO L225 Difference]: With dead ends: 870064 [2019-01-12 00:58:43,213 INFO L226 Difference]: Without dead ends: 502301 [2019-01-12 00:58:43,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:58:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502301 states. [2019-01-12 00:58:49,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502301 to 393546. [2019-01-12 00:58:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393546 states. [2019-01-12 00:58:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393546 states to 393546 states and 425961 transitions. [2019-01-12 00:58:49,848 INFO L78 Accepts]: Start accepts. Automaton has 393546 states and 425961 transitions. Word has length 376 [2019-01-12 00:58:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:58:49,848 INFO L480 AbstractCegarLoop]: Abstraction has 393546 states and 425961 transitions. [2019-01-12 00:58:49,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:58:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 393546 states and 425961 transitions. [2019-01-12 00:58:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-01-12 00:58:49,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:58:49,876 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:58:49,876 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:58:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:58:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2068315548, now seen corresponding path program 1 times [2019-01-12 00:58:49,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:58:49,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:58:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:49,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:58:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 196 proven. 8 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-01-12 00:58:50,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:58:50,282 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 00:58:50,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:58:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:58:50,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:58:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-12 00:58:50,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:58:50,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:58:50,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:58:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:58:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:58:50,555 INFO L87 Difference]: Start difference. First operand 393546 states and 425961 transitions. Second operand 8 states. [2019-01-12 00:59:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:59:05,955 INFO L93 Difference]: Finished difference Result 1271332 states and 1371978 transitions. [2019-01-12 00:59:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 00:59:05,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 388 [2019-01-12 00:59:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:59:05,956 INFO L225 Difference]: With dead ends: 1271332 [2019-01-12 00:59:05,956 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:59:06,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 398 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2019-01-12 00:59:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:59:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:59:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:59:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:59:06,261 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 388 [2019-01-12 00:59:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:59:06,262 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:59:06,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:59:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:59:06,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:59:06,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:59:14,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:15,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:16,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:16,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:16,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:22,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:22,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:23,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:23,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:23,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:26,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:33,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:34,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:35,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:36,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:36,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:37,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:38,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:38,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:38,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:38,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:38,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:39,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:39,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:39,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:39,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:40,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:41,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:41,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:41,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:42,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:43,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:44,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:45,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:45,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:46,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:46,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:46,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:46,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:46,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:47,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:47,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:48,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:49,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:49,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:49,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:51,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:52,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:53,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:53,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:53,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:54,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:55,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:56,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:56,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:56,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:57,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:57,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:58,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:59:59,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:00,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:00,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:01,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:01,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:02,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:03,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:03,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:03,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:04,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:04,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:06,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:09,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:09,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:10,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:10,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:11,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:11,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:11,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:12,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:12,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:13,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:14,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:14,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:15,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:16,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:16,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:16,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:17,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:17,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:18,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:21,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:24,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:24,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:25,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:25,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:26,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:27,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:27,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:28,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:28,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:28,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:30,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:30,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:30,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:31,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:31,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:32,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:32,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:34,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:35,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:35,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:37,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:38,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:38,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:39,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:40,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:40,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:40,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:40,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:41,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:43,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:47,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:48,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:49,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:50,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:51,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:51,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:53,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:55,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:55,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:57,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:57,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:58,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:00:59,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:00,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:04,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:04,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:04,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:05,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:07,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:08,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:09,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:09,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:10,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:11,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:13,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:13,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:13,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:15,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:16,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:16,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:19,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:20,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:21,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:21,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:23,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:24,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:24,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:25,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:25,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:26,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:28,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:28,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:29,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:33,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:35,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:36,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:38,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:40,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:42,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:42,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:45,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:46,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:46,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:47,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:49,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:52,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:56,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:59,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:00,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:02,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:06,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:07,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:09,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:13,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:13,384 WARN L181 SmtUtils]: Spent 3.12 m on a formula simplification. DAG size of input: 5732 DAG size of output: 2955 [2019-01-12 01:02:18,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:25,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:25,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:26,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:26,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:26,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:38,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:39,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:39,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:39,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:39,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:40,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:40,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:40,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:40,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:42,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:42,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:42,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:42,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:43,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:43,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:43,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:43,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:45,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:45,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:45,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:46,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:47,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:48,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:48,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:49,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:50,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:51,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:51,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:52,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:52,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:53,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:55,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:56,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:56,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:57,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:57,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:58,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:00,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:00,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:00,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:01,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:01,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:02,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:04,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:04,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:04,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:06,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:06,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:07,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:07,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:07,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:07,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:08,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:08,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:11,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:14,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:14,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:15,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:15,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:15,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:15,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:16,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:16,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:17,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:18,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:19,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:19,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:20,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:20,681 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:21,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:21,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:21,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:21,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:23,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:26,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:28,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:29,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:29,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:30,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:31,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:31,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:32,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:33,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:33,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:33,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:34,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:34,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:35,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:36,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:36,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:37,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:37,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:39,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:40,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:40,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:42,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:42,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:42,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:44,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:44,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:45,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:45,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:45,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:46,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:48,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:52,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:52,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:53,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:54,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:55,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:56,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:58,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:59,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:00,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:01,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:02,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:03,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:03,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:05,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:09,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:09,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:09,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:11,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:12,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:13,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:14,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:14,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:15,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:16,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:18,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:19,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:21,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:22,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:25,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:26,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:26,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:27,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:28,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:30,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:31,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:31,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:32,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:34,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:34,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:34,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:36,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:36,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:38,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:38,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:38,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:39,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:41,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:43,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:43,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:44,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:45,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:46,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:48,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:48,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:50,951 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:52,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:52,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:52,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:54,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:54,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:55,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:04:57,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:02,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:05,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:06,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:08,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:11,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:12,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:14,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:18,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:05:18,750 WARN L181 SmtUtils]: Spent 3.09 m on a formula simplification. DAG size of input: 5732 DAG size of output: 2955 [2019-01-12 01:07:26,015 WARN L181 SmtUtils]: Spent 2.12 m on a formula simplification. DAG size of input: 2750 DAG size of output: 149 [2019-01-12 01:09:32,128 WARN L181 SmtUtils]: Spent 2.10 m on a formula simplification. DAG size of input: 2750 DAG size of output: 149 [2019-01-12 01:09:32,132 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,133 INFO L448 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,134 INFO L448 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-01-12 01:09:32,135 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1542) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,136 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:09:32,137 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,138 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,139 INFO L448 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,140 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:09:32,142 INFO L448 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:09:32,143 INFO L448 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,144 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L444 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse2 (= ~a6~0 1)) (.cse38 (not (= ~a20~0 1))) (.cse15 (= ~a27~0 1)) (.cse14 (= ~a5~0 1)) (.cse6 (= ~a3~0 0))) (let ((.cse28 (not .cse6)) (.cse0 (and .cse38 .cse15 .cse14)) (.cse22 (not .cse2))) (let ((.cse33 (and .cse38 .cse14)) (.cse18 (<= ~a6~0 0)) (.cse21 (<= ~a26~0 0)) (.cse9 (<= ~a3~0 0)) (.cse12 (<= ~a11~0 0)) (.cse24 (and .cse0 .cse22)) (.cse16 (= ~a26~0 1)) (.cse39 (not .cse15)) (.cse17 (= ~a16~0 1)) (.cse19 (= ~a3~0 1)) (.cse1 (= ~a12~0 1)) (.cse36 (and .cse15 .cse28)) (.cse4 (= ~a11~0 1))) (let ((.cse27 (and .cse15 .cse22 .cse4 .cse28)) (.cse30 (and .cse22 .cse36)) (.cse13 (not .cse1)) (.cse34 (and .cse15 .cse22 .cse14 .cse4)) (.cse32 (and .cse38 .cse19)) (.cse23 (and .cse38 .cse14 .cse28)) (.cse26 (and (and .cse39 .cse14 .cse17 .cse28) .cse38)) (.cse35 (not .cse16)) (.cse25 (not (= ~a7~0 1))) (.cse11 (and .cse15 .cse22)) (.cse5 (= ~a15~0 1)) (.cse8 (<= ~a20~0 0)) (.cse29 (and .cse39 .cse14 .cse17 .cse19)) (.cse3 (= ~a1~0 1)) (.cse20 (and .cse39 .cse14 .cse17)) (.cse37 (and .cse38 .cse15 .cse14 .cse17)) (.cse31 (or (and .cse9 .cse33 .cse18 .cse1 .cse12 .cse21) (and .cse9 .cse1 .cse12 .cse24))) (.cse10 (= ~a10~0 1)) (.cse7 (= ~a0~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse5 .cse7) (and .cse9 .cse15 .cse14 .cse4 .cse16 .cse17) (and .cse18 .cse13 .cse14 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7) (and .cse10 .cse1 .cse2 .cse3 .cse14 .cse4 .cse17 .cse16 .cse5 .cse8) (and (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse6 .cse7) .cse3 .cse8) (and .cse15 .cse2 .cse14 .cse4 .cse16 .cse19) (and .cse1 .cse20 .cse12 .cse21 .cse6 .cse7) (and (and .cse15 .cse22 .cse4 .cse17 .cse19) .cse14) (and .cse23 .cse2 .cse12 .cse3 .cse8 .cse7) (and (and .cse23 .cse2 .cse12 .cse5 .cse7) .cse3) (and .cse10 .cse12 .cse3 .cse16 .cse5 .cse24 .cse8) (and .cse9 .cse18 .cse1 .cse12 .cse21 .cse14) (and .cse9 .cse1 .cse11 .cse12 .cse14 .cse16 .cse5) (and .cse25 .cse18 .cse10 .cse26 .cse13 .cse21 .cse4 .cse5 .cse8) (and .cse9 .cse25 .cse10 .cse11 .cse12 .cse14 .cse16 .cse5) (and .cse10 .cse1 .cse12 .cse3 .cse16 .cse8 (and .cse23 .cse22)) (and .cse9 .cse25 .cse10 .cse15 .cse12 .cse14 .cse17 .cse5) (and .cse27 .cse14 .cse7) (and .cse25 .cse10 .cse15 .cse2 .cse12 .cse14 .cse28) (and .cse29 .cse1 .cse2 .cse21 .cse4) (and .cse9 .cse15 .cse12 .cse21 .cse14) (and .cse28 .cse25 .cse10 .cse1 .cse12 .cse14 .cse16) (and (and .cse10 .cse12 .cse13 .cse14 .cse5 .cse30 .cse7) .cse3 .cse8) (and .cse15 .cse1 .cse12 .cse21 .cse14 .cse7) (and .cse27 .cse25 .cse10 .cse14 .cse16) (and .cse9 .cse20 .cse2 .cse12 .cse13 .cse5) (and .cse25 .cse10 .cse2 .cse12 .cse14 .cse16) (and .cse31 .cse3 .cse6) (and .cse2 .cse14 .cse4 .cse16 .cse7) (and .cse0 .cse25 .cse10 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse11 .cse12 .cse14 .cse6 .cse7) (and .cse12 .cse3 .cse21 .cse14 .cse30 .cse8 .cse7) (and .cse9 .cse2 .cse12 .cse14 .cse16) (and (and .cse12 .cse32 .cse14 .cse7) .cse3 .cse8) (and (and .cse33 .cse2 .cse12 .cse13 .cse5 .cse7) .cse3 .cse8) (and .cse25 .cse10 .cse15 .cse2 .cse3 .cse12 .cse14 .cse5 .cse7 .cse8) (and .cse10 .cse1 .cse16 .cse34 .cse7) (and .cse9 .cse15 .cse2 .cse12 .cse14 .cse17) (and .cse10 .cse23 .cse2 .cse3 .cse4 .cse16 .cse8) (and .cse18 .cse21 .cse14 .cse4 .cse28 .cse7) (and .cse18 .cse1 .cse14 .cse4 .cse16 .cse28 .cse7) (and .cse25 .cse10 .cse15 .cse2 .cse21 .cse14 .cse4 .cse28) (and .cse25 .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse28) (and .cse35 .cse2 .cse12 .cse14 .cse28 .cse7) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse16 .cse6 .cse8) (and .cse10 .cse1 .cse2 .cse36 .cse12 .cse3 .cse14 .cse5 .cse8) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse9 (and .cse22 .cse20) .cse1 .cse12 .cse21) (and .cse9 .cse10 .cse37 .cse12 .cse13 .cse5) (and .cse9 .cse25 .cse10 .cse1 .cse2 .cse14 .cse4 .cse16 .cse17 .cse5) (and .cse9 .cse21 .cse34) (and .cse15 .cse2 .cse12 .cse14 .cse17 .cse19) (and .cse9 (and .cse15 .cse22 .cse14 .cse4 .cse17)) (and .cse0 .cse9 .cse21 .cse4) (and .cse18 .cse1 .cse32 .cse14 .cse4 .cse16) (and .cse1 .cse12 .cse14 .cse16 .cse28 .cse7) (and .cse18 .cse10 .cse23 .cse1 .cse3 .cse4 .cse16 .cse8) (and .cse15 .cse2 .cse12 .cse14 .cse28 .cse7) (and .cse9 .cse10 .cse15 .cse1 .cse2 .cse14 .cse4 .cse16 .cse5) (and .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse19) (and .cse10 .cse2 .cse36 .cse3 .cse21 .cse14 .cse4 .cse5 .cse8) (and .cse10 .cse26 .cse2 .cse12 .cse3 .cse7) (and .cse9 .cse18 .cse10 .cse1 .cse20 .cse4 .cse16) (and .cse25 .cse10 .cse35 .cse15 .cse1 .cse2 .cse14 .cse4 .cse17 .cse28) (and .cse9 .cse25 .cse10 .cse15 .cse1 .cse14 .cse4 .cse16) (and .cse9 .cse25 .cse10 .cse1 .cse11 .cse12 .cse14) (and .cse10 (and .cse36 .cse4) .cse1 .cse3 .cse14 .cse16 .cse5 .cse8) (and .cse18 .cse14 .cse4 .cse16 .cse19 .cse7) (and .cse18 .cse29 .cse1 .cse4 .cse16) (and .cse1 .cse12 .cse3 .cse16 (and .cse38 .cse20) .cse7) (and .cse9 .cse4 .cse37) (and .cse31 .cse16) (and .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse7) (and .cse12 .cse14 .cse16 .cse19) (and .cse19 .cse1 .cse12 .cse14 .cse7)))))) [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,146 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L451 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-01-12 01:09:32,147 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-01-12 01:09:32,148 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,149 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,149 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:09:32,149 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:09:32,149 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L444 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse2 (= ~a6~0 1)) (.cse38 (not (= ~a20~0 1))) (.cse15 (= ~a27~0 1)) (.cse14 (= ~a5~0 1)) (.cse6 (= ~a3~0 0))) (let ((.cse28 (not .cse6)) (.cse0 (and .cse38 .cse15 .cse14)) (.cse22 (not .cse2))) (let ((.cse33 (and .cse38 .cse14)) (.cse18 (<= ~a6~0 0)) (.cse21 (<= ~a26~0 0)) (.cse9 (<= ~a3~0 0)) (.cse12 (<= ~a11~0 0)) (.cse24 (and .cse0 .cse22)) (.cse16 (= ~a26~0 1)) (.cse39 (not .cse15)) (.cse17 (= ~a16~0 1)) (.cse19 (= ~a3~0 1)) (.cse1 (= ~a12~0 1)) (.cse36 (and .cse15 .cse28)) (.cse4 (= ~a11~0 1))) (let ((.cse27 (and .cse15 .cse22 .cse4 .cse28)) (.cse30 (and .cse22 .cse36)) (.cse13 (not .cse1)) (.cse34 (and .cse15 .cse22 .cse14 .cse4)) (.cse32 (and .cse38 .cse19)) (.cse23 (and .cse38 .cse14 .cse28)) (.cse26 (and (and .cse39 .cse14 .cse17 .cse28) .cse38)) (.cse35 (not .cse16)) (.cse25 (not (= ~a7~0 1))) (.cse11 (and .cse15 .cse22)) (.cse5 (= ~a15~0 1)) (.cse8 (<= ~a20~0 0)) (.cse29 (and .cse39 .cse14 .cse17 .cse19)) (.cse3 (= ~a1~0 1)) (.cse20 (and .cse39 .cse14 .cse17)) (.cse37 (and .cse38 .cse15 .cse14 .cse17)) (.cse31 (or (and .cse9 .cse33 .cse18 .cse1 .cse12 .cse21) (and .cse9 .cse1 .cse12 .cse24))) (.cse10 (= ~a10~0 1)) (.cse7 (= ~a0~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse5 .cse7) (and .cse9 .cse15 .cse14 .cse4 .cse16 .cse17) (and .cse18 .cse13 .cse14 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7) (and .cse10 .cse1 .cse2 .cse3 .cse14 .cse4 .cse17 .cse16 .cse5 .cse8) (and (and .cse0 .cse10 .cse1 .cse2 .cse4 .cse6 .cse7) .cse3 .cse8) (and .cse15 .cse2 .cse14 .cse4 .cse16 .cse19) (and .cse1 .cse20 .cse12 .cse21 .cse6 .cse7) (and (and .cse15 .cse22 .cse4 .cse17 .cse19) .cse14) (and .cse23 .cse2 .cse12 .cse3 .cse8 .cse7) (and (and .cse23 .cse2 .cse12 .cse5 .cse7) .cse3) (and .cse10 .cse12 .cse3 .cse16 .cse5 .cse24 .cse8) (and .cse9 .cse18 .cse1 .cse12 .cse21 .cse14) (and .cse9 .cse1 .cse11 .cse12 .cse14 .cse16 .cse5) (and .cse25 .cse18 .cse10 .cse26 .cse13 .cse21 .cse4 .cse5 .cse8) (and .cse9 .cse25 .cse10 .cse11 .cse12 .cse14 .cse16 .cse5) (and .cse10 .cse1 .cse12 .cse3 .cse16 .cse8 (and .cse23 .cse22)) (and .cse9 .cse25 .cse10 .cse15 .cse12 .cse14 .cse17 .cse5) (and .cse27 .cse14 .cse7) (and .cse25 .cse10 .cse15 .cse2 .cse12 .cse14 .cse28) (and .cse29 .cse1 .cse2 .cse21 .cse4) (and .cse9 .cse15 .cse12 .cse21 .cse14) (and .cse28 .cse25 .cse10 .cse1 .cse12 .cse14 .cse16) (and (and .cse10 .cse12 .cse13 .cse14 .cse5 .cse30 .cse7) .cse3 .cse8) (and .cse15 .cse1 .cse12 .cse21 .cse14 .cse7) (and .cse27 .cse25 .cse10 .cse14 .cse16) (and .cse9 .cse20 .cse2 .cse12 .cse13 .cse5) (and .cse25 .cse10 .cse2 .cse12 .cse14 .cse16) (and .cse31 .cse3 .cse6) (and .cse2 .cse14 .cse4 .cse16 .cse7) (and .cse0 .cse25 .cse10 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse1 .cse11 .cse12 .cse14 .cse6 .cse7) (and .cse12 .cse3 .cse21 .cse14 .cse30 .cse8 .cse7) (and .cse9 .cse2 .cse12 .cse14 .cse16) (and (and .cse12 .cse32 .cse14 .cse7) .cse3 .cse8) (and (and .cse33 .cse2 .cse12 .cse13 .cse5 .cse7) .cse3 .cse8) (and .cse25 .cse10 .cse15 .cse2 .cse3 .cse12 .cse14 .cse5 .cse7 .cse8) (and .cse10 .cse1 .cse16 .cse34 .cse7) (and .cse9 .cse15 .cse2 .cse12 .cse14 .cse17) (and .cse10 .cse23 .cse2 .cse3 .cse4 .cse16 .cse8) (and .cse18 .cse21 .cse14 .cse4 .cse28 .cse7) (and .cse18 .cse1 .cse14 .cse4 .cse16 .cse28 .cse7) (and .cse25 .cse10 .cse15 .cse2 .cse21 .cse14 .cse4 .cse28) (and .cse25 .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse28) (and .cse35 .cse2 .cse12 .cse14 .cse28 .cse7) (and .cse0 .cse10 .cse1 .cse3 .cse4 .cse16 .cse6 .cse8) (and .cse10 .cse1 .cse2 .cse36 .cse12 .cse3 .cse14 .cse5 .cse8) (and .cse0 .cse9 .cse10 .cse2 .cse13 .cse4 .cse5) (and .cse9 (and .cse22 .cse20) .cse1 .cse12 .cse21) (and .cse9 .cse10 .cse37 .cse12 .cse13 .cse5) (and .cse9 .cse25 .cse10 .cse1 .cse2 .cse14 .cse4 .cse16 .cse17 .cse5) (and .cse9 .cse21 .cse34) (and .cse15 .cse2 .cse12 .cse14 .cse17 .cse19) (and .cse9 (and .cse15 .cse22 .cse14 .cse4 .cse17)) (and .cse0 .cse9 .cse21 .cse4) (and .cse18 .cse1 .cse32 .cse14 .cse4 .cse16) (and .cse1 .cse12 .cse14 .cse16 .cse28 .cse7) (and .cse18 .cse10 .cse23 .cse1 .cse3 .cse4 .cse16 .cse8) (and .cse15 .cse2 .cse12 .cse14 .cse28 .cse7) (and .cse9 .cse10 .cse15 .cse1 .cse2 .cse14 .cse4 .cse16 .cse5) (and .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse19) (and .cse10 .cse2 .cse36 .cse3 .cse21 .cse14 .cse4 .cse5 .cse8) (and .cse10 .cse26 .cse2 .cse12 .cse3 .cse7) (and .cse9 .cse18 .cse10 .cse1 .cse20 .cse4 .cse16) (and .cse25 .cse10 .cse35 .cse15 .cse1 .cse2 .cse14 .cse4 .cse17 .cse28) (and .cse9 .cse25 .cse10 .cse15 .cse1 .cse14 .cse4 .cse16) (and .cse9 .cse25 .cse10 .cse1 .cse11 .cse12 .cse14) (and .cse10 (and .cse36 .cse4) .cse1 .cse3 .cse14 .cse16 .cse5 .cse8) (and .cse18 .cse14 .cse4 .cse16 .cse19 .cse7) (and .cse18 .cse29 .cse1 .cse4 .cse16) (and .cse1 .cse12 .cse3 .cse16 (and .cse38 .cse20) .cse7) (and .cse9 .cse4 .cse37) (and .cse31 .cse16) (and .cse18 .cse10 .cse1 .cse14 .cse4 .cse16 .cse7) (and .cse12 .cse14 .cse16 .cse19) (and .cse19 .cse1 .cse12 .cse14 .cse7)))))) [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,150 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-01-12 01:09:32,151 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-01-12 01:09:32,152 INFO L448 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:09:32,153 INFO L448 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,154 INFO L448 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,155 INFO L448 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-01-12 01:09:32,156 INFO L448 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,157 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,158 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,159 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,160 INFO L448 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-01-12 01:09:32,161 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-01-12 01:09:32,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 01:09:32 BoogieIcfgContainer [2019-01-12 01:09:32,278 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 01:09:32,279 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 01:09:32,279 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 01:09:32,285 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 01:09:32,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:57:28" (3/4) ... [2019-01-12 01:09:32,295 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 01:09:32,338 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 01:09:32,341 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 01:09:32,641 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 01:09:32,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 01:09:32,642 INFO L168 Benchmark]: Toolchain (without parser) took 731287.44 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 943.3 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,643 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:09:32,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1286.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,644 INFO L168 Benchmark]: Boogie Preprocessor took 143.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,644 INFO L168 Benchmark]: RCFGBuilder took 5172.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,645 INFO L168 Benchmark]: TraceAbstraction took 724146.64 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 892.0 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 6.0 GB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,645 INFO L168 Benchmark]: Witness Printer took 362.83 ms. Allocated memory is still 6.4 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:09:32,647 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 1286.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -226.0 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 166.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5172.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 892.0 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 724146.64 ms. Allocated memory was 1.2 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 892.0 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 6.0 GB. Max. memory is 11.5 GB. * Witness Printer took 362.83 ms. Allocated memory is still 6.4 GB. Free memory was 2.6 GB in the beginning and 2.5 GB in the end (delta: 74.7 MB). Peak memory consumption was 74.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1542]: 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: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a12 == 1) && a6 == 1) && a1 == 1) && a11 == 1) && a15 == 1) && a3 == 0) && a0 == 1) && a20 <= 0) || (((((((a3 <= 0 && a10 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && !(a12 == 1)) && a5 == 1) && a15 == 1) && a0 == 1)) || (((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a6 <= 0 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a3 == 0) && a0 == 1)) || (((((((((a10 == 1 && a12 == 1) && a6 == 1) && a1 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a10 == 1) && a12 == 1) && a6 == 1) && a11 == 1) && a3 == 0) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((a27 == 1 && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && a26 <= 0) && a3 == 0) && a0 == 1)) || (((((a27 == 1 && !(a6 == 1)) && a11 == 1) && a16 == 1) && a3 == 1) && a5 == 1)) || (((((((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a11 <= 0) && a1 == 1) && a20 <= 0) && a0 == 1)) || (((((((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a11 <= 0) && a15 == 1) && a0 == 1) && a1 == 1)) || ((((((a10 == 1 && a11 <= 0) && a1 == 1) && a26 == 1) && a15 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1)) && a20 <= 0)) || (((((a3 <= 0 && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((((a3 <= 0 && a12 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1)) || ((((((((!(a7 == 1) && a6 <= 0) && a10 == 1) && (((!(a27 == 1) && a5 == 1) && a16 == 1) && !(a3 == 0)) && !(a20 == 1)) && !(a12 == 1)) && a26 <= 0) && a11 == 1) && a15 == 1) && a20 <= 0)) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1)) || ((((((a10 == 1 && a12 == 1) && a11 <= 0) && a1 == 1) && a26 == 1) && a20 <= 0) && ((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && !(a6 == 1))) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && a16 == 1) && a15 == 1)) || (((((a27 == 1 && !(a6 == 1)) && a11 == 1) && !(a3 == 0)) && a5 == 1) && a0 == 1)) || ((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0))) || (((((((!(a27 == 1) && a5 == 1) && a16 == 1) && a3 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a11 == 1)) || ((((a3 <= 0 && a27 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((((!(a3 == 0) && !(a7 == 1)) && a10 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((((a10 == 1 && a11 <= 0) && !(a12 == 1)) && a5 == 1) && a15 == 1) && !(a6 == 1) && a27 == 1 && !(a3 == 0)) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((a27 == 1 && a12 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1) && a0 == 1)) || (((((((a27 == 1 && !(a6 == 1)) && a11 == 1) && !(a3 == 0)) && !(a7 == 1)) && a10 == 1) && a5 == 1) && a26 == 1)) || (((((a3 <= 0 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a6 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1)) || (((((!(a7 == 1) && a10 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a20 == 1) && a5 == 1) && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) || (((a3 <= 0 && a12 == 1) && a11 <= 0) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1))) && a1 == 1) && a3 == 0)) || ((((a6 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && a0 == 1)) || ((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a7 == 1)) && a10 == 1) && a11 <= 0) && !(a12 == 1)) && a1 == 1) && a15 == 1) && a3 == 0) && a0 == 1)) || (((((a12 == 1 && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a3 == 0) && a0 == 1)) || ((((((a11 <= 0 && a1 == 1) && a26 <= 0) && a5 == 1) && !(a6 == 1) && a27 == 1 && !(a3 == 0)) && a20 <= 0) && a0 == 1)) || ((((a3 <= 0 && a6 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((a11 <= 0 && !(a20 == 1) && a3 == 1) && a5 == 1) && a0 == 1) && a1 == 1) && a20 <= 0)) || ((((((((!(a20 == 1) && a5 == 1) && a6 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a1 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && a0 == 1) && a20 <= 0)) || ((((a10 == 1 && a12 == 1) && a26 == 1) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1) && a0 == 1)) || (((((a3 <= 0 && a27 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && a16 == 1)) || ((((((a10 == 1 && (!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a20 <= 0)) || (((((a6 <= 0 && a26 <= 0) && a5 == 1) && a11 == 1) && !(a3 == 0)) && a0 == 1)) || ((((((a6 <= 0 && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && !(a3 == 0))) || (((((((!(a7 == 1) && a6 <= 0) && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && !(a3 == 0))) || (((((!(a26 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a10 == 1) && a12 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a3 == 0) && a20 <= 0)) || ((((((((a10 == 1 && a12 == 1) && a6 == 1) && a27 == 1 && !(a3 == 0)) && a11 <= 0) && a1 == 1) && a5 == 1) && a15 == 1) && a20 <= 0)) || ((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a3 <= 0) && a10 == 1) && a6 == 1) && !(a12 == 1)) && a11 == 1) && a15 == 1)) || ((((a3 <= 0 && !(a6 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a12 == 1) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && a10 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1)) || (((((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || ((a3 <= 0 && a26 <= 0) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1)) || (((((a27 == 1 && a6 == 1) && a11 <= 0) && a5 == 1) && a16 == 1) && a3 == 1)) || (a3 <= 0 && (((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a20 == 1) && a27 == 1) && a5 == 1) && a3 <= 0) && a26 <= 0) && a11 == 1)) || (((((a6 <= 0 && a12 == 1) && !(a20 == 1) && a3 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((a6 <= 0 && a10 == 1) && (!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a12 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a20 <= 0)) || (((((a27 == 1 && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0)) && a0 == 1)) || ((((((((a3 <= 0 && a10 == 1) && a27 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((a6 <= 0 && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1)) || ((((((((a10 == 1 && a6 == 1) && a27 == 1 && !(a3 == 0)) && a1 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && a15 == 1) && a20 <= 0)) || (((((a10 == 1 && (((!(a27 == 1) && a5 == 1) && a16 == 1) && !(a3 == 0)) && !(a20 == 1)) && a6 == 1) && a11 <= 0) && a1 == 1) && a0 == 1)) || ((((((a3 <= 0 && a6 <= 0) && a10 == 1) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || (((((((((!(a7 == 1) && a10 == 1) && !(a26 == 1)) && a27 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && !(a3 == 0))) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a12 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1)) || (((((((a10 == 1 && (a27 == 1 && !(a3 == 0)) && a11 == 1) && a12 == 1) && a1 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || (((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1) && a0 == 1)) || ((((a6 <= 0 && ((!(a27 == 1) && a5 == 1) && a16 == 1) && a3 == 1) && a12 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && a11 <= 0) && a1 == 1) && a26 == 1) && !(a20 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a0 == 1)) || ((a3 <= 0 && a11 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1) && a5 == 1) && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) || (((a3 <= 0 && a12 == 1) && a11 <= 0) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1))) && a26 == 1)) || ((((((a6 <= 0 && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a0 == 1)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && a3 == 1)) || ((((a3 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a0 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a12 == 1) && a6 == 1) && a1 == 1) && a11 == 1) && a15 == 1) && a3 == 0) && a0 == 1) && a20 <= 0) || (((((((a3 <= 0 && a10 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && !(a12 == 1)) && a5 == 1) && a15 == 1) && a0 == 1)) || (((((a3 <= 0 && a27 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1)) || ((((((((a6 <= 0 && !(a12 == 1)) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1) && a3 == 0) && a0 == 1)) || (((((((((a10 == 1 && a12 == 1) && a6 == 1) && a1 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || ((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a10 == 1) && a12 == 1) && a6 == 1) && a11 == 1) && a3 == 0) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((a27 == 1 && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1)) || (((((a12 == 1 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && a26 <= 0) && a3 == 0) && a0 == 1)) || (((((a27 == 1 && !(a6 == 1)) && a11 == 1) && a16 == 1) && a3 == 1) && a5 == 1)) || (((((((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a11 <= 0) && a1 == 1) && a20 <= 0) && a0 == 1)) || (((((((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a11 <= 0) && a15 == 1) && a0 == 1) && a1 == 1)) || ((((((a10 == 1 && a11 <= 0) && a1 == 1) && a26 == 1) && a15 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1)) && a20 <= 0)) || (((((a3 <= 0 && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((((a3 <= 0 && a12 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1)) || ((((((((!(a7 == 1) && a6 <= 0) && a10 == 1) && (((!(a27 == 1) && a5 == 1) && a16 == 1) && !(a3 == 0)) && !(a20 == 1)) && !(a12 == 1)) && a26 <= 0) && a11 == 1) && a15 == 1) && a20 <= 0)) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a26 == 1) && a15 == 1)) || ((((((a10 == 1 && a12 == 1) && a11 <= 0) && a1 == 1) && a26 == 1) && a20 <= 0) && ((!(a20 == 1) && a5 == 1) && !(a3 == 0)) && !(a6 == 1))) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1) && a11 <= 0) && a5 == 1) && a16 == 1) && a15 == 1)) || (((((a27 == 1 && !(a6 == 1)) && a11 == 1) && !(a3 == 0)) && a5 == 1) && a0 == 1)) || ((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0))) || (((((((!(a27 == 1) && a5 == 1) && a16 == 1) && a3 == 1) && a12 == 1) && a6 == 1) && a26 <= 0) && a11 == 1)) || ((((a3 <= 0 && a27 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1)) || ((((((!(a3 == 0) && !(a7 == 1)) && a10 == 1) && a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((((a10 == 1 && a11 <= 0) && !(a12 == 1)) && a5 == 1) && a15 == 1) && !(a6 == 1) && a27 == 1 && !(a3 == 0)) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((a27 == 1 && a12 == 1) && a11 <= 0) && a26 <= 0) && a5 == 1) && a0 == 1)) || (((((((a27 == 1 && !(a6 == 1)) && a11 == 1) && !(a3 == 0)) && !(a7 == 1)) && a10 == 1) && a5 == 1) && a26 == 1)) || (((((a3 <= 0 && (!(a27 == 1) && a5 == 1) && a16 == 1) && a6 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1)) || (((((!(a7 == 1) && a10 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || ((((((((a3 <= 0 && !(a20 == 1) && a5 == 1) && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) || (((a3 <= 0 && a12 == 1) && a11 <= 0) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1))) && a1 == 1) && a3 == 0)) || ((((a6 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && a0 == 1)) || ((((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a7 == 1)) && a10 == 1) && a11 <= 0) && !(a12 == 1)) && a1 == 1) && a15 == 1) && a3 == 0) && a0 == 1)) || (((((a12 == 1 && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1) && a3 == 0) && a0 == 1)) || ((((((a11 <= 0 && a1 == 1) && a26 <= 0) && a5 == 1) && !(a6 == 1) && a27 == 1 && !(a3 == 0)) && a20 <= 0) && a0 == 1)) || ((((a3 <= 0 && a6 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((((a11 <= 0 && !(a20 == 1) && a3 == 1) && a5 == 1) && a0 == 1) && a1 == 1) && a20 <= 0)) || ((((((((!(a20 == 1) && a5 == 1) && a6 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1) && a0 == 1) && a1 == 1) && a20 <= 0)) || (((((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a1 == 1) && a11 <= 0) && a5 == 1) && a15 == 1) && a0 == 1) && a20 <= 0)) || ((((a10 == 1 && a12 == 1) && a26 == 1) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1) && a0 == 1)) || (((((a3 <= 0 && a27 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && a16 == 1)) || ((((((a10 == 1 && (!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a6 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a20 <= 0)) || (((((a6 <= 0 && a26 <= 0) && a5 == 1) && a11 == 1) && !(a3 == 0)) && a0 == 1)) || ((((((a6 <= 0 && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((!(a7 == 1) && a10 == 1) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && !(a3 == 0))) || (((((((!(a7 == 1) && a6 <= 0) && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && !(a3 == 0))) || (((((!(a26 == 1) && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a10 == 1) && a12 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a3 == 0) && a20 <= 0)) || ((((((((a10 == 1 && a12 == 1) && a6 == 1) && a27 == 1 && !(a3 == 0)) && a11 <= 0) && a1 == 1) && a5 == 1) && a15 == 1) && a20 <= 0)) || ((((((((!(a20 == 1) && a27 == 1) && a5 == 1) && a3 <= 0) && a10 == 1) && a6 == 1) && !(a12 == 1)) && a11 == 1) && a15 == 1)) || ((((a3 <= 0 && !(a6 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a12 == 1) && a11 <= 0) && a26 <= 0)) || (((((a3 <= 0 && a10 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1) && a11 <= 0) && !(a12 == 1)) && a15 == 1)) || (((((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && a15 == 1)) || ((a3 <= 0 && a26 <= 0) && ((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1)) || (((((a27 == 1 && a6 == 1) && a11 <= 0) && a5 == 1) && a16 == 1) && a3 == 1)) || (a3 <= 0 && (((a27 == 1 && !(a6 == 1)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((!(a20 == 1) && a27 == 1) && a5 == 1) && a3 <= 0) && a26 <= 0) && a11 == 1)) || (((((a6 <= 0 && a12 == 1) && !(a20 == 1) && a3 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && a11 <= 0) && a5 == 1) && a26 == 1) && !(a3 == 0)) && a0 == 1)) || (((((((a6 <= 0 && a10 == 1) && (!(a20 == 1) && a5 == 1) && !(a3 == 0)) && a12 == 1) && a1 == 1) && a11 == 1) && a26 == 1) && a20 <= 0)) || (((((a27 == 1 && a6 == 1) && a11 <= 0) && a5 == 1) && !(a3 == 0)) && a0 == 1)) || ((((((((a3 <= 0 && a10 == 1) && a27 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((a6 <= 0 && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1)) || ((((((((a10 == 1 && a6 == 1) && a27 == 1 && !(a3 == 0)) && a1 == 1) && a26 <= 0) && a5 == 1) && a11 == 1) && a15 == 1) && a20 <= 0)) || (((((a10 == 1 && (((!(a27 == 1) && a5 == 1) && a16 == 1) && !(a3 == 0)) && !(a20 == 1)) && a6 == 1) && a11 <= 0) && a1 == 1) && a0 == 1)) || ((((((a3 <= 0 && a6 <= 0) && a10 == 1) && a12 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a11 == 1) && a26 == 1)) || (((((((((!(a7 == 1) && a10 == 1) && !(a26 == 1)) && a27 == 1) && a12 == 1) && a6 == 1) && a5 == 1) && a11 == 1) && a16 == 1) && !(a3 == 0))) || (((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a27 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((((a3 <= 0 && !(a7 == 1)) && a10 == 1) && a12 == 1) && a27 == 1 && !(a6 == 1)) && a11 <= 0) && a5 == 1)) || (((((((a10 == 1 && (a27 == 1 && !(a3 == 0)) && a11 == 1) && a12 == 1) && a1 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a20 <= 0)) || (((((a6 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a3 == 1) && a0 == 1)) || ((((a6 <= 0 && ((!(a27 == 1) && a5 == 1) && a16 == 1) && a3 == 1) && a12 == 1) && a11 == 1) && a26 == 1)) || (((((a12 == 1 && a11 <= 0) && a1 == 1) && a26 == 1) && !(a20 == 1) && (!(a27 == 1) && a5 == 1) && a16 == 1) && a0 == 1)) || ((a3 <= 0 && a11 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (((((((a3 <= 0 && !(a20 == 1) && a5 == 1) && a6 <= 0) && a12 == 1) && a11 <= 0) && a26 <= 0) || (((a3 <= 0 && a12 == 1) && a11 <= 0) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && !(a6 == 1))) && a26 == 1)) || ((((((a6 <= 0 && a10 == 1) && a12 == 1) && a5 == 1) && a11 == 1) && a26 == 1) && a0 == 1)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && a3 == 1)) || ((((a3 == 1 && a12 == 1) && a11 <= 0) && a5 == 1) && a0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. SAFE Result, 723.9s OverallTime, 17 OverallIterations, 6 TraceHistogramMax, 63.0s AutomataDifference, 0.0s DeadEndRemovalTime, 625.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 2748 SDtfs, 13199 SDslu, 2525 SDs, 0 SdLazy, 17316 SolverSat, 3777 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1023 GetRequests, 967 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393546occurred in iteration=16, 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: 26.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 157409 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 8074 NumberOfFragments, 4183 HoareAnnotationTreeSize, 3 FomulaSimplifications, 427688 FormulaSimplificationTreeSizeReduction, 372.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 516776 FormulaSimplificationTreeSizeReductionInter, 253.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5446 NumberOfCodeBlocks, 5446 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5426 ConstructedInterpolants, 0 QuantifiedInterpolants, 2949708 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1746 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 3093/3112 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...