./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label11_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/Problem15_label11_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 7ac7639a72133e31492d63978588a646cea9108e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:30:10,499 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:30:10,501 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:30:10,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:30:10,513 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:30:10,514 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:30:10,515 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:30:10,517 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:30:10,519 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:30:10,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:30:10,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:30:10,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:30:10,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:30:10,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:30:10,524 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:30:10,525 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:30:10,526 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:30:10,528 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:30:10,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:30:10,532 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:30:10,533 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:30:10,534 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:30:10,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:30:10,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:30:10,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:30:10,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:30:10,540 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:30:10,541 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:30:10,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:30:10,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:30:10,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:30:10,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:30:10,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:30:10,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:30:10,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:30:10,546 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:30:10,547 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:30:10,572 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:30:10,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:30:10,576 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:30:10,576 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:30:10,576 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:30:10,577 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:30:10,578 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:30:10,578 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:30:10,578 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:30:10,578 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:30:10,578 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:30:10,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:30:10,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:30:10,579 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:30:10,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:30:10,580 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:30:10,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:30:10,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:30:10,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:30:10,580 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:30:10,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:30:10,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:30:10,581 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:30:10,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:30:10,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:30:10,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:30:10,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:30:10,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:30:10,584 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 -> 7ac7639a72133e31492d63978588a646cea9108e [2019-01-12 04:30:10,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:30:10,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:30:10,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:30:10,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:30:10,675 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:30:10,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label11_true-unreach-call.c [2019-01-12 04:30:10,730 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c367696a/8014e1a6efe248cc92c48f1b55bac6b1/FLAG1e3f609ce [2019-01-12 04:30:11,338 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:30:11,339 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label11_true-unreach-call.c [2019-01-12 04:30:11,357 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c367696a/8014e1a6efe248cc92c48f1b55bac6b1/FLAG1e3f609ce [2019-01-12 04:30:11,512 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c367696a/8014e1a6efe248cc92c48f1b55bac6b1 [2019-01-12 04:30:11,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:30:11,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:30:11,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:30:11,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:30:11,523 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:30:11,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:30:11" (1/1) ... [2019-01-12 04:30:11,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae4de63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:11, skipping insertion in model container [2019-01-12 04:30:11,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:30:11" (1/1) ... [2019-01-12 04:30:11,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:30:11,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:30:12,674 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:30:12,683 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:30:12,996 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:30:13,020 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:30:13,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13 WrapperNode [2019-01-12 04:30:13,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:30:13,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:30:13,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:30:13,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:30:13,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:30:13,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:30:13,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:30:13,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:30:13,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... [2019-01-12 04:30:13,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:30:13,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:30:13,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:30:13,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:30:13,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:30:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:30:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:30:20,094 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:30:20,094 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:30:20,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:30:20 BoogieIcfgContainer [2019-01-12 04:30:20,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:30:20,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:30:20,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:30:20,101 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:30:20,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:30:11" (1/3) ... [2019-01-12 04:30:20,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f83f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:30:20, skipping insertion in model container [2019-01-12 04:30:20,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:30:13" (2/3) ... [2019-01-12 04:30:20,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192f83f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:30:20, skipping insertion in model container [2019-01-12 04:30:20,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:30:20" (3/3) ... [2019-01-12 04:30:20,106 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label11_true-unreach-call.c [2019-01-12 04:30:20,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:30:20,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:30:20,141 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:30:20,180 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:30:20,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:30:20,181 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:30:20,181 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:30:20,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:30:20,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:30:20,181 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:30:20,181 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:30:20,181 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:30:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:30:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 04:30:20,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:20,220 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] [2019-01-12 04:30:20,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-01-12 04:30:20,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:20,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:20,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:20,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:20,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:20,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:20,730 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:30:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:26,410 INFO L93 Difference]: Finished difference Result 1466 states and 2714 transitions. [2019-01-12 04:30:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:26,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 04:30:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:26,440 INFO L225 Difference]: With dead ends: 1466 [2019-01-12 04:30:26,440 INFO L226 Difference]: Without dead ends: 975 [2019-01-12 04:30:26,447 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 04:30:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-01-12 04:30:26,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 973. [2019-01-12 04:30:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-01-12 04:30:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1485 transitions. [2019-01-12 04:30:26,572 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1485 transitions. Word has length 55 [2019-01-12 04:30:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:26,574 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1485 transitions. [2019-01-12 04:30:26,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1485 transitions. [2019-01-12 04:30:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-12 04:30:26,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:26,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:26,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:26,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:26,585 INFO L82 PathProgramCache]: Analyzing trace with hash 521697686, now seen corresponding path program 1 times [2019-01-12 04:30:26,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:26,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:26,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:26,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:26,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:26,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:26,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:30:26,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:26,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:26,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:26,934 INFO L87 Difference]: Start difference. First operand 973 states and 1485 transitions. Second operand 4 states. [2019-01-12 04:30:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:33,949 INFO L93 Difference]: Finished difference Result 3745 states and 5745 transitions. [2019-01-12 04:30:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:33,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-01-12 04:30:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:33,971 INFO L225 Difference]: With dead ends: 3745 [2019-01-12 04:30:33,972 INFO L226 Difference]: Without dead ends: 2774 [2019-01-12 04:30:33,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2019-01-12 04:30:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1871. [2019-01-12 04:30:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2019-01-12 04:30:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2498 transitions. [2019-01-12 04:30:34,031 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2498 transitions. Word has length 167 [2019-01-12 04:30:34,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:34,032 INFO L480 AbstractCegarLoop]: Abstraction has 1871 states and 2498 transitions. [2019-01-12 04:30:34,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:34,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2498 transitions. [2019-01-12 04:30:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-01-12 04:30:34,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:34,041 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:30:34,043 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:34,044 INFO L82 PathProgramCache]: Analyzing trace with hash -256885756, now seen corresponding path program 1 times [2019-01-12 04:30:34,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:34,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:34,808 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 04:30:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:34,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:34,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:30:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:30:34,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:34,811 INFO L87 Difference]: Start difference. First operand 1871 states and 2498 transitions. Second operand 5 states. [2019-01-12 04:30:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:41,806 INFO L93 Difference]: Finished difference Result 4639 states and 5973 transitions. [2019-01-12 04:30:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:41,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 327 [2019-01-12 04:30:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:41,823 INFO L225 Difference]: With dead ends: 4639 [2019-01-12 04:30:41,823 INFO L226 Difference]: Without dead ends: 2770 [2019-01-12 04:30:41,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-01-12 04:30:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2470. [2019-01-12 04:30:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-01-12 04:30:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 3139 transitions. [2019-01-12 04:30:41,881 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 3139 transitions. Word has length 327 [2019-01-12 04:30:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:41,882 INFO L480 AbstractCegarLoop]: Abstraction has 2470 states and 3139 transitions. [2019-01-12 04:30:41,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:30:41,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 3139 transitions. [2019-01-12 04:30:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-12 04:30:41,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:41,890 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:41,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:41,892 INFO L82 PathProgramCache]: Analyzing trace with hash -52089934, now seen corresponding path program 1 times [2019-01-12 04:30:41,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:41,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:42,529 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:30:43,064 WARN L181 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:30:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 102 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:43,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:43,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:30:43,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:43,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:44,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:30:44,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-01-12 04:30:44,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:30:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:30:44,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:30:44,191 INFO L87 Difference]: Start difference. First operand 2470 states and 3139 transitions. Second operand 11 states. [2019-01-12 04:30:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:58,250 INFO L93 Difference]: Finished difference Result 9237 states and 11931 transitions. [2019-01-12 04:30:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 04:30:58,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 401 [2019-01-12 04:30:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:58,289 INFO L225 Difference]: With dead ends: 9237 [2019-01-12 04:30:58,289 INFO L226 Difference]: Without dead ends: 6769 [2019-01-12 04:30:58,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 410 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-12 04:30:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states. [2019-01-12 04:30:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 4273. [2019-01-12 04:30:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4273 states. [2019-01-12 04:30:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4273 states to 4273 states and 5480 transitions. [2019-01-12 04:30:58,403 INFO L78 Accepts]: Start accepts. Automaton has 4273 states and 5480 transitions. Word has length 401 [2019-01-12 04:30:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:58,405 INFO L480 AbstractCegarLoop]: Abstraction has 4273 states and 5480 transitions. [2019-01-12 04:30:58,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:30:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4273 states and 5480 transitions. [2019-01-12 04:30:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-01-12 04:30:58,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:58,427 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:58,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:58,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 889722734, now seen corresponding path program 1 times [2019-01-12 04:30:58,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:58,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:58,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 567 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-01-12 04:30:59,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:59,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:59,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:59,138 INFO L87 Difference]: Start difference. First operand 4273 states and 5480 transitions. Second operand 4 states. [2019-01-12 04:31:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:03,683 INFO L93 Difference]: Finished difference Result 8546 states and 10964 transitions. [2019-01-12 04:31:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:31:03,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 602 [2019-01-12 04:31:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:03,706 INFO L225 Difference]: With dead ends: 8546 [2019-01-12 04:31:03,707 INFO L226 Difference]: Without dead ends: 4275 [2019-01-12 04:31:03,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:31:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2019-01-12 04:31:03,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4270. [2019-01-12 04:31:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4270 states. [2019-01-12 04:31:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 5247 transitions. [2019-01-12 04:31:03,806 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 5247 transitions. Word has length 602 [2019-01-12 04:31:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:03,807 INFO L480 AbstractCegarLoop]: Abstraction has 4270 states and 5247 transitions. [2019-01-12 04:31:03,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:31:03,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 5247 transitions. [2019-01-12 04:31:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2019-01-12 04:31:03,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:03,831 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:31:03,831 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:03,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -696003180, now seen corresponding path program 1 times [2019-01-12 04:31:03,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:03,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:03,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:04,534 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:31:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 734 proven. 3 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-01-12 04:31:05,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:05,289 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 04:31:05,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:05,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2019-01-12 04:31:05,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:31:05,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:31:05,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:31:05,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:31:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:31:05,825 INFO L87 Difference]: Start difference. First operand 4270 states and 5247 transitions. Second operand 8 states. [2019-01-12 04:31:12,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:12,646 INFO L93 Difference]: Finished difference Result 13484 states and 16188 transitions. [2019-01-12 04:31:12,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:31:12,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 634 [2019-01-12 04:31:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:12,681 INFO L225 Difference]: With dead ends: 13484 [2019-01-12 04:31:12,681 INFO L226 Difference]: Without dead ends: 7855 [2019-01-12 04:31:12,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 639 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:31:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7855 states. [2019-01-12 04:31:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7855 to 5762. [2019-01-12 04:31:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5762 states. [2019-01-12 04:31:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5762 states to 5762 states and 6522 transitions. [2019-01-12 04:31:12,904 INFO L78 Accepts]: Start accepts. Automaton has 5762 states and 6522 transitions. Word has length 634 [2019-01-12 04:31:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:12,905 INFO L480 AbstractCegarLoop]: Abstraction has 5762 states and 6522 transitions. [2019-01-12 04:31:12,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:31:12,905 INFO L276 IsEmpty]: Start isEmpty. Operand 5762 states and 6522 transitions. [2019-01-12 04:31:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2019-01-12 04:31:12,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:12,918 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:31:12,918 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 547646301, now seen corresponding path program 1 times [2019-01-12 04:31:12,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:12,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:12,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:12,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:13,751 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:31:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 211 proven. 263 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:31:14,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:14,490 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 04:31:14,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:14,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:31:15,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:31:15,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:31:15,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:31:15,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:31:15,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:31:15,785 INFO L87 Difference]: Start difference. First operand 5762 states and 6522 transitions. Second operand 7 states. [2019-01-12 04:31:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:22,047 INFO L93 Difference]: Finished difference Result 19878 states and 22059 transitions. [2019-01-12 04:31:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:31:22,048 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 684 [2019-01-12 04:31:22,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:22,103 INFO L225 Difference]: With dead ends: 19878 [2019-01-12 04:31:22,103 INFO L226 Difference]: Without dead ends: 9334 [2019-01-12 04:31:22,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:31:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9334 states. [2019-01-12 04:31:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9334 to 7232. [2019-01-12 04:31:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7232 states. [2019-01-12 04:31:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 7583 transitions. [2019-01-12 04:31:22,254 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 7583 transitions. Word has length 684 [2019-01-12 04:31:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:22,255 INFO L480 AbstractCegarLoop]: Abstraction has 7232 states and 7583 transitions. [2019-01-12 04:31:22,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:31:22,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 7583 transitions. [2019-01-12 04:31:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2019-01-12 04:31:22,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:22,272 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:31:22,273 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:22,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:22,273 INFO L82 PathProgramCache]: Analyzing trace with hash -406546161, now seen corresponding path program 1 times [2019-01-12 04:31:22,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:22,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:22,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:22,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 639 proven. 178 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:31:23,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:23,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:31:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:23,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 661 proven. 156 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:31:24,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:31:24,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2019-01-12 04:31:24,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 04:31:24,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 04:31:24,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:31:24,312 INFO L87 Difference]: Start difference. First operand 7232 states and 7583 transitions. Second operand 13 states. [2019-01-12 04:31:41,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:41,035 INFO L93 Difference]: Finished difference Result 24974 states and 26374 transitions. [2019-01-12 04:31:41,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 04:31:41,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 781 [2019-01-12 04:31:41,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:41,069 INFO L225 Difference]: With dead ends: 24974 [2019-01-12 04:31:41,069 INFO L226 Difference]: Without dead ends: 17133 [2019-01-12 04:31:41,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 797 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=640, Unknown=0, NotChecked=0, Total=930 [2019-01-12 04:31:41,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17133 states. [2019-01-12 04:31:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17133 to 12020. [2019-01-12 04:31:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12020 states. [2019-01-12 04:31:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12020 states to 12020 states and 12468 transitions. [2019-01-12 04:31:41,269 INFO L78 Accepts]: Start accepts. Automaton has 12020 states and 12468 transitions. Word has length 781 [2019-01-12 04:31:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:41,271 INFO L480 AbstractCegarLoop]: Abstraction has 12020 states and 12468 transitions. [2019-01-12 04:31:41,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 04:31:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12020 states and 12468 transitions. [2019-01-12 04:31:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 979 [2019-01-12 04:31:41,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:41,299 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:31:41,299 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash 713623686, now seen corresponding path program 1 times [2019-01-12 04:31:41,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:41,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:41,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:41,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1369 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-01-12 04:31:42,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:31:42,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:31:42,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:31:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:31:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:31:42,219 INFO L87 Difference]: Start difference. First operand 12020 states and 12468 transitions. Second operand 3 states. [2019-01-12 04:31:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:43,743 INFO L93 Difference]: Finished difference Result 26727 states and 27758 transitions. [2019-01-12 04:31:43,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:31:43,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 978 [2019-01-12 04:31:43,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:43,777 INFO L225 Difference]: With dead ends: 26727 [2019-01-12 04:31:43,777 INFO L226 Difference]: Without dead ends: 14709 [2019-01-12 04:31:43,789 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 04:31:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14709 states. [2019-01-12 04:31:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14709 to 13513. [2019-01-12 04:31:43,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-01-12 04:31:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 13971 transitions. [2019-01-12 04:31:44,022 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 13971 transitions. Word has length 978 [2019-01-12 04:31:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:44,025 INFO L480 AbstractCegarLoop]: Abstraction has 13513 states and 13971 transitions. [2019-01-12 04:31:44,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:31:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 13971 transitions. [2019-01-12 04:31:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1115 [2019-01-12 04:31:44,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:44,071 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:31:44,073 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:44,074 INFO L82 PathProgramCache]: Analyzing trace with hash -341766076, now seen corresponding path program 1 times [2019-01-12 04:31:44,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:44,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:44,614 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2019-01-12 04:31:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2318 backedges. 1401 proven. 0 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-01-12 04:31:45,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:31:45,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:31:45,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:31:45,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:31:45,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:31:45,410 INFO L87 Difference]: Start difference. First operand 13513 states and 13971 transitions. Second operand 3 states. [2019-01-12 04:31:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:47,329 INFO L93 Difference]: Finished difference Result 32117 states and 33241 transitions. [2019-01-12 04:31:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:31:47,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1114 [2019-01-12 04:31:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:47,359 INFO L225 Difference]: With dead ends: 32117 [2019-01-12 04:31:47,359 INFO L226 Difference]: Without dead ends: 18606 [2019-01-12 04:31:47,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 04:31:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18606 states. [2019-01-12 04:31:47,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18606 to 15605. [2019-01-12 04:31:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-01-12 04:31:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 16148 transitions. [2019-01-12 04:31:47,628 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 16148 transitions. Word has length 1114 [2019-01-12 04:31:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:47,630 INFO L480 AbstractCegarLoop]: Abstraction has 15605 states and 16148 transitions. [2019-01-12 04:31:47,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:31:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 16148 transitions. [2019-01-12 04:31:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2019-01-12 04:31:47,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:47,682 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:31:47,682 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1817042583, now seen corresponding path program 1 times [2019-01-12 04:31:47,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:47,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:47,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:47,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:48,457 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:31:48,641 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-12 04:31:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 1640 proven. 201 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2019-01-12 04:31:49,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:49,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:31:49,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:50,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2434 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-01-12 04:31:50,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:31:50,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:31:50,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:31:50,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:31:50,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:31:50,877 INFO L87 Difference]: Start difference. First operand 15605 states and 16148 transitions. Second operand 9 states. [2019-01-12 04:31:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:55,393 INFO L93 Difference]: Finished difference Result 39201 states and 40516 transitions. [2019-01-12 04:31:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:31:55,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1199 [2019-01-12 04:31:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:55,413 INFO L225 Difference]: With dead ends: 39201 [2019-01-12 04:31:55,413 INFO L226 Difference]: Without dead ends: 23598 [2019-01-12 04:31:55,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1217 GetRequests, 1203 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:31:55,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23598 states. [2019-01-12 04:31:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23598 to 20991. [2019-01-12 04:31:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20991 states. [2019-01-12 04:31:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20991 states to 20991 states and 21630 transitions. [2019-01-12 04:31:55,723 INFO L78 Accepts]: Start accepts. Automaton has 20991 states and 21630 transitions. Word has length 1199 [2019-01-12 04:31:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:55,724 INFO L480 AbstractCegarLoop]: Abstraction has 20991 states and 21630 transitions. [2019-01-12 04:31:55,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:31:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 20991 states and 21630 transitions. [2019-01-12 04:31:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2019-01-12 04:31:55,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:55,764 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:31:55,765 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1078208503, now seen corresponding path program 1 times [2019-01-12 04:31:55,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:55,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:55,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:55,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 1757 proven. 625 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-01-12 04:31:58,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:58,977 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:31:58,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:59,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:32:00,413 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_898 Int)) (and (<= 0 (+ v_~a29~0_898 317633)) (<= (mod (+ v_~a29~0_898 17705) 299928) (+ c_~a29~0 300071)))) (exists ((v_prenex_8 Int)) (let ((.cse0 (mod (+ v_prenex_8 17705) 299928))) (and (= .cse0 0) (<= .cse0 (+ c_~a29~0 300071))))) (exists ((v_prenex_7 Int)) (let ((.cse1 (mod (+ v_prenex_7 17705) 299928))) (and (<= .cse1 (+ c_~a29~0 599999)) (< (+ v_prenex_7 317633) 0) (not (= .cse1 0)))))) is different from true [2019-01-12 04:32:01,289 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 33 [2019-01-12 04:32:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 1635 trivial. 53 not checked. [2019-01-12 04:32:04,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:32:04,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-01-12 04:32:04,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:32:04,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:32:04,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=1, NotChecked=22, Total=182 [2019-01-12 04:32:04,463 INFO L87 Difference]: Start difference. First operand 20991 states and 21630 transitions. Second operand 14 states. [2019-01-12 04:32:25,078 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2019-01-12 04:32:30,265 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2019-01-12 04:32:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:31,241 INFO L93 Difference]: Finished difference Result 50137 states and 51644 transitions. [2019-01-12 04:32:31,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-12 04:32:31,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1275 [2019-01-12 04:32:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:31,270 INFO L225 Difference]: With dead ends: 50137 [2019-01-12 04:32:31,271 INFO L226 Difference]: Without dead ends: 28535 [2019-01-12 04:32:31,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1355 GetRequests, 1302 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=531, Invalid=2014, Unknown=9, NotChecked=98, Total=2652 [2019-01-12 04:32:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28535 states. [2019-01-12 04:32:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28535 to 22981. [2019-01-12 04:32:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22981 states. [2019-01-12 04:32:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22981 states to 22981 states and 23646 transitions. [2019-01-12 04:32:31,576 INFO L78 Accepts]: Start accepts. Automaton has 22981 states and 23646 transitions. Word has length 1275 [2019-01-12 04:32:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:31,577 INFO L480 AbstractCegarLoop]: Abstraction has 22981 states and 23646 transitions. [2019-01-12 04:32:31,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:32:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 22981 states and 23646 transitions. [2019-01-12 04:32:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1697 [2019-01-12 04:32:31,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:31,608 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:31,608 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash 551691180, now seen corresponding path program 1 times [2019-01-12 04:32:31,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:31,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:32,908 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 04:32:33,227 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 04:32:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4899 backedges. 3034 proven. 837 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-01-12 04:32:39,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:32:39,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:32:39,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:40,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:32:41,134 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2019-01-12 04:32:41,353 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-01-12 04:32:41,546 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2019-01-12 04:32:41,773 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-01-12 04:32:42,017 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-01-12 04:32:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4899 backedges. 3379 proven. 492 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-01-12 04:32:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:32:49,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 24 [2019-01-12 04:32:49,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 04:32:49,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 04:32:49,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2019-01-12 04:32:49,114 INFO L87 Difference]: Start difference. First operand 22981 states and 23646 transitions. Second operand 24 states. [2019-01-12 04:32:54,659 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-12 04:33:00,510 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-01-12 04:33:01,758 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-12 04:33:06,758 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-01-12 04:33:07,508 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-12 04:33:08,893 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-01-12 04:33:15,567 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-01-12 04:33:16,929 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-12 04:33:17,092 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-01-12 04:33:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:33:18,099 INFO L93 Difference]: Finished difference Result 51675 states and 53139 transitions. [2019-01-12 04:33:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 04:33:18,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1696 [2019-01-12 04:33:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:33:18,103 INFO L225 Difference]: With dead ends: 51675 [2019-01-12 04:33:18,103 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:33:18,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1755 GetRequests, 1707 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=710, Invalid=1642, Unknown=0, NotChecked=0, Total=2352 [2019-01-12 04:33:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:33:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:33:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:33:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:33:18,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1696 [2019-01-12 04:33:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:33:18,128 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:33:18,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 04:33:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:33:18,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:33:18,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:33:18,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:18,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:18,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:18,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:18,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:19,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:20,367 WARN L181 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 805 DAG size of output: 678 [2019-01-12 04:33:20,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:20,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:20,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:20,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:20,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:21,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,159 WARN L181 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 805 DAG size of output: 678 [2019-01-12 04:33:22,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:33:22,730 WARN L181 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 492 DAG size of output: 436 [2019-01-12 04:33:33,261 WARN L181 SmtUtils]: Spent 10.53 s on a formula simplification. DAG size of input: 659 DAG size of output: 137 [2019-01-12 04:33:44,461 WARN L181 SmtUtils]: Spent 11.19 s on a formula simplification. DAG size of input: 659 DAG size of output: 137 [2019-01-12 04:33:49,975 WARN L181 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 424 DAG size of output: 105 [2019-01-12 04:33:49,979 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,979 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,979 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,979 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,979 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,980 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,981 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,982 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,983 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,984 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:33:49,985 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,986 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,987 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,988 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,989 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:33:49,990 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,990 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,991 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,992 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:33:49,993 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,994 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,995 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,996 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:33:49,997 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:33:49,998 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:33:49,999 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,000 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,000 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,000 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse18 (= ~a2~0 4)) (.cse21 (+ ~a4~0 86)) (.cse6 (+ ~a29~0 144)) (.cse23 (+ ~a0~0 147))) (let ((.cse19 (+ ~a4~0 42)) (.cse13 (= ~a2~0 1)) (.cse11 (<= .cse23 0)) (.cse12 (not (= 1 ~a2~0))) (.cse14 (< 0 .cse23)) (.cse20 (< 0 .cse6)) (.cse22 (<= .cse21 0)) (.cse8 (not .cse18))) (let ((.cse2 (or (= 4 ULTIMATE.start_calculate_output2_~input) (= 3 ULTIMATE.start_calculate_output2_~input) (= 5 ULTIMATE.start_calculate_output2_~input) (= 1 ULTIMATE.start_calculate_output2_~input) (= 6 ULTIMATE.start_calculate_output2_~input) (= 2 ULTIMATE.start_calculate_output2_~input))) (.cse4 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input))) (.cse5 (< 0 (+ ~a29~0 16))) (.cse15 (= ~a2~0 3)) (.cse10 (and .cse22 .cse8)) (.cse1 (and .cse12 (or .cse14 .cse20) .cse22)) (.cse16 (or .cse11 .cse20)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse7 (and .cse22 .cse13)) (.cse3 (<= .cse19 0)) (.cse17 (<= ~a29~0 43)) (.cse9 (<= 0 (+ ~a29~0 143)))) (or (and .cse0 .cse1) (and .cse2 .cse3 (<= (+ ~a0~0 300073) 0) .cse4 .cse5) (and (<= .cse6 0) .cse7 (<= (+ ~a0~0 61) 0)) (and .cse3 .cse8 .cse0 .cse9) (and .cse2 .cse0 (<= 280404 ~a29~0) .cse3 .cse4) (and .cse10 (= 2 ~a2~0)) (and .cse8 .cse11 .cse12 .cse9) (and .cse3 .cse13 .cse0 .cse14) (and (and .cse10 .cse12) .cse9) (and .cse15 .cse10) (and .cse2 .cse0 .cse3 .cse16 .cse4 .cse17 (or .cse5 .cse14)) (and .cse3 (and .cse0 .cse15)) (and .cse0 .cse10) (and .cse1 .cse18 .cse17) (and .cse8 .cse0 .cse3 .cse14 (<= 0 (+ ~a29~0 300071))) (and .cse0 .cse3 .cse16 (= ~a2~0 2)) (and .cse0 .cse18 .cse14 (< 0 .cse19) .cse9) (and (and .cse7 .cse17 .cse20) (<= (+ ~a0~0 44) 0)) (and .cse3 .cse13 (< 0 .cse21) .cse17 .cse9))))) [2019-01-12 04:33:50,000 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:33:50,001 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:33:50,002 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,003 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,004 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse11 (= ~a2~0 4)) (.cse29 (+ ~a4~0 86))) (let ((.cse15 (+ ~a29~0 144)) (.cse32 (+ ~a0~0 147)) (.cse31 (<= .cse29 0)) (.cse17 (not .cse11))) (let ((.cse4 (and .cse31 .cse17)) (.cse19 (+ ~a4~0 42)) (.cse25 (+ ~a29~0 16)) (.cse23 (= 2 ULTIMATE.start_calculate_output_~input)) (.cse21 (= 4 ULTIMATE.start_calculate_output_~input)) (.cse24 (= 3 ULTIMATE.start_calculate_output_~input)) (.cse22 (= 6 ULTIMATE.start_calculate_output_~input)) (.cse28 (= 1 ULTIMATE.start_calculate_output_~input)) (.cse27 (= 5 ULTIMATE.start_calculate_output_~input)) (.cse12 (<= .cse32 0)) (.cse9 (< 0 .cse32)) (.cse30 (< 0 .cse15)) (.cse18 (not (= 1 ~a2~0))) (.cse8 (= ~a2~0 1))) (let ((.cse2 (and .cse31 .cse8)) (.cse5 (= ~a2~0 3)) (.cse10 (and (and (or .cse9 .cse30) .cse31) .cse18)) (.cse1 (<= (+ ~a0~0 98) 0)) (.cse14 (or .cse12 .cse30)) (.cse7 (or .cse23 .cse21 .cse24 .cse22 .cse28 .cse27)) (.cse6 (< 0 .cse25)) (.cse0 (<= .cse19 0)) (.cse20 (< 0 .cse29)) (.cse3 (<= ~a29~0 43)) (.cse16 (and .cse4 .cse18)) (.cse13 (<= 0 (+ ~a29~0 143)))) (or (and .cse0 .cse1 (<= 280404 ~a29~0)) (and (and .cse2 .cse3) (<= (+ ~a0~0 44) 0)) (and .cse4 .cse5) (and .cse6 .cse0 .cse7 (<= (+ ~a0~0 300073) 0)) (and .cse0 (and .cse1 .cse8 .cse9)) (and (and .cse10 .cse3) .cse11) (and .cse4 (= 2 ~a2~0)) (and .cse0 (<= ~a2~0 2) .cse12 .cse13) (and (or (= 4 ULTIMATE.start_calculate_output2_~input) (= 3 ULTIMATE.start_calculate_output2_~input) (= 5 ULTIMATE.start_calculate_output2_~input) (= 1 ULTIMATE.start_calculate_output2_~input) (= 6 ULTIMATE.start_calculate_output2_~input) (= 2 ULTIMATE.start_calculate_output2_~input)) .cse0 .cse1 .cse7 .cse3 .cse6) (and .cse0 (and .cse1 .cse14 (= ~a2~0 2))) (and .cse2 (<= .cse15 0)) (and .cse0 (and .cse1 .cse5)) (and .cse1 .cse16) (and (and (and .cse17 .cse18) .cse13) .cse12) (and .cse17 .cse1 .cse0 .cse9 (<= 0 (+ ~a29~0 300071))) (and .cse1 .cse10) (and .cse1 .cse11 .cse9 (< 0 .cse19) .cse13) (and .cse1 .cse14 .cse20 .cse3 (or .cse6 .cse9 (not .cse21)) (or (not .cse22) .cse6 .cse9) .cse0 .cse7 (or .cse6 .cse9 (not .cse23)) .cse11 (or (not .cse24) (<= .cse25 0)) (exists ((v_prenex_7 Int)) (let ((.cse26 (mod (+ v_prenex_7 17705) 299928))) (and (<= .cse26 (+ ~a29~0 599999)) (< (+ v_prenex_7 317633) 0) (not (= .cse26 0))))) (or (not .cse27) .cse6 .cse9) (or .cse6 .cse9 (not .cse28))) (and .cse0 .cse8 .cse20 .cse3 .cse13) (and .cse16 .cse13)))))) [2019-01-12 04:33:50,004 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,004 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:33:50,004 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:33:50,004 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,004 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,005 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,006 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,007 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:33:50,008 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:33:50,009 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,010 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse11 (= ~a2~0 4)) (.cse29 (+ ~a4~0 86))) (let ((.cse15 (+ ~a29~0 144)) (.cse32 (+ ~a0~0 147)) (.cse31 (<= .cse29 0)) (.cse17 (not .cse11))) (let ((.cse4 (and .cse31 .cse17)) (.cse19 (+ ~a4~0 42)) (.cse25 (+ ~a29~0 16)) (.cse23 (= 2 ULTIMATE.start_calculate_output_~input)) (.cse21 (= 4 ULTIMATE.start_calculate_output_~input)) (.cse24 (= 3 ULTIMATE.start_calculate_output_~input)) (.cse22 (= 6 ULTIMATE.start_calculate_output_~input)) (.cse28 (= 1 ULTIMATE.start_calculate_output_~input)) (.cse27 (= 5 ULTIMATE.start_calculate_output_~input)) (.cse12 (<= .cse32 0)) (.cse9 (< 0 .cse32)) (.cse30 (< 0 .cse15)) (.cse18 (not (= 1 ~a2~0))) (.cse8 (= ~a2~0 1))) (let ((.cse2 (and .cse31 .cse8)) (.cse5 (= ~a2~0 3)) (.cse10 (and (and (or .cse9 .cse30) .cse31) .cse18)) (.cse1 (<= (+ ~a0~0 98) 0)) (.cse14 (or .cse12 .cse30)) (.cse7 (or .cse23 .cse21 .cse24 .cse22 .cse28 .cse27)) (.cse6 (< 0 .cse25)) (.cse0 (<= .cse19 0)) (.cse20 (< 0 .cse29)) (.cse3 (<= ~a29~0 43)) (.cse16 (and .cse4 .cse18)) (.cse13 (<= 0 (+ ~a29~0 143)))) (or (and .cse0 .cse1 (<= 280404 ~a29~0)) (and (and .cse2 .cse3) (<= (+ ~a0~0 44) 0)) (and .cse4 .cse5) (and .cse6 .cse0 .cse7 (<= (+ ~a0~0 300073) 0)) (and .cse0 (and .cse1 .cse8 .cse9)) (and (and .cse10 .cse3) .cse11) (and .cse4 (= 2 ~a2~0)) (and .cse0 (<= ~a2~0 2) .cse12 .cse13) (and (or (= 4 ULTIMATE.start_calculate_output2_~input) (= 3 ULTIMATE.start_calculate_output2_~input) (= 5 ULTIMATE.start_calculate_output2_~input) (= 1 ULTIMATE.start_calculate_output2_~input) (= 6 ULTIMATE.start_calculate_output2_~input) (= 2 ULTIMATE.start_calculate_output2_~input)) .cse0 .cse1 .cse7 .cse3 .cse6) (and .cse0 (and .cse1 .cse14 (= ~a2~0 2))) (and .cse2 (<= .cse15 0)) (and .cse0 (and .cse1 .cse5)) (and .cse1 .cse16) (and (and (and .cse17 .cse18) .cse13) .cse12) (and .cse17 .cse1 .cse0 .cse9 (<= 0 (+ ~a29~0 300071))) (and .cse1 .cse10) (and .cse1 .cse11 .cse9 (< 0 .cse19) .cse13) (and .cse1 .cse14 .cse20 .cse3 (or .cse6 .cse9 (not .cse21)) (or (not .cse22) .cse6 .cse9) .cse0 .cse7 (or .cse6 .cse9 (not .cse23)) .cse11 (or (not .cse24) (<= .cse25 0)) (exists ((v_prenex_7 Int)) (let ((.cse26 (mod (+ v_prenex_7 17705) 299928))) (and (<= .cse26 (+ ~a29~0 599999)) (< (+ v_prenex_7 317633) 0) (not (= .cse26 0))))) (or (not .cse27) .cse6 .cse9) (or .cse6 .cse9 (not .cse28))) (and .cse0 .cse8 .cse20 .cse3 .cse13) (and .cse16 .cse13)))))) [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:33:50,011 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,012 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,013 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:33:50,014 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:33:50,015 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,016 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,017 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:33:50,018 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:33:50,019 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,019 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,019 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:33:50,019 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:33:50,019 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:33:50,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,044 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,045 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,056 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,057 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:33:50 BoogieIcfgContainer [2019-01-12 04:33:50,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:33:50,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:33:50,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:33:50,074 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:33:50,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:30:20" (3/4) ... [2019-01-12 04:33:50,078 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:33:50,128 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:33:50,132 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:33:50,187 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 98 <= 0) && 280404 <= a29) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (((0 < a29 + 16 && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a0 + 300073 <= 0)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2)) && a29 <= 43) && a2 == 4)) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || (((a4 + 42 <= 0 && a2 <= 2) && a0 + 147 <= 0) && 0 <= a29 + 143)) || ((((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a4 + 42 <= 0) && a0 + 98 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a29 <= 43) && 0 < a29 + 16)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && a2 == 2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2))) || (((!(a2 == 4) && !(1 == a2)) && 0 <= a29 + 143) && a0 + 147 <= 0)) || ((((!(a2 == 4) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 300071)) || (a0 + 98 <= 0 && ((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2))) || ((((a0 + 98 <= 0 && a2 == 4) && 0 < a0 + 147) && 0 < a4 + 42) && 0 <= a29 + 143)) || (((((((((((((a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && 0 < a4 + 86) && a29 <= 43) && ((0 < a29 + 16 || 0 < a0 + 147) || !(4 == input))) && ((!(6 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(2 == input))) && a2 == 4) && (!(3 == input) || a29 + 16 <= 0)) && (\exists v_prenex_7 : int :: ((v_prenex_7 + 17705) % 299928 <= a29 + 599999 && v_prenex_7 + 317633 < 0) && !((v_prenex_7 + 17705) % 299928 == 0))) && ((!(5 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(1 == input)))) || ((((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43) && 0 <= a29 + 143)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 <= a29 + 143) [2019-01-12 04:33:50,191 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 98 <= 0) && 280404 <= a29) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (((0 < a29 + 16 && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a0 + 300073 <= 0)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2)) && a29 <= 43) && a2 == 4)) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || (((a4 + 42 <= 0 && a2 <= 2) && a0 + 147 <= 0) && 0 <= a29 + 143)) || ((((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a4 + 42 <= 0) && a0 + 98 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a29 <= 43) && 0 < a29 + 16)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && a2 == 2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2))) || (((!(a2 == 4) && !(1 == a2)) && 0 <= a29 + 143) && a0 + 147 <= 0)) || ((((!(a2 == 4) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 300071)) || (a0 + 98 <= 0 && ((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2))) || ((((a0 + 98 <= 0 && a2 == 4) && 0 < a0 + 147) && 0 < a4 + 42) && 0 <= a29 + 143)) || (((((((((((((a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && 0 < a4 + 86) && a29 <= 43) && ((0 < a29 + 16 || 0 < a0 + 147) || !(4 == input))) && ((!(6 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(2 == input))) && a2 == 4) && (!(3 == input) || a29 + 16 <= 0)) && (\exists v_prenex_7 : int :: ((v_prenex_7 + 17705) % 299928 <= a29 + 599999 && v_prenex_7 + 317633 < 0) && !((v_prenex_7 + 17705) % 299928 == 0))) && ((!(5 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(1 == input)))) || ((((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43) && 0 <= a29 + 143)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 <= a29 + 143) [2019-01-12 04:33:50,450 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:33:50,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:33:50,451 INFO L168 Benchmark]: Toolchain (without parser) took 218934.17 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 945.9 MB in the beginning and 1.6 GB in the end (delta: -641.0 MB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,453 INFO L168 Benchmark]: CDTParser took 0.17 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 04:33:50,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1503.16 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 849.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 392.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -259.4 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,454 INFO L168 Benchmark]: Boogie Preprocessor took 294.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,455 INFO L168 Benchmark]: RCFGBuilder took 6385.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.6 MB). Peak memory consumption was 295.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,457 INFO L168 Benchmark]: TraceAbstraction took 209970.86 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: -477.3 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,457 INFO L168 Benchmark]: Witness Printer took 381.93 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 81.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. [2019-01-12 04:33:50,462 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1503.16 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 849.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 392.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -259.4 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 294.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6385.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 94.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.6 MB). Peak memory consumption was 295.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 209970.86 ms. Allocated memory was 1.3 GB in the beginning and 5.0 GB in the end (delta: 3.7 GB). Free memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: -477.3 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 381.93 ms. Allocated memory is still 5.0 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 81.1 MB). Peak memory consumption was 81.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 172]: 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: 1766]: Loop Invariant [2019-01-12 04:33:50,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 98 <= 0) && 280404 <= a29) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (((0 < a29 + 16 && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a0 + 300073 <= 0)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2)) && a29 <= 43) && a2 == 4)) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || (((a4 + 42 <= 0 && a2 <= 2) && a0 + 147 <= 0) && 0 <= a29 + 143)) || ((((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a4 + 42 <= 0) && a0 + 98 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a29 <= 43) && 0 < a29 + 16)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && a2 == 2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2))) || (((!(a2 == 4) && !(1 == a2)) && 0 <= a29 + 143) && a0 + 147 <= 0)) || ((((!(a2 == 4) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 300071)) || (a0 + 98 <= 0 && ((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2))) || ((((a0 + 98 <= 0 && a2 == 4) && 0 < a0 + 147) && 0 < a4 + 42) && 0 <= a29 + 143)) || (((((((((((((a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && 0 < a4 + 86) && a29 <= 43) && ((0 < a29 + 16 || 0 < a0 + 147) || !(4 == input))) && ((!(6 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(2 == input))) && a2 == 4) && (!(3 == input) || a29 + 16 <= 0)) && (\exists v_prenex_7 : int :: ((v_prenex_7 + 17705) % 299928 <= a29 + 599999 && v_prenex_7 + 317633 < 0) && !((v_prenex_7 + 17705) % 299928 == 0))) && ((!(5 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(1 == input)))) || ((((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43) && 0 <= a29 + 143)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 <= a29 + 143) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:33:50,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,488 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2019-01-12 04:33:50,489 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a4 + 42 <= 0 && a0 + 98 <= 0) && 280404 <= a29) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 44 <= 0)) || ((a4 + 86 <= 0 && !(a2 == 4)) && a2 == 3)) || (((0 < a29 + 16 && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a0 + 300073 <= 0)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2)) && a29 <= 43) && a2 == 4)) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || (((a4 + 42 <= 0 && a2 <= 2) && a0 + 147 <= 0) && 0 <= a29 + 143)) || ((((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a4 + 42 <= 0) && a0 + 98 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a29 <= 43) && 0 < a29 + 16)) || (a4 + 42 <= 0 && (a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && a2 == 2)) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || (a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == 3)) || (a0 + 98 <= 0 && (a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2))) || (((!(a2 == 4) && !(1 == a2)) && 0 <= a29 + 143) && a0 + 147 <= 0)) || ((((!(a2 == 4) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 300071)) || (a0 + 98 <= 0 && ((0 < a0 + 147 || 0 < a29 + 144) && a4 + 86 <= 0) && !(1 == a2))) || ((((a0 + 98 <= 0 && a2 == 4) && 0 < a0 + 147) && 0 < a4 + 42) && 0 <= a29 + 143)) || (((((((((((((a0 + 98 <= 0 && (a0 + 147 <= 0 || 0 < a29 + 144)) && 0 < a4 + 86) && a29 <= 43) && ((0 < a29 + 16 || 0 < a0 + 147) || !(4 == input))) && ((!(6 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(2 == input))) && a2 == 4) && (!(3 == input) || a29 + 16 <= 0)) && (\exists v_prenex_7 : int :: ((v_prenex_7 + 17705) % 299928 <= a29 + 599999 && v_prenex_7 + 317633 < 0) && !((v_prenex_7 + 17705) % 299928 == 0))) && ((!(5 == input) || 0 < a29 + 16) || 0 < a0 + 147)) && ((0 < a29 + 16 || 0 < a0 + 147) || !(1 == input)))) || ((((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43) && 0 <= a29 + 143)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 <= a29 + 143) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((a0 + 98 <= 0 && (!(1 == a2) && (0 < a0 + 147 || 0 < a29 + 144)) && a4 + 86 <= 0) || (((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a4 + 42 <= 0) && a0 + 300073 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && 0 < a29 + 16)) || ((a29 + 144 <= 0 && a4 + 86 <= 0 && a2 == 1) && a0 + 61 <= 0)) || (((a4 + 42 <= 0 && !(a2 == 4)) && a0 + 98 <= 0) && 0 <= a29 + 143)) || (((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a0 + 98 <= 0) && 280404 <= a29) && a4 + 42 <= 0) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input))) || ((a4 + 86 <= 0 && !(a2 == 4)) && 2 == a2)) || (((!(a2 == 4) && a0 + 147 <= 0) && !(1 == a2)) && 0 <= a29 + 143)) || (((a4 + 42 <= 0 && a2 == 1) && a0 + 98 <= 0) && 0 < a0 + 147)) || (((a4 + 86 <= 0 && !(a2 == 4)) && !(1 == a2)) && 0 <= a29 + 143)) || (a2 == 3 && a4 + 86 <= 0 && !(a2 == 4))) || (((((((((((4 == input || 3 == input) || 5 == input) || 1 == input) || 6 == input) || 2 == input) && a0 + 98 <= 0) && a4 + 42 <= 0) && (a0 + 147 <= 0 || 0 < a29 + 144)) && (((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input)) && a29 <= 43) && (0 < a29 + 16 || 0 < a0 + 147))) || (a4 + 42 <= 0 && a0 + 98 <= 0 && a2 == 3)) || (a0 + 98 <= 0 && a4 + 86 <= 0 && !(a2 == 4))) || ((((!(1 == a2) && (0 < a0 + 147 || 0 < a29 + 144)) && a4 + 86 <= 0) && a2 == 4) && a29 <= 43)) || ((((!(a2 == 4) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a0 + 147) && 0 <= a29 + 300071)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && (a0 + 147 <= 0 || 0 < a29 + 144)) && a2 == 2)) || ((((a0 + 98 <= 0 && a2 == 4) && 0 < a0 + 147) && 0 < a4 + 42) && 0 <= a29 + 143)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144) && a0 + 44 <= 0)) || ((((a4 + 42 <= 0 && a2 == 1) && 0 < a4 + 86) && a29 <= 43) && 0 <= a29 + 143) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 209.8s OverallTime, 13 OverallIterations, 9 TraceHistogramMax, 132.3s AutomataDifference, 0.0s DeadEndRemovalTime, 31.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1917 SDtfs, 33630 SDslu, 1890 SDs, 0 SdLazy, 75742 SolverSat, 7539 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 98.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6951 GetRequests, 6749 SyntacticMatches, 20 SemanticMatches, 182 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22981occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 25372 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 372 NumberOfFragments, 1719 HoareAnnotationTreeSize, 4 FomulaSimplifications, 378080 FormulaSimplificationTreeSizeReduction, 4.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 384324 FormulaSimplificationTreeSizeReductionInter, 27.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 16583 NumberOfCodeBlocks, 16583 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 16563 ConstructedInterpolants, 311 QuantifiedInterpolants, 138164504 SizeOfPredicates, 16 NumberOfNonLiveVariables, 7702 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 28944/31830 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...