./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label43_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_label43_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 65cedfd4cd477eae3251a2c0e08e4db2fd40d0c9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:36:07,372 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:36:07,374 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:36:07,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:36:07,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:36:07,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:36:07,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:36:07,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:36:07,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:36:07,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:36:07,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:36:07,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:36:07,399 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:36:07,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:36:07,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:36:07,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:36:07,403 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:36:07,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:36:07,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:36:07,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:36:07,410 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:36:07,411 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:36:07,414 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:36:07,414 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:36:07,414 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:36:07,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:36:07,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:36:07,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:36:07,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:36:07,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:36:07,420 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:36:07,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:36:07,421 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:36:07,421 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:36:07,422 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:36:07,423 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:36:07,423 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:36:07,454 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:36:07,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:36:07,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:36:07,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:36:07,456 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:36:07,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:36:07,457 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:36:07,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:36:07,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:36:07,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:36:07,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:36:07,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:36:07,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:36:07,459 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:36:07,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:36:07,459 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:36:07,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:36:07,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:36:07,461 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:36:07,461 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:36:07,461 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:36:07,461 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:36:07,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:36:07,462 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:36:07,462 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:36:07,462 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:36:07,462 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:36:07,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:36:07,463 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 -> 65cedfd4cd477eae3251a2c0e08e4db2fd40d0c9 [2019-01-12 04:36:07,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:36:07,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:36:07,517 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:36:07,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:36:07,519 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:36:07,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label43_true-unreach-call.c [2019-01-12 04:36:07,587 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cad7323/ae2c7e4c0f2c404dab0d9994d9e9bf5b/FLAGb9abc25f5 [2019-01-12 04:36:08,243 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:36:08,244 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label43_true-unreach-call.c [2019-01-12 04:36:08,269 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cad7323/ae2c7e4c0f2c404dab0d9994d9e9bf5b/FLAGb9abc25f5 [2019-01-12 04:36:08,388 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28cad7323/ae2c7e4c0f2c404dab0d9994d9e9bf5b [2019-01-12 04:36:08,392 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:36:08,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:36:08,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:36:08,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:36:08,398 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:36:08,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:36:08" (1/1) ... [2019-01-12 04:36:08,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37392bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:08, skipping insertion in model container [2019-01-12 04:36:08,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:36:08" (1/1) ... [2019-01-12 04:36:08,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:36:08,512 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:36:09,450 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:36:09,456 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:36:09,849 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:36:09,871 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:36:09,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09 WrapperNode [2019-01-12 04:36:09,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:36:09,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:36:09,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:36:09,876 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:36:09,889 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:36:09" (1/1) ... [2019-01-12 04:36:10,098 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:36:09" (1/1) ... [2019-01-12 04:36:10,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:36:10,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:36:10,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:36:10,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:36:10,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (1/1) ... [2019-01-12 04:36:10,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:36:10,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:36:10,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:36:10,531 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:36:10,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (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:36:10,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:36:10,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:36:16,826 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:36:16,826 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:36:16,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:16 BoogieIcfgContainer [2019-01-12 04:36:16,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:36:16,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:36:16,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:36:16,833 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:36:16,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:36:08" (1/3) ... [2019-01-12 04:36:16,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5482cd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:36:16, skipping insertion in model container [2019-01-12 04:36:16,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:36:09" (2/3) ... [2019-01-12 04:36:16,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5482cd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:36:16, skipping insertion in model container [2019-01-12 04:36:16,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:16" (3/3) ... [2019-01-12 04:36:16,838 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label43_true-unreach-call.c [2019-01-12 04:36:16,849 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:36:16,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:36:16,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:36:16,934 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:36:16,934 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:36:16,935 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:36:16,935 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:36:16,935 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:36:16,935 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:36:16,935 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:36:16,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:36:16,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:36:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:36:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 04:36:16,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:16,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:36:16,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:16,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-01-12 04:36:16,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:16,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:17,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:17,465 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:36:17,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:17,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:17,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:17,492 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:36:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:23,383 INFO L93 Difference]: Finished difference Result 1469 states and 2719 transitions. [2019-01-12 04:36:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:23,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-01-12 04:36:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:23,411 INFO L225 Difference]: With dead ends: 1469 [2019-01-12 04:36:23,412 INFO L226 Difference]: Without dead ends: 978 [2019-01-12 04:36:23,418 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:36:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-01-12 04:36:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-01-12 04:36:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-01-12 04:36:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1489 transitions. [2019-01-12 04:36:23,519 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1489 transitions. Word has length 58 [2019-01-12 04:36:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:23,520 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1489 transitions. [2019-01-12 04:36:23,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1489 transitions. [2019-01-12 04:36:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-12 04:36:23,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:23,529 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:23,530 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -327159309, now seen corresponding path program 1 times [2019-01-12 04:36:23,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:23,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:23,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:23,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:23,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:23,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:23,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:23,906 INFO L87 Difference]: Start difference. First operand 974 states and 1489 transitions. Second operand 4 states. [2019-01-12 04:36:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:29,323 INFO L93 Difference]: Finished difference Result 3748 states and 5754 transitions. [2019-01-12 04:36:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:29,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-01-12 04:36:29,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:29,409 INFO L225 Difference]: With dead ends: 3748 [2019-01-12 04:36:29,409 INFO L226 Difference]: Without dead ends: 2776 [2019-01-12 04:36:29,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-01-12 04:36:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1873. [2019-01-12 04:36:29,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-01-12 04:36:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-01-12 04:36:29,501 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 177 [2019-01-12 04:36:29,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:29,502 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-01-12 04:36:29,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-01-12 04:36:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-01-12 04:36:29,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:29,523 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,523 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 746152796, now seen corresponding path program 1 times [2019-01-12 04:36:29,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-12 04:36:30,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:30,084 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:36:30,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:30,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:30,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:36:30,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:30,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:30,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:30,388 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 4 states. [2019-01-12 04:36:36,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:36,441 INFO L93 Difference]: Finished difference Result 5542 states and 7245 transitions. [2019-01-12 04:36:36,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:36,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-01-12 04:36:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:36,461 INFO L225 Difference]: With dead ends: 5542 [2019-01-12 04:36:36,462 INFO L226 Difference]: Without dead ends: 3671 [2019-01-12 04:36:36,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 328 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:36:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-01-12 04:36:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1873. [2019-01-12 04:36:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-01-12 04:36:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-01-12 04:36:36,525 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 328 [2019-01-12 04:36:36,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:36,526 INFO L480 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-01-12 04:36:36,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-01-12 04:36:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-12 04:36:36,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:36,534 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-01-12 04:36:36,534 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:36,534 INFO L82 PathProgramCache]: Analyzing trace with hash -319239402, now seen corresponding path program 1 times [2019-01-12 04:36:36,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:36,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:36,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:37,138 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:36:37,505 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:36:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-12 04:36:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:37,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:37,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:36:37,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:36:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:37,863 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 5 states. [2019-01-12 04:36:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:42,837 INFO L93 Difference]: Finished difference Result 4643 states and 5995 transitions. [2019-01-12 04:36:42,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:42,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 335 [2019-01-12 04:36:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:42,858 INFO L225 Difference]: With dead ends: 4643 [2019-01-12 04:36:42,859 INFO L226 Difference]: Without dead ends: 2772 [2019-01-12 04:36:42,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-01-12 04:36:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2472. [2019-01-12 04:36:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-01-12 04:36:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3150 transitions. [2019-01-12 04:36:42,909 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3150 transitions. Word has length 335 [2019-01-12 04:36:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:42,910 INFO L480 AbstractCegarLoop]: Abstraction has 2472 states and 3150 transitions. [2019-01-12 04:36:42,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:36:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3150 transitions. [2019-01-12 04:36:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-01-12 04:36:42,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:42,918 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-01-12 04:36:42,920 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:42,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:42,920 INFO L82 PathProgramCache]: Analyzing trace with hash 989060, now seen corresponding path program 1 times [2019-01-12 04:36:42,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:43,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:43,829 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:36:43,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:43,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:36:44,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:36:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:36:44,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:36:44,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:36:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:36:44,069 INFO L87 Difference]: Start difference. First operand 2472 states and 3150 transitions. Second operand 9 states. [2019-01-12 04:36:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:53,515 INFO L93 Difference]: Finished difference Result 6484 states and 8162 transitions. [2019-01-12 04:36:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:36:53,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 409 [2019-01-12 04:36:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:53,535 INFO L225 Difference]: With dead ends: 6484 [2019-01-12 04:36:53,535 INFO L226 Difference]: Without dead ends: 4014 [2019-01-12 04:36:53,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 412 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:36:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2019-01-12 04:36:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3374. [2019-01-12 04:36:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3374 states. [2019-01-12 04:36:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 4043 transitions. [2019-01-12 04:36:53,615 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 4043 transitions. Word has length 409 [2019-01-12 04:36:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:53,615 INFO L480 AbstractCegarLoop]: Abstraction has 3374 states and 4043 transitions. [2019-01-12 04:36:53,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:36:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 4043 transitions. [2019-01-12 04:36:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-01-12 04:36:53,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:53,627 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:36:53,627 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:53,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1041366877, now seen corresponding path program 1 times [2019-01-12 04:36:53,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:53,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:53,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:53,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:36:54,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:54,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:54,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:54,208 INFO L87 Difference]: Start difference. First operand 3374 states and 4043 transitions. Second operand 4 states. [2019-01-12 04:36:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:57,356 INFO L93 Difference]: Finished difference Result 7347 states and 8879 transitions. [2019-01-12 04:36:57,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:57,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-01-12 04:36:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:57,373 INFO L225 Difference]: With dead ends: 7347 [2019-01-12 04:36:57,374 INFO L226 Difference]: Without dead ends: 3975 [2019-01-12 04:36:57,379 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:36:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-01-12 04:36:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3973. [2019-01-12 04:36:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3973 states. [2019-01-12 04:36:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3973 states to 3973 states and 4669 transitions. [2019-01-12 04:36:57,457 INFO L78 Accepts]: Start accepts. Automaton has 3973 states and 4669 transitions. Word has length 427 [2019-01-12 04:36:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:57,458 INFO L480 AbstractCegarLoop]: Abstraction has 3973 states and 4669 transitions. [2019-01-12 04:36:57,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3973 states and 4669 transitions. [2019-01-12 04:36:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-01-12 04:36:57,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:57,472 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:36:57,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:57,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:57,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1022697565, now seen corresponding path program 1 times [2019-01-12 04:36:57,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:57,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:57,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:57,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:57,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:36:57,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:57,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:57,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:57,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:57,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:57,930 INFO L87 Difference]: Start difference. First operand 3973 states and 4669 transitions. Second operand 3 states. [2019-01-12 04:37:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:00,217 INFO L93 Difference]: Finished difference Result 9737 states and 11652 transitions. [2019-01-12 04:37:00,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:00,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2019-01-12 04:37:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:00,249 INFO L225 Difference]: With dead ends: 9737 [2019-01-12 04:37:00,249 INFO L226 Difference]: Without dead ends: 5766 [2019-01-12 04:37:00,255 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:37:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-01-12 04:37:00,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5766. [2019-01-12 04:37:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5766 states. [2019-01-12 04:37:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5766 states to 5766 states and 6845 transitions. [2019-01-12 04:37:00,390 INFO L78 Accepts]: Start accepts. Automaton has 5766 states and 6845 transitions. Word has length 522 [2019-01-12 04:37:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:00,394 INFO L480 AbstractCegarLoop]: Abstraction has 5766 states and 6845 transitions. [2019-01-12 04:37:00,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5766 states and 6845 transitions. [2019-01-12 04:37:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-01-12 04:37:00,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:00,406 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,406 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:00,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:00,407 INFO L82 PathProgramCache]: Analyzing trace with hash -935582361, now seen corresponding path program 1 times [2019-01-12 04:37:00,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:00,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:00,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:01,251 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:37:01,600 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:37:02,081 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 14 [2019-01-12 04:37:02,718 WARN L181 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-12 04:37:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 644 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-12 04:37:03,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:03,381 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:37:03,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:03,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-01-12 04:37:04,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:37:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 04:37:04,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:37:04,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:37:04,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:37:04,409 INFO L87 Difference]: Start difference. First operand 5766 states and 6845 transitions. Second operand 9 states. [2019-01-12 04:37:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:12,683 INFO L93 Difference]: Finished difference Result 16170 states and 18948 transitions. [2019-01-12 04:37:12,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 04:37:12,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 613 [2019-01-12 04:37:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:12,717 INFO L225 Difference]: With dead ends: 16170 [2019-01-12 04:37:12,717 INFO L226 Difference]: Without dead ends: 7559 [2019-01-12 04:37:12,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:37:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7559 states. [2019-01-12 04:37:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7559 to 5465. [2019-01-12 04:37:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5465 states. [2019-01-12 04:37:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5465 states to 5465 states and 5917 transitions. [2019-01-12 04:37:12,826 INFO L78 Accepts]: Start accepts. Automaton has 5465 states and 5917 transitions. Word has length 613 [2019-01-12 04:37:12,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:12,827 INFO L480 AbstractCegarLoop]: Abstraction has 5465 states and 5917 transitions. [2019-01-12 04:37:12,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:37:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5465 states and 5917 transitions. [2019-01-12 04:37:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-01-12 04:37:12,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:12,836 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:12,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:12,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1919446783, now seen corresponding path program 1 times [2019-01-12 04:37:12,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:12,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:12,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-01-12 04:37:13,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:37:13,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:37:13,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:37:13,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:37:13,342 INFO L87 Difference]: Start difference. First operand 5465 states and 5917 transitions. Second operand 3 states. [2019-01-12 04:37:14,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:14,883 INFO L93 Difference]: Finished difference Result 10926 states and 11830 transitions. [2019-01-12 04:37:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:37:14,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 655 [2019-01-12 04:37:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:14,906 INFO L225 Difference]: With dead ends: 10926 [2019-01-12 04:37:14,906 INFO L226 Difference]: Without dead ends: 5463 [2019-01-12 04:37:14,911 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:37:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-01-12 04:37:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5463. [2019-01-12 04:37:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-01-12 04:37:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 5913 transitions. [2019-01-12 04:37:14,985 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 5913 transitions. Word has length 655 [2019-01-12 04:37:14,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:14,986 INFO L480 AbstractCegarLoop]: Abstraction has 5463 states and 5913 transitions. [2019-01-12 04:37:14,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:37:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 5913 transitions. [2019-01-12 04:37:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-01-12 04:37:14,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:14,995 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:37:14,995 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:14,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1941988686, now seen corresponding path program 1 times [2019-01-12 04:37:14,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:14,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:14,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:14,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:15,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:15,405 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:37:15,563 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 04:37:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:37:16,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:16,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:16,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:16,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:16,120 INFO L87 Difference]: Start difference. First operand 5463 states and 5913 transitions. Second operand 4 states. [2019-01-12 04:37:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:18,083 INFO L93 Difference]: Finished difference Result 11785 states and 12617 transitions. [2019-01-12 04:37:18,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:18,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 683 [2019-01-12 04:37:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:18,097 INFO L225 Difference]: With dead ends: 11785 [2019-01-12 04:37:18,097 INFO L226 Difference]: Without dead ends: 5726 [2019-01-12 04:37:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2019-01-12 04:37:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 4525. [2019-01-12 04:37:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4525 states. [2019-01-12 04:37:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4525 states to 4525 states and 4711 transitions. [2019-01-12 04:37:18,168 INFO L78 Accepts]: Start accepts. Automaton has 4525 states and 4711 transitions. Word has length 683 [2019-01-12 04:37:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:18,169 INFO L480 AbstractCegarLoop]: Abstraction has 4525 states and 4711 transitions. [2019-01-12 04:37:18,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:18,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4525 states and 4711 transitions. [2019-01-12 04:37:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2019-01-12 04:37:18,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:18,178 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:18,178 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1974678694, now seen corresponding path program 1 times [2019-01-12 04:37:18,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:18,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-01-12 04:37:18,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:18,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:18,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:18,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:18,889 INFO L87 Difference]: Start difference. First operand 4525 states and 4711 transitions. Second operand 4 states. [2019-01-12 04:37:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:21,690 INFO L93 Difference]: Finished difference Result 13539 states and 14173 transitions. [2019-01-12 04:37:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:21,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 690 [2019-01-12 04:37:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:21,708 INFO L225 Difference]: With dead ends: 13539 [2019-01-12 04:37:21,708 INFO L226 Difference]: Without dead ends: 9315 [2019-01-12 04:37:21,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:21,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9315 states. [2019-01-12 04:37:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9315 to 6320. [2019-01-12 04:37:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2019-01-12 04:37:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 6558 transitions. [2019-01-12 04:37:21,812 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 6558 transitions. Word has length 690 [2019-01-12 04:37:21,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 6320 states and 6558 transitions. [2019-01-12 04:37:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 6558 transitions. [2019-01-12 04:37:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-01-12 04:37:21,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:21,827 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,827 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash -642909024, now seen corresponding path program 1 times [2019-01-12 04:37:21,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:21,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:21,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:21,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 56 proven. 597 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-01-12 04:37:23,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:37:23,244 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:37:23,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:23,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:37:23,883 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 19 [2019-01-12 04:37:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 807 trivial. 0 not checked. [2019-01-12 04:37:24,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:37:24,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:37:24,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:37:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:37:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:37:24,726 INFO L87 Difference]: Start difference. First operand 6320 states and 6558 transitions. Second operand 7 states. [2019-01-12 04:37:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:38,227 INFO L93 Difference]: Finished difference Result 24045 states and 25074 transitions. [2019-01-12 04:37:38,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:37:38,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 780 [2019-01-12 04:37:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:38,246 INFO L225 Difference]: With dead ends: 24045 [2019-01-12 04:37:38,247 INFO L226 Difference]: Without dead ends: 17727 [2019-01-12 04:37:38,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:37:38,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17727 states. [2019-01-12 04:37:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17727 to 8723. [2019-01-12 04:37:38,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8723 states. [2019-01-12 04:37:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8723 states to 8723 states and 9121 transitions. [2019-01-12 04:37:38,428 INFO L78 Accepts]: Start accepts. Automaton has 8723 states and 9121 transitions. Word has length 780 [2019-01-12 04:37:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:38,429 INFO L480 AbstractCegarLoop]: Abstraction has 8723 states and 9121 transitions. [2019-01-12 04:37:38,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:37:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 8723 states and 9121 transitions. [2019-01-12 04:37:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2019-01-12 04:37:38,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:37:38,451 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:37:38,451 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:37:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:37:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1616422182, now seen corresponding path program 1 times [2019-01-12 04:37:38,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:37:38,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:37:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:38,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:37:38,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:37:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:37:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:37:39,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:37:39,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:37:39,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:37:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:37:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:37:39,435 INFO L87 Difference]: Start difference. First operand 8723 states and 9121 transitions. Second operand 4 states. [2019-01-12 04:37:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:37:43,523 INFO L93 Difference]: Finished difference Result 16538 states and 17303 transitions. [2019-01-12 04:37:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:37:43,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 956 [2019-01-12 04:37:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:37:43,526 INFO L225 Difference]: With dead ends: 16538 [2019-01-12 04:37:43,526 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:37:43,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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:37:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:37:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:37:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:37:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:37:43,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 956 [2019-01-12 04:37:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:37:43,543 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:37:43,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:37:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:37:43,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:37:43,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:37:43,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,913 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 241 [2019-01-12 04:37:43,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:43,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,342 WARN L181 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 241 [2019-01-12 04:37:44,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:37:44,590 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 214 [2019-01-12 04:37:48,904 WARN L181 SmtUtils]: Spent 4.31 s on a formula simplification. DAG size of input: 232 DAG size of output: 90 [2019-01-12 04:37:50,794 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 232 DAG size of output: 90 [2019-01-12 04:37:51,853 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 209 DAG size of output: 86 [2019-01-12 04:37:51,876 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,876 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,876 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,876 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,877 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:37:51,878 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,879 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,879 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,885 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,886 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,887 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,888 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,888 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,892 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,893 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:51,894 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,895 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,896 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:51,896 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,899 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 181) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,900 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,901 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,902 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:51,902 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,905 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,906 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:37:51,907 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:37:51,907 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:37:51,910 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,911 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:37:51,912 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,913 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,915 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,916 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse4 (+ ~a0~0 44)) (.cse16 (+ ~a4~0 86))) (let ((.cse11 (<= (+ ~a0~0 98) 0)) (.cse8 (<= (+ ~a4~0 42) 0)) (.cse15 (= ~a2~0 1)) (.cse14 (+ ~a0~0 61)) (.cse0 (<= .cse16 0)) (.cse3 (<= 0 .cse4)) (.cse12 (= ~a2~0 2))) (let ((.cse9 (<= (+ ~a0~0 99) 0)) (.cse13 (let ((.cse20 (not .cse12))) (or (and .cse0 .cse20) (and (< 0 .cse14) .cse0) (and .cse20 .cse3)))) (.cse10 (not (= 1 ~a2~0))) (.cse7 (and .cse11 .cse8 .cse15)) (.cse1 (<= ~a29~0 43)) (.cse2 (< 0 (+ ~a29~0 144))) (.cse6 (<= 0 (+ ~a0~0 599999))) (.cse5 (exists ((v_prenex_6 Int)) (let ((.cse18 (* 9 v_prenex_6))) (let ((.cse19 (div .cse18 10))) (let ((.cse17 (mod .cse19 29))) (and (<= .cse17 (+ ~a29~0 15)) (not (= 0 .cse17)) (= 0 (mod .cse18 10)) (< .cse19 0)))))))) (or (and (and .cse0 .cse1 .cse2) .cse3 (<= .cse4 0)) (and .cse5 .cse6 .cse7) (and .cse8 .cse9 (= ~a2~0 3)) (and .cse8 .cse9 .cse10 .cse6) (and .cse11 .cse8 .cse12) (and .cse13 (<= .cse14 0)) (and (and .cse13 .cse8) .cse10) (and (< 0 (+ ~a0~0 147)) .cse7) (and .cse8 (and .cse15 (< 0 .cse16) .cse1 .cse2) .cse6) (and (= ~a2~0 5) (and .cse11 .cse8)) (and .cse5 .cse12 .cse0))))) [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,919 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,920 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:51,920 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,922 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,923 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,924 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,924 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,927 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,927 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse15 (+ ~a4~0 86))) (let ((.cse12 (+ ~a0~0 44)) (.cse7 (= ~a2~0 2)) (.cse13 (<= .cse15 0)) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse14 (= ~a2~0 1))) (let ((.cse4 (<= (+ ~a0~0 99) 0)) (.cse2 (and .cse6 .cse3 .cse14)) (.cse9 (and .cse13 .cse14)) (.cse0 (exists ((v_prenex_6 Int)) (let ((.cse19 (* 9 v_prenex_6))) (let ((.cse20 (div .cse19 10))) (let ((.cse18 (mod .cse20 29))) (and (<= .cse18 (+ ~a29~0 15)) (not (= 0 .cse18)) (= 0 (mod .cse19 10)) (< .cse20 0))))))) (.cse10 (<= ~a29~0 43)) (.cse8 (+ ~a29~0 144)) (.cse1 (<= 0 (+ ~a0~0 599999))) (.cse5 (not (= 1 ~a2~0))) (.cse16 (+ ~a0~0 61)) (.cse17 (not .cse7)) (.cse11 (<= 0 .cse12))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= ~a2~0 3)) (and .cse3 .cse4 .cse5 .cse1) (and (< 0 (+ ~a0~0 147)) .cse2) (and .cse6 .cse3 .cse7) (and (<= .cse8 0) .cse9) (and (and .cse9 .cse10) .cse11 (<= .cse12 0)) (and (= ~a2~0 5) (and .cse6 .cse3)) (and (and .cse0 .cse13) .cse5) (and (and .cse14 (< 0 .cse15) .cse10 (< 0 .cse8)) .cse3 .cse1) (and (<= .cse16 0) (and .cse13 .cse17)) (and .cse5 (and .cse3 (or (and (< 0 .cse16) .cse13) (and .cse17 .cse11)))))))) [2019-01-12 04:37:51,927 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,927 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,928 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,929 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,930 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,930 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,933 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,934 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:37:51,935 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,936 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse15 (+ ~a4~0 86))) (let ((.cse12 (+ ~a0~0 44)) (.cse7 (= ~a2~0 2)) (.cse13 (<= .cse15 0)) (.cse6 (<= (+ ~a0~0 98) 0)) (.cse3 (<= (+ ~a4~0 42) 0)) (.cse14 (= ~a2~0 1))) (let ((.cse4 (<= (+ ~a0~0 99) 0)) (.cse2 (and .cse6 .cse3 .cse14)) (.cse9 (and .cse13 .cse14)) (.cse0 (exists ((v_prenex_6 Int)) (let ((.cse19 (* 9 v_prenex_6))) (let ((.cse20 (div .cse19 10))) (let ((.cse18 (mod .cse20 29))) (and (<= .cse18 (+ ~a29~0 15)) (not (= 0 .cse18)) (= 0 (mod .cse19 10)) (< .cse20 0))))))) (.cse10 (<= ~a29~0 43)) (.cse8 (+ ~a29~0 144)) (.cse1 (<= 0 (+ ~a0~0 599999))) (.cse5 (not (= 1 ~a2~0))) (.cse16 (+ ~a0~0 61)) (.cse17 (not .cse7)) (.cse11 (<= 0 .cse12))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= ~a2~0 3)) (and .cse3 .cse4 .cse5 .cse1) (and (< 0 (+ ~a0~0 147)) .cse2) (and .cse6 .cse3 .cse7) (and (<= .cse8 0) .cse9) (and (and .cse9 .cse10) .cse11 (<= .cse12 0)) (and (= ~a2~0 5) (and .cse6 .cse3)) (and (and .cse0 .cse13) .cse5) (and (and .cse14 (< 0 .cse15) .cse10 (< 0 .cse8)) .cse3 .cse1) (and (<= .cse16 0) (and .cse13 .cse17)) (and .cse5 (and .cse3 (or (and (< 0 .cse16) .cse13) (and .cse17 .cse11)))))))) [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:37:51,937 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:37:51,938 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,938 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:37:51,941 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,942 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,943 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,943 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:37:51,947 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,948 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:37:51,948 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,951 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,952 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:37:51,953 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,954 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,954 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:51,957 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:37:51,957 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:37:51,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,998 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:51,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,013 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,027 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,028 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,036 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,040 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:37:52 BoogieIcfgContainer [2019-01-12 04:37:52,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:37:52,053 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:37:52,053 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:37:52,053 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:37:52,054 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:36:16" (3/4) ... [2019-01-12 04:37:52,059 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:37:52,110 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:37:52,113 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:37:52,147 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || (a29 + 144 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a4 + 86 <= 0) && !(1 == a2))) || (((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 2))) || (!(1 == a2) && a4 + 42 <= 0 && ((0 < a0 + 61 && a4 + 86 <= 0) || (!(a2 == 2) && 0 <= a0 + 44))) [2019-01-12 04:37:52,151 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || (a29 + 144 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a4 + 86 <= 0) && !(1 == a2))) || (((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 2))) || (!(1 == a2) && a4 + 42 <= 0 && ((0 < a0 + 61 && a4 + 86 <= 0) || (!(a2 == 2) && 0 <= a0 + 44))) [2019-01-12 04:37:52,165 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((a4 + 86 <= 0 && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 44) && a0 + 44 <= 0) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && !(1 == a2))) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 599999)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a2 == 2) && a4 + 86 <= 0) [2019-01-12 04:37:52,424 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:37:52,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:37:52,425 INFO L168 Benchmark]: Toolchain (without parser) took 104032.44 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 947.2 MB in the beginning and 1.8 GB in the end (delta: -827.1 MB). Peak memory consumption was 786.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,426 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:37:52,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1479.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 849.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 435.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -219.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,427 INFO L168 Benchmark]: Boogie Preprocessor took 218.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,427 INFO L168 Benchmark]: RCFGBuilder took 6298.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.8 MB). Peak memory consumption was 320.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,428 INFO L168 Benchmark]: TraceAbstraction took 95220.95 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -623.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,429 INFO L168 Benchmark]: Witness Printer took 371.10 ms. Allocated memory is still 2.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:37:52,431 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1479.43 ms. Allocated memory is still 1.0 GB. Free memory was 947.2 MB in the beginning and 849.2 MB in the end (delta: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 435.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 849.2 MB in the beginning and 1.1 GB in the end (delta: -219.0 MB). Peak memory consumption was 29.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 218.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6298.06 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 118.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.8 MB). Peak memory consumption was 320.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95220.95 ms. Allocated memory was 1.3 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: -623.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 371.10 ms. Allocated memory is still 2.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 35.9 MB). Peak memory consumption was 35.9 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_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 181]: 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:37:52,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || (a29 + 144 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a4 + 86 <= 0) && !(1 == a2))) || (((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 2))) || (!(1 == a2) && a4 + 42 <= 0 && ((0 < a0 + 61 && a4 + 86 <= 0) || (!(a2 == 2) && 0 <= a0 + 44))) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:37:52,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || (a29 + 144 <= 0 && a4 + 86 <= 0 && a2 == 1)) || ((((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && 0 <= a0 + 44) && a0 + 44 <= 0)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a4 + 86 <= 0) && !(1 == a2))) || (((((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && a4 + 42 <= 0) && 0 <= a0 + 599999)) || (a0 + 61 <= 0 && a4 + 86 <= 0 && !(a2 == 2))) || (!(1 == a2) && a4 + 42 <= 0 && ((0 < a0 + 61 && a4 + 86 <= 0) || (!(a2 == 2) && 0 <= a0 + 44))) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:37:52,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,470 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2019-01-12 04:37:52,471 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((((((((((((a4 + 86 <= 0 && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 44) && a0 + 44 <= 0) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && 0 <= a0 + 599999) && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 42 <= 0 && a0 + 99 <= 0) && a2 == 3)) || (((a4 + 42 <= 0 && a0 + 99 <= 0) && !(1 == a2)) && 0 <= a0 + 599999)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 2)) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 <= a0 + 44)) && a4 + 42 <= 0) && !(1 == a2))) || (0 < a0 + 147 && (a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144) && 0 <= a0 + 599999)) || (a2 == 5 && a0 + 98 <= 0 && a4 + 42 <= 0)) || (((\exists v_prenex_6 : int :: ((9 * v_prenex_6 / 10 % 29 <= a29 + 15 && !(0 == 9 * v_prenex_6 / 10 % 29)) && 0 == 9 * v_prenex_6 % 10) && 9 * v_prenex_6 / 10 < 0) && a2 == 2) && a4 + 86 <= 0) - 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, 95.0s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 69.8s AutomataDifference, 0.0s DeadEndRemovalTime, 8.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2685 SDtfs, 11617 SDslu, 1046 SDs, 0 SdLazy, 29184 SolverSat, 4501 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2213 GetRequests, 2149 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8723occurred 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: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 18941 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 130 NumberOfFragments, 932 HoareAnnotationTreeSize, 4 FomulaSimplifications, 30162 FormulaSimplificationTreeSizeReduction, 1.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 31491 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 8763 NumberOfCodeBlocks, 8763 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 8746 ConstructedInterpolants, 56 QuantifiedInterpolants, 20145214 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2523 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 8338/9053 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...