./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem17_label27_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/Problem17_label27_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 78eabd2ee150c25691f9a7d531597623c7c366a6 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:57:54,848 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:57:54,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:57:54,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:57:54,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:57:54,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:57:54,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:57:54,867 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:57:54,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:57:54,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:57:54,870 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:57:54,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:57:54,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:57:54,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:57:54,874 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:57:54,875 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:57:54,876 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:57:54,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:57:54,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:57:54,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:57:54,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:57:54,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:57:54,888 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:57:54,888 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:57:54,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:57:54,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:57:54,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:57:54,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:57:54,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:57:54,894 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:57:54,894 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:57:54,895 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:57:54,895 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:57:54,895 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:57:54,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:57:54,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:57:54,898 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:57:54,918 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:57:54,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:57:54,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:57:54,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:57:54,919 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:57:54,920 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:57:54,920 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:57:54,921 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:57:54,922 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:57:54,922 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:57:54,922 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:57:54,922 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:57:54,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:57:54,922 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:57:54,923 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:57:54,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:57:54,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:57:54,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:57:54,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:57:54,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:57:54,925 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:57:54,925 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:57:54,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:57:54,927 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 -> 78eabd2ee150c25691f9a7d531597623c7c366a6 [2019-01-12 04:57:54,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:57:54,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:57:54,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:57:54,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:57:54,987 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:57:54,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem17_label27_true-unreach-call.c [2019-01-12 04:57:55,040 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7e72d4/8a7ca3c670ac4f808cc77b430be93505/FLAGa98ba44e4 [2019-01-12 04:57:55,697 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:57:55,698 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem17_label27_true-unreach-call.c [2019-01-12 04:57:55,722 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7e72d4/8a7ca3c670ac4f808cc77b430be93505/FLAGa98ba44e4 [2019-01-12 04:57:55,823 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a7e72d4/8a7ca3c670ac4f808cc77b430be93505 [2019-01-12 04:57:55,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:57:55,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:57:55,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:57:55,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:57:55,838 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:57:55,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:57:55" (1/1) ... [2019-01-12 04:57:55,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f176b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:55, skipping insertion in model container [2019-01-12 04:57:55,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:57:55" (1/1) ... [2019-01-12 04:57:55,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:57:55,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:57:56,970 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:57:56,976 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:57:57,385 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:57:57,407 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:57:57,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57 WrapperNode [2019-01-12 04:57:57,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:57:57,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:57:57,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:57:57,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:57:57,578 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:57:57" (1/1) ... [2019-01-12 04:57:57,637 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:57:57" (1/1) ... [2019-01-12 04:57:57,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:57:57,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:57:57,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:57:57,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:57:57,864 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:57,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:57,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:57,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:58,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:58,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:58,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (1/1) ... [2019-01-12 04:57:58,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:57:58,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:57:58,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:57:58,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:57:58,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (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:57:58,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:57:58,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:58:08,109 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:58:08,109 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:58:08,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:58:08 BoogieIcfgContainer [2019-01-12 04:58:08,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:58:08,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:58:08,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:58:08,115 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:58:08,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:57:55" (1/3) ... [2019-01-12 04:58:08,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661b533a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:58:08, skipping insertion in model container [2019-01-12 04:58:08,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:57:57" (2/3) ... [2019-01-12 04:58:08,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661b533a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:58:08, skipping insertion in model container [2019-01-12 04:58:08,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:58:08" (3/3) ... [2019-01-12 04:58:08,120 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label27_true-unreach-call.c [2019-01-12 04:58:08,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:58:08,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:58:08,152 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:58:08,189 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:58:08,190 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:58:08,190 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:58:08,190 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:58:08,190 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:58:08,191 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:58:08,191 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:58:08,191 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:58:08,191 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:58:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-01-12 04:58:08,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 04:58:08,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:08,231 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] [2019-01-12 04:58:08,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 751578873, now seen corresponding path program 1 times [2019-01-12 04:58:08,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:08,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:08,667 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:58:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:58:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:58:08,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:58:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:58:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:58:08,693 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-01-12 04:58:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:17,694 INFO L93 Difference]: Finished difference Result 2120 states and 3947 transitions. [2019-01-12 04:58:17,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:58:17,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-01-12 04:58:17,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:17,727 INFO L225 Difference]: With dead ends: 2120 [2019-01-12 04:58:17,728 INFO L226 Difference]: Without dead ends: 1448 [2019-01-12 04:58:17,735 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:58:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-01-12 04:58:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 970. [2019-01-12 04:58:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-01-12 04:58:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1691 transitions. [2019-01-12 04:58:17,856 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1691 transitions. Word has length 41 [2019-01-12 04:58:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:17,857 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1691 transitions. [2019-01-12 04:58:17,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:58:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1691 transitions. [2019-01-12 04:58:17,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 04:58:17,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:17,863 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:17,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1241020354, now seen corresponding path program 1 times [2019-01-12 04:58:17,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:17,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:17,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:17,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:17,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:58:18,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:58:18,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:58:18,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:58:18,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:58:18,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:58:18,054 INFO L87 Difference]: Start difference. First operand 970 states and 1691 transitions. Second operand 4 states. [2019-01-12 04:58:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:23,062 INFO L93 Difference]: Finished difference Result 2798 states and 4913 transitions. [2019-01-12 04:58:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:58:23,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-01-12 04:58:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:23,075 INFO L225 Difference]: With dead ends: 2798 [2019-01-12 04:58:23,075 INFO L226 Difference]: Without dead ends: 1830 [2019-01-12 04:58:23,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:58:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-01-12 04:58:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1830. [2019-01-12 04:58:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1830 states. [2019-01-12 04:58:23,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2564 transitions. [2019-01-12 04:58:23,123 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2564 transitions. Word has length 108 [2019-01-12 04:58:23,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:23,123 INFO L480 AbstractCegarLoop]: Abstraction has 1830 states and 2564 transitions. [2019-01-12 04:58:23,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:58:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2564 transitions. [2019-01-12 04:58:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 04:58:23,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:23,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:23,129 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash 253179212, now seen corresponding path program 1 times [2019-01-12 04:58:23,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:23,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:23,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:58:23,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:58:23,513 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:58:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:23,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:58:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:58:23,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:58:23,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-01-12 04:58:23,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:58:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:58:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:58:23,927 INFO L87 Difference]: Start difference. First operand 1830 states and 2564 transitions. Second operand 6 states. [2019-01-12 04:58:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:37,288 INFO L93 Difference]: Finished difference Result 9231 states and 12781 transitions. [2019-01-12 04:58:37,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:58:37,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-01-12 04:58:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:37,325 INFO L225 Difference]: With dead ends: 9231 [2019-01-12 04:58:37,325 INFO L226 Difference]: Without dead ends: 5695 [2019-01-12 04:58:37,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:58:37,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2019-01-12 04:58:37,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 4408. [2019-01-12 04:58:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4408 states. [2019-01-12 04:58:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4408 states to 4408 states and 5596 transitions. [2019-01-12 04:58:37,438 INFO L78 Accepts]: Start accepts. Automaton has 4408 states and 5596 transitions. Word has length 111 [2019-01-12 04:58:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:37,439 INFO L480 AbstractCegarLoop]: Abstraction has 4408 states and 5596 transitions. [2019-01-12 04:58:37,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:58:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4408 states and 5596 transitions. [2019-01-12 04:58:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-01-12 04:58:37,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:37,445 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:58:37,447 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:37,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash 779403360, now seen corresponding path program 1 times [2019-01-12 04:58:37,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:37,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:37,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:37,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:58:37,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:58:37,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:58:37,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:58:37,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:58:37,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:58:37,770 INFO L87 Difference]: Start difference. First operand 4408 states and 5596 transitions. Second operand 4 states. [2019-01-12 04:58:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:42,954 INFO L93 Difference]: Finished difference Result 11794 states and 15358 transitions. [2019-01-12 04:58:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:58:42,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-01-12 04:58:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:42,990 INFO L225 Difference]: With dead ends: 11794 [2019-01-12 04:58:42,991 INFO L226 Difference]: Without dead ends: 7388 [2019-01-12 04:58:42,997 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:58:43,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7388 states. [2019-01-12 04:58:43,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7388 to 6963. [2019-01-12 04:58:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6963 states. [2019-01-12 04:58:43,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6963 states to 6963 states and 8710 transitions. [2019-01-12 04:58:43,126 INFO L78 Accepts]: Start accepts. Automaton has 6963 states and 8710 transitions. Word has length 197 [2019-01-12 04:58:43,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:43,127 INFO L480 AbstractCegarLoop]: Abstraction has 6963 states and 8710 transitions. [2019-01-12 04:58:43,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:58:43,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6963 states and 8710 transitions. [2019-01-12 04:58:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2019-01-12 04:58:43,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:43,140 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:58:43,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:43,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:43,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2045787559, now seen corresponding path program 1 times [2019-01-12 04:58:43,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:43,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:43,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:43,653 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:58:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 357 proven. 82 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-01-12 04:58:43,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:58:43,912 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:58:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:44,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:58:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 357 proven. 82 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-01-12 04:58:44,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:58:44,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 04:58:44,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:58:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:58:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:58:44,261 INFO L87 Difference]: Start difference. First operand 6963 states and 8710 transitions. Second operand 7 states. [2019-01-12 04:58:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:54,599 INFO L93 Difference]: Finished difference Result 27572 states and 33471 transitions. [2019-01-12 04:58:54,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:58:54,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 363 [2019-01-12 04:58:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:54,655 INFO L225 Difference]: With dead ends: 27572 [2019-01-12 04:58:54,655 INFO L226 Difference]: Without dead ends: 16327 [2019-01-12 04:58:54,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:58:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16327 states. [2019-01-12 04:58:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16327 to 15886. [2019-01-12 04:58:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2019-01-12 04:58:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 18164 transitions. [2019-01-12 04:58:54,922 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 18164 transitions. Word has length 363 [2019-01-12 04:58:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:54,923 INFO L480 AbstractCegarLoop]: Abstraction has 15886 states and 18164 transitions. [2019-01-12 04:58:54,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:58:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 18164 transitions. [2019-01-12 04:58:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2019-01-12 04:58:54,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:54,954 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:58:54,954 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:54,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -322130850, now seen corresponding path program 1 times [2019-01-12 04:58:54,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:54,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-01-12 04:58:55,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:58:55,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:58:55,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:58:55,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:58:55,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:58:55,702 INFO L87 Difference]: Start difference. First operand 15886 states and 18164 transitions. Second operand 3 states. [2019-01-12 04:58:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:58:58,565 INFO L93 Difference]: Finished difference Result 36451 states and 41831 transitions. [2019-01-12 04:58:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:58:58,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 643 [2019-01-12 04:58:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:58:58,605 INFO L225 Difference]: With dead ends: 36451 [2019-01-12 04:58:58,605 INFO L226 Difference]: Without dead ends: 20992 [2019-01-12 04:58:58,622 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:58:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20992 states. [2019-01-12 04:58:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20992 to 20138. [2019-01-12 04:58:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20138 states. [2019-01-12 04:58:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20138 states to 20138 states and 22855 transitions. [2019-01-12 04:58:58,938 INFO L78 Accepts]: Start accepts. Automaton has 20138 states and 22855 transitions. Word has length 643 [2019-01-12 04:58:58,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:58:58,942 INFO L480 AbstractCegarLoop]: Abstraction has 20138 states and 22855 transitions. [2019-01-12 04:58:58,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:58:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 20138 states and 22855 transitions. [2019-01-12 04:58:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2019-01-12 04:58:58,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:58:58,980 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:58,980 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:58:58,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:58:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1096379327, now seen corresponding path program 1 times [2019-01-12 04:58:58,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:58:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:58:58,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:58:58,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:58:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:58:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-01-12 04:58:59,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:58:59,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:58:59,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:58:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:58:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:58:59,611 INFO L87 Difference]: Start difference. First operand 20138 states and 22855 transitions. Second operand 3 states. [2019-01-12 04:59:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:59:02,351 INFO L93 Difference]: Finished difference Result 54309 states and 61637 transitions. [2019-01-12 04:59:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:59:02,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 667 [2019-01-12 04:59:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:59:02,420 INFO L225 Difference]: With dead ends: 54309 [2019-01-12 04:59:02,420 INFO L226 Difference]: Without dead ends: 34598 [2019-01-12 04:59:02,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:59:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34598 states. [2019-01-12 04:59:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34598 to 33732. [2019-01-12 04:59:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33732 states. [2019-01-12 04:59:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33732 states to 33732 states and 38194 transitions. [2019-01-12 04:59:02,882 INFO L78 Accepts]: Start accepts. Automaton has 33732 states and 38194 transitions. Word has length 667 [2019-01-12 04:59:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:59:02,882 INFO L480 AbstractCegarLoop]: Abstraction has 33732 states and 38194 transitions. [2019-01-12 04:59:02,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:59:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 33732 states and 38194 transitions. [2019-01-12 04:59:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 807 [2019-01-12 04:59:02,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:59:02,947 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:59:02,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:59:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:59:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash -995140761, now seen corresponding path program 1 times [2019-01-12 04:59:02,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:59:02,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:59:02,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:02,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:02,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-01-12 04:59:03,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:59:03,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:59:03,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:59:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:59:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:59:03,824 INFO L87 Difference]: Start difference. First operand 33732 states and 38194 transitions. Second operand 3 states. [2019-01-12 04:59:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:59:06,721 INFO L93 Difference]: Finished difference Result 80215 states and 91164 transitions. [2019-01-12 04:59:06,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:59:06,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 806 [2019-01-12 04:59:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:59:06,778 INFO L225 Difference]: With dead ends: 80215 [2019-01-12 04:59:06,779 INFO L226 Difference]: Without dead ends: 46910 [2019-01-12 04:59:06,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:59:07,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46910 states. [2019-01-12 04:59:07,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46910 to 44356. [2019-01-12 04:59:07,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44356 states. [2019-01-12 04:59:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44356 states to 44356 states and 49571 transitions. [2019-01-12 04:59:07,622 INFO L78 Accepts]: Start accepts. Automaton has 44356 states and 49571 transitions. Word has length 806 [2019-01-12 04:59:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:59:07,626 INFO L480 AbstractCegarLoop]: Abstraction has 44356 states and 49571 transitions. [2019-01-12 04:59:07,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:59:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 44356 states and 49571 transitions. [2019-01-12 04:59:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2019-01-12 04:59:07,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:59:07,666 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:59:07,666 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:59:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:59:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -476294953, now seen corresponding path program 1 times [2019-01-12 04:59:07,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:59:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:59:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:07,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:08,638 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 04:59:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 155 proven. 567 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-01-12 04:59:10,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:59:10,217 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:59:10,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:10,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:59:10,832 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2019-01-12 04:59:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 483 proven. 240 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 04:59:12,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:59:12,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:59:12,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:59:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:59:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:59:12,411 INFO L87 Difference]: Start difference. First operand 44356 states and 49571 transitions. Second operand 8 states. [2019-01-12 04:59:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:59:23,630 INFO L93 Difference]: Finished difference Result 100202 states and 111342 transitions. [2019-01-12 04:59:23,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:59:23,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 848 [2019-01-12 04:59:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:59:23,717 INFO L225 Difference]: With dead ends: 100202 [2019-01-12 04:59:23,717 INFO L226 Difference]: Without dead ends: 55848 [2019-01-12 04:59:23,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 846 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:59:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55848 states. [2019-01-12 04:59:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55848 to 41366. [2019-01-12 04:59:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41366 states. [2019-01-12 04:59:24,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41366 states to 41366 states and 45252 transitions. [2019-01-12 04:59:24,359 INFO L78 Accepts]: Start accepts. Automaton has 41366 states and 45252 transitions. Word has length 848 [2019-01-12 04:59:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:59:24,360 INFO L480 AbstractCegarLoop]: Abstraction has 41366 states and 45252 transitions. [2019-01-12 04:59:24,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:59:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41366 states and 45252 transitions. [2019-01-12 04:59:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 894 [2019-01-12 04:59:24,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:59:24,383 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:24,383 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:59:24,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:59:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1000086755, now seen corresponding path program 1 times [2019-01-12 04:59:24,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:59:24,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:59:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:24,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1293 backedges. 1024 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-01-12 04:59:25,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:59:25,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:59:25,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:59:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:59:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:59:25,682 INFO L87 Difference]: Start difference. First operand 41366 states and 45252 transitions. Second operand 5 states. [2019-01-12 04:59:30,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:59:30,700 INFO L93 Difference]: Finished difference Result 97640 states and 106839 transitions. [2019-01-12 04:59:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:59:30,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 893 [2019-01-12 04:59:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:59:30,755 INFO L225 Difference]: With dead ends: 97640 [2019-01-12 04:59:30,755 INFO L226 Difference]: Without dead ends: 56701 [2019-01-12 04:59:30,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:59:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56701 states. [2019-01-12 04:59:31,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56701 to 43927. [2019-01-12 04:59:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43927 states. [2019-01-12 04:59:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43927 states to 43927 states and 48062 transitions. [2019-01-12 04:59:31,256 INFO L78 Accepts]: Start accepts. Automaton has 43927 states and 48062 transitions. Word has length 893 [2019-01-12 04:59:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:59:31,257 INFO L480 AbstractCegarLoop]: Abstraction has 43927 states and 48062 transitions. [2019-01-12 04:59:31,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:59:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43927 states and 48062 transitions. [2019-01-12 04:59:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 895 [2019-01-12 04:59:31,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:59:31,285 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:31,287 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:59:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:59:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1095490096, now seen corresponding path program 1 times [2019-01-12 04:59:31,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:59:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:59:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:31,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:59:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:32,284 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-12 04:59:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 750 proven. 484 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 04:59:36,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:59:36,281 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:59:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:59:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:59:36,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:59:37,414 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:59:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 963 proven. 245 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 04:59:39,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:59:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6] total 17 [2019-01-12 04:59:39,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 04:59:39,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 04:59:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-01-12 04:59:39,057 INFO L87 Difference]: Start difference. First operand 43927 states and 48062 transitions. Second operand 17 states. [2019-01-12 04:59:39,248 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-12 04:59:52,159 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-01-12 05:00:06,047 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-01-12 05:00:08,776 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-01-12 05:00:12,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:00:12,210 INFO L93 Difference]: Finished difference Result 109243 states and 119377 transitions. [2019-01-12 05:00:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-12 05:00:12,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 894 [2019-01-12 05:00:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:00:12,272 INFO L225 Difference]: With dead ends: 109243 [2019-01-12 05:00:12,272 INFO L226 Difference]: Without dead ends: 65740 [2019-01-12 05:00:12,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 941 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1795 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1167, Invalid=3945, Unknown=0, NotChecked=0, Total=5112 [2019-01-12 05:00:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65740 states. [2019-01-12 05:00:12,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65740 to 55871. [2019-01-12 05:00:12,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55871 states. [2019-01-12 05:00:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55871 states to 55871 states and 59389 transitions. [2019-01-12 05:00:12,961 INFO L78 Accepts]: Start accepts. Automaton has 55871 states and 59389 transitions. Word has length 894 [2019-01-12 05:00:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:00:12,962 INFO L480 AbstractCegarLoop]: Abstraction has 55871 states and 59389 transitions. [2019-01-12 05:00:12,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 05:00:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55871 states and 59389 transitions. [2019-01-12 05:00:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-01-12 05:00:13,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:00:13,016 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 05:00:13,017 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:00:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:00:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1909804877, now seen corresponding path program 1 times [2019-01-12 05:00:13,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:00:13,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:00:13,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:00:13,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:00:13,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:00:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:00:13,810 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 05:00:14,484 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 05:00:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 1163 proven. 240 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-01-12 05:00:15,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:00:15,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:00:15,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:00:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:00:15,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:00:16,796 WARN L181 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 16 [2019-01-12 05:00:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1928 backedges. 1321 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-01-12 05:00:17,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:00:17,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-01-12 05:00:17,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:00:17,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:00:17,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:00:17,626 INFO L87 Difference]: Start difference. First operand 55871 states and 59389 transitions. Second operand 7 states. [2019-01-12 05:01:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:01:03,128 INFO L93 Difference]: Finished difference Result 139655 states and 148531 transitions. [2019-01-12 05:01:03,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 05:01:03,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1063 [2019-01-12 05:01:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:01:03,210 INFO L225 Difference]: With dead ends: 139655 [2019-01-12 05:01:03,210 INFO L226 Difference]: Without dead ends: 82933 [2019-01-12 05:01:03,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1088 GetRequests, 1073 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-01-12 05:01:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82933 states. [2019-01-12 05:01:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82933 to 59685. [2019-01-12 05:01:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59685 states. [2019-01-12 05:01:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59685 states to 59685 states and 62914 transitions. [2019-01-12 05:01:04,374 INFO L78 Accepts]: Start accepts. Automaton has 59685 states and 62914 transitions. Word has length 1063 [2019-01-12 05:01:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:01:04,375 INFO L480 AbstractCegarLoop]: Abstraction has 59685 states and 62914 transitions. [2019-01-12 05:01:04,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:01:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 59685 states and 62914 transitions. [2019-01-12 05:01:04,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1187 [2019-01-12 05:01:04,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:01:04,406 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:04,406 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:01:04,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:01:04,406 INFO L82 PathProgramCache]: Analyzing trace with hash -790133766, now seen corresponding path program 1 times [2019-01-12 05:01:04,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:01:04,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:01:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:04,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:04,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2019-01-12 05:01:06,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:01:06,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 05:01:06,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 05:01:06,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 05:01:06,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:01:06,330 INFO L87 Difference]: Start difference. First operand 59685 states and 62914 transitions. Second operand 5 states. [2019-01-12 05:01:11,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:01:11,482 INFO L93 Difference]: Finished difference Result 140225 states and 148170 transitions. [2019-01-12 05:01:11,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 05:01:11,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1186 [2019-01-12 05:01:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:01:11,564 INFO L225 Difference]: With dead ends: 140225 [2019-01-12 05:01:11,564 INFO L226 Difference]: Without dead ends: 80542 [2019-01-12 05:01:11,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:01:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80542 states. [2019-01-12 05:01:12,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80542 to 66917. [2019-01-12 05:01:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66917 states. [2019-01-12 05:01:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66917 states to 66917 states and 70438 transitions. [2019-01-12 05:01:12,988 INFO L78 Accepts]: Start accepts. Automaton has 66917 states and 70438 transitions. Word has length 1186 [2019-01-12 05:01:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:01:12,989 INFO L480 AbstractCegarLoop]: Abstraction has 66917 states and 70438 transitions. [2019-01-12 05:01:12,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 05:01:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 66917 states and 70438 transitions. [2019-01-12 05:01:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1191 [2019-01-12 05:01:13,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:01:13,027 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 05:01:13,027 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:01:13,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:01:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1444068341, now seen corresponding path program 1 times [2019-01-12 05:01:13,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:01:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:01:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:13,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:13,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:13,847 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 05:01:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 1235 proven. 425 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-01-12 05:01:15,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:01:15,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:01:15,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:16,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:01:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2060 backedges. 976 proven. 0 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-01-12 05:01:21,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:01:21,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 05:01:21,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 05:01:21,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 05:01:21,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 05:01:21,422 INFO L87 Difference]: Start difference. First operand 66917 states and 70438 transitions. Second operand 7 states. [2019-01-12 05:01:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:01:36,854 INFO L93 Difference]: Finished difference Result 156420 states and 164596 transitions. [2019-01-12 05:01:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 05:01:36,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1190 [2019-01-12 05:01:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:01:36,958 INFO L225 Difference]: With dead ends: 156420 [2019-01-12 05:01:36,959 INFO L226 Difference]: Without dead ends: 89930 [2019-01-12 05:01:37,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1191 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:01:37,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89930 states. [2019-01-12 05:01:37,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89930 to 77135. [2019-01-12 05:01:37,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77135 states. [2019-01-12 05:01:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77135 states to 77135 states and 80740 transitions. [2019-01-12 05:01:37,821 INFO L78 Accepts]: Start accepts. Automaton has 77135 states and 80740 transitions. Word has length 1190 [2019-01-12 05:01:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:01:37,822 INFO L480 AbstractCegarLoop]: Abstraction has 77135 states and 80740 transitions. [2019-01-12 05:01:37,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 05:01:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 77135 states and 80740 transitions. [2019-01-12 05:01:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1778 [2019-01-12 05:01:37,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:01:37,882 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:01:37,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:01:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:01:37,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880650, now seen corresponding path program 1 times [2019-01-12 05:01:37,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:01:37,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:01:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:37,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4793 backedges. 3053 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2019-01-12 05:01:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:01:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:01:40,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:01:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:01:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:01:40,536 INFO L87 Difference]: Start difference. First operand 77135 states and 80740 transitions. Second operand 3 states. [2019-01-12 05:01:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:01:43,692 INFO L93 Difference]: Finished difference Result 142941 states and 149701 transitions. [2019-01-12 05:01:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:01:43,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1777 [2019-01-12 05:01:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:01:43,759 INFO L225 Difference]: With dead ends: 142941 [2019-01-12 05:01:43,759 INFO L226 Difference]: Without dead ends: 70489 [2019-01-12 05:01:43,793 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 05:01:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70489 states. [2019-01-12 05:01:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70489 to 65568. [2019-01-12 05:01:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65568 states. [2019-01-12 05:01:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65568 states to 65568 states and 68659 transitions. [2019-01-12 05:01:44,509 INFO L78 Accepts]: Start accepts. Automaton has 65568 states and 68659 transitions. Word has length 1777 [2019-01-12 05:01:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:01:44,510 INFO L480 AbstractCegarLoop]: Abstraction has 65568 states and 68659 transitions. [2019-01-12 05:01:44,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:01:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65568 states and 68659 transitions. [2019-01-12 05:01:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2072 [2019-01-12 05:01:44,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:01:44,577 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 05:01:44,577 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:01:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:01:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 462539139, now seen corresponding path program 1 times [2019-01-12 05:01:44,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:01:44,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:01:44,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:44,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6215 backedges. 3219 proven. 0 refuted. 0 times theorem prover too weak. 2996 trivial. 0 not checked. [2019-01-12 05:01:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:01:48,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:01:48,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:01:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:01:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:01:48,257 INFO L87 Difference]: Start difference. First operand 65568 states and 68659 transitions. Second operand 3 states. [2019-01-12 05:01:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:01:51,097 INFO L93 Difference]: Finished difference Result 129439 states and 135538 transitions. [2019-01-12 05:01:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:01:51,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2071 [2019-01-12 05:01:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:01:51,157 INFO L225 Difference]: With dead ends: 129439 [2019-01-12 05:01:51,157 INFO L226 Difference]: Without dead ends: 68979 [2019-01-12 05:01:51,189 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 05:01:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68979 states. [2019-01-12 05:01:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68979 to 67268. [2019-01-12 05:01:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67268 states. [2019-01-12 05:01:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67268 states to 67268 states and 70423 transitions. [2019-01-12 05:01:51,874 INFO L78 Accepts]: Start accepts. Automaton has 67268 states and 70423 transitions. Word has length 2071 [2019-01-12 05:01:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:01:51,875 INFO L480 AbstractCegarLoop]: Abstraction has 67268 states and 70423 transitions. [2019-01-12 05:01:51,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:01:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 67268 states and 70423 transitions. [2019-01-12 05:01:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2074 [2019-01-12 05:01:51,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:01:51,937 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 05:01:51,937 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:01:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:01:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 988456797, now seen corresponding path program 1 times [2019-01-12 05:01:51,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:01:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:01:51,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:51,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:01:51,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:01:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:01:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5785 backedges. 3138 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2019-01-12 05:01:54,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:01:54,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 05:01:54,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 05:01:54,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 05:01:54,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 05:01:54,439 INFO L87 Difference]: Start difference. First operand 67268 states and 70423 transitions. Second operand 5 states. [2019-01-12 05:02:01,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:02:01,588 INFO L93 Difference]: Finished difference Result 146019 states and 152697 transitions. [2019-01-12 05:02:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 05:02:01,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2073 [2019-01-12 05:02:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:02:01,663 INFO L225 Difference]: With dead ends: 146019 [2019-01-12 05:02:01,664 INFO L226 Difference]: Without dead ends: 83859 [2019-01-12 05:02:01,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 05:02:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83859 states. [2019-01-12 05:02:02,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83859 to 65993. [2019-01-12 05:02:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65993 states. [2019-01-12 05:02:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65993 states to 65993 states and 69049 transitions. [2019-01-12 05:02:02,418 INFO L78 Accepts]: Start accepts. Automaton has 65993 states and 69049 transitions. Word has length 2073 [2019-01-12 05:02:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:02:02,419 INFO L480 AbstractCegarLoop]: Abstraction has 65993 states and 69049 transitions. [2019-01-12 05:02:02,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 05:02:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 65993 states and 69049 transitions. [2019-01-12 05:02:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2136 [2019-01-12 05:02:02,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:02:02,483 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 05:02:02,484 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:02:02,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:02:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash 475192740, now seen corresponding path program 1 times [2019-01-12 05:02:02,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:02:02,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:02:02,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:02,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:02:02,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:02:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6479 backedges. 3427 proven. 0 refuted. 0 times theorem prover too weak. 3052 trivial. 0 not checked. [2019-01-12 05:02:04,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 05:02:04,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 05:02:04,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 05:02:04,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 05:02:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 05:02:04,923 INFO L87 Difference]: Start difference. First operand 65993 states and 69049 transitions. Second operand 3 states. [2019-01-12 05:02:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:02:07,285 INFO L93 Difference]: Finished difference Result 130710 states and 136797 transitions. [2019-01-12 05:02:07,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 05:02:07,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2135 [2019-01-12 05:02:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:02:07,341 INFO L225 Difference]: With dead ends: 130710 [2019-01-12 05:02:07,341 INFO L226 Difference]: Without dead ends: 68119 [2019-01-12 05:02:07,369 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 05:02:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68119 states. [2019-01-12 05:02:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68119 to 54074. [2019-01-12 05:02:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54074 states. [2019-01-12 05:02:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54074 states to 54074 states and 56680 transitions. [2019-01-12 05:02:08,161 INFO L78 Accepts]: Start accepts. Automaton has 54074 states and 56680 transitions. Word has length 2135 [2019-01-12 05:02:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:02:08,162 INFO L480 AbstractCegarLoop]: Abstraction has 54074 states and 56680 transitions. [2019-01-12 05:02:08,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 05:02:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 54074 states and 56680 transitions. [2019-01-12 05:02:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2150 [2019-01-12 05:02:08,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:02:08,216 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 05:02:08,216 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:02:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:02:08,217 INFO L82 PathProgramCache]: Analyzing trace with hash 985313227, now seen corresponding path program 1 times [2019-01-12 05:02:08,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:02:08,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:02:08,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:08,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:02:08,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:02:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 3021 proven. 339 refuted. 0 times theorem prover too weak. 2302 trivial. 0 not checked. [2019-01-12 05:02:11,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:02:11,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:02:11,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:02:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:02:11,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:02:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 3320 proven. 0 refuted. 0 times theorem prover too weak. 2342 trivial. 0 not checked. [2019-01-12 05:02:14,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:02:14,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-01-12 05:02:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 05:02:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 05:02:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 05:02:14,445 INFO L87 Difference]: Start difference. First operand 54074 states and 56680 transitions. Second operand 9 states. [2019-01-12 05:02:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:02:34,596 INFO L93 Difference]: Finished difference Result 148607 states and 155907 transitions. [2019-01-12 05:02:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 05:02:34,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2149 [2019-01-12 05:02:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:02:34,679 INFO L225 Difference]: With dead ends: 148607 [2019-01-12 05:02:34,679 INFO L226 Difference]: Without dead ends: 98364 [2019-01-12 05:02:34,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2179 GetRequests, 2159 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-01-12 05:02:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98364 states. [2019-01-12 05:02:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98364 to 61319. [2019-01-12 05:02:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61319 states. [2019-01-12 05:02:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61319 states to 61319 states and 63779 transitions. [2019-01-12 05:02:35,440 INFO L78 Accepts]: Start accepts. Automaton has 61319 states and 63779 transitions. Word has length 2149 [2019-01-12 05:02:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:02:35,442 INFO L480 AbstractCegarLoop]: Abstraction has 61319 states and 63779 transitions. [2019-01-12 05:02:35,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 05:02:35,442 INFO L276 IsEmpty]: Start isEmpty. Operand 61319 states and 63779 transitions. [2019-01-12 05:02:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3048 [2019-01-12 05:02:35,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 05:02:35,520 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:02:35,520 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 05:02:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 05:02:35,521 INFO L82 PathProgramCache]: Analyzing trace with hash 641230216, now seen corresponding path program 1 times [2019-01-12 05:02:35,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 05:02:35,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 05:02:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:02:35,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 05:02:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:02:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11975 backedges. 8901 proven. 311 refuted. 0 times theorem prover too weak. 2763 trivial. 0 not checked. [2019-01-12 05:02:41,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 05:02:41,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 05:02:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 05:02:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 05:02:41,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 05:02:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11975 backedges. 2989 proven. 0 refuted. 0 times theorem prover too weak. 8986 trivial. 0 not checked. [2019-01-12 05:02:45,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 05:02:45,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-12 05:02:45,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 05:02:45,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 05:02:45,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:02:45,351 INFO L87 Difference]: Start difference. First operand 61319 states and 63779 transitions. Second operand 8 states. [2019-01-12 05:02:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 05:02:53,454 INFO L93 Difference]: Finished difference Result 142652 states and 148600 transitions. [2019-01-12 05:02:53,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 05:02:53,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 3047 [2019-01-12 05:02:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 05:02:53,457 INFO L225 Difference]: With dead ends: 142652 [2019-01-12 05:02:53,457 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 05:02:53,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3052 GetRequests, 3046 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 05:02:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 05:02:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 05:02:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 05:02:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 05:02:53,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3047 [2019-01-12 05:02:53,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 05:02:53,494 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 05:02:53,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 05:02:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 05:02:53,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 05:02:53,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 05:02:54,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:54,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,371 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:55,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:56,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:56,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:56,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,709 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:57,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:58,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:59,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:59,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:02:59,540 WARN L181 SmtUtils]: Spent 6.03 s on a formula simplification. DAG size of input: 1455 DAG size of output: 1156 [2019-01-12 05:02:59,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,037 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:00,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:01,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:02,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:03,974 WARN L181 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 1380 DAG size of output: 1091 [2019-01-12 05:03:04,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:04,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:05,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:05,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:05,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:05,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:05,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,630 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:06,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:07,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:08,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:08,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 05:03:08,562 WARN L181 SmtUtils]: Spent 4.58 s on a formula simplification. DAG size of input: 1455 DAG size of output: 1156 [2019-01-12 05:03:49,888 WARN L181 SmtUtils]: Spent 41.31 s on a formula simplification. DAG size of input: 1105 DAG size of output: 158 [2019-01-12 05:04:36,680 WARN L181 SmtUtils]: Spent 46.78 s on a formula simplification. DAG size of input: 1046 DAG size of output: 158 [2019-01-12 05:05:14,042 WARN L181 SmtUtils]: Spent 37.35 s on a formula simplification. DAG size of input: 1105 DAG size of output: 158 [2019-01-12 05:05:14,045 INFO L448 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 05:05:14,045 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-01-12 05:05:14,046 INFO L448 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-01-12 05:05:14,047 INFO L448 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,048 INFO L448 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-01-12 05:05:14,049 INFO L448 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,050 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,051 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,052 INFO L448 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 131) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,053 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,054 INFO L448 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,055 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,056 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,057 INFO L448 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,058 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 05:05:14,059 INFO L448 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,060 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-12 05:05:14,061 INFO L448 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,062 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,063 INFO L448 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,064 INFO L448 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,065 INFO L448 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,066 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 05:05:14,067 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,068 INFO L448 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,069 INFO L448 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,070 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,071 INFO L448 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 05:05:14,072 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,073 INFO L448 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,074 INFO L448 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,075 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,076 INFO L448 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,077 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-01-12 05:05:14,078 INFO L448 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,079 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,079 INFO L448 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,079 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,079 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 05:05:14,079 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L444 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse22 (+ ~a26~0 68))) (let ((.cse23 (+ ~a14~0 182)) (.cse1 (<= .cse22 0)) (.cse18 (= ~a24~0 2)) (.cse17 (<= ~a26~0 217)) (.cse24 (+ ~a14~0 114)) (.cse10 (<= (+ ~a14~0 84) 0)) (.cse4 (< 37 ~a28~0))) (let ((.cse12 (<= 125 ~a26~0)) (.cse14 (exists ((v_prenex_14 Int)) (let ((.cse26 (* 9 v_prenex_14))) (let ((.cse25 (div .cse26 10))) (and (<= (+ ~a28~0 299980) (mod .cse25 300018)) (<= 0 .cse25) (<= 0 .cse26)))))) (.cse3 (<= 0 (+ ~a14~0 150))) (.cse6 (<= (+ ~a26~0 538401) 0)) (.cse7 (or (and .cse18 (or .cse17 (and (not (= ULTIMATE.start_calculate_output_~input 1)) (< 0 .cse24) .cse10))) .cse4)) (.cse9 (and .cse1 .cse4)) (.cse20 (<= ~a26~0 124)) (.cse0 (= ~a24~0 3)) (.cse8 (<= ~a28~0 300)) (.cse19 (<= .cse23 0)) (.cse13 (= ~a24~0 1)) (.cse15 (<= .cse24 0)) (.cse16 (< 0 .cse23)) (.cse2 (<= ~a21~0 124)) (.cse11 (< 0 .cse22))) (or (and .cse0 (and (<= (+ ~a28~0 588903) 0) (<= (+ ~a14~0 300092) 0) .cse1) .cse2) (and .cse3 (and (and (not (= 3 ~a24~0)) .cse1) .cse2)) (and (and .cse4 .cse2) (exists ((v_~a14~0_1226 Int)) (let ((.cse5 (mod v_~a14~0_1226 299909))) (and (<= (+ ~a14~0 300091) .cse5) (<= (+ v_~a14~0_1226 182) 0) (= 0 .cse5))))) (and .cse3 .cse6 .cse7 .cse2) (and (and .cse8 .cse9) .cse10 .cse2) (and .cse3 (and .cse8 .cse4 (<= ~a26~0 120) .cse2) .cse11) (and .cse8 .cse12 .cse13 (<= ~a26~0 532590) .cse2) (and (< 124 ~a26~0) .cse14 .cse13 .cse2) (and (and .cse14 .cse0 .cse15 .cse16 .cse2 (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse12 .cse17) (and (and .cse18 .cse10 .cse2) (<= 0 (+ ~a26~0 12))) (and (and .cse18 .cse14 .cse2) .cse19) (and .cse3 (and .cse4 .cse10 .cse2) (<= (+ ~a26~0 524888) 0)) (and .cse18 (<= 218 ~a26~0) .cse14 .cse2) (and (and .cse13 .cse4) .cse20) (and .cse3 .cse6 .cse10 .cse2) (and (<= ~a26~0 321684) (and .cse13 .cse7 .cse2)) (and (and .cse9 .cse2) .cse19) (and .cse13 .cse10) (and .cse18 .cse4 .cse2) (and .cse18 .cse11 .cse20 .cse2) (and .cse0 .cse15 .cse16 .cse4 (<= ~a28~0 133) .cse2) (and (<= ~a26~0 75) .cse2 .cse8 .cse4 .cse19) (and .cse1 .cse13) (and (and (and (exists ((v_~a26~0_1224 Int)) (let ((.cse21 (mod v_~a26~0_1224 95))) (and (<= ~a26~0 (+ .cse21 121)) (<= (+ v_~a26~0_1224 68) 0) (= .cse21 0)))) .cse15 .cse4) .cse16 .cse2) .cse11))))) [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,080 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,081 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-01-12 05:05:14,081 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-01-12 05:05:14,081 INFO L448 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,081 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,081 INFO L444 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse23 (+ ~a26~0 68))) (let ((.cse24 (+ ~a14~0 182)) (.cse1 (<= .cse23 0)) (.cse16 (= ~a24~0 2)) (.cse13 (<= ~a26~0 217)) (.cse25 (+ ~a14~0 114)) (.cse8 (<= (+ ~a14~0 84) 0)) (.cse4 (< 37 ~a28~0))) (let ((.cse12 (<= 125 ~a26~0)) (.cse18 (< 124 ~a26~0)) (.cse9 (exists ((v_prenex_14 Int)) (let ((.cse27 (* 9 v_prenex_14))) (let ((.cse26 (div .cse27 10))) (and (<= (+ ~a28~0 299980) (mod .cse26 300018)) (<= 0 .cse26) (<= 0 .cse27)))))) (.cse17 (<= ~a26~0 124)) (.cse20 (<= (+ ~a26~0 538401) 0)) (.cse21 (or (and .cse16 (or .cse13 (and (not (= ULTIMATE.start_calculate_output_~input 1)) (< 0 .cse25) .cse8))) .cse4)) (.cse7 (and .cse1 .cse4)) (.cse0 (= ~a24~0 3)) (.cse6 (<= ~a28~0 300)) (.cse19 (<= .cse24 0)) (.cse15 (= ~a24~0 1)) (.cse10 (<= .cse25 0)) (.cse11 (< 0 .cse24)) (.cse14 (< 0 .cse23)) (.cse3 (<= 0 (+ ~a14~0 150))) (.cse2 (<= ~a21~0 124))) (or (and .cse0 (and (<= (+ ~a28~0 588903) 0) (<= (+ ~a14~0 300092) 0) .cse1) .cse2) (and .cse3 (and (and (not (= 3 ~a24~0)) .cse1) .cse2)) (and (and .cse4 .cse2) (exists ((v_~a14~0_1226 Int)) (let ((.cse5 (mod v_~a14~0_1226 299909))) (and (<= (+ ~a14~0 300091) .cse5) (<= (+ v_~a14~0_1226 182) 0) (= 0 .cse5))))) (and (and .cse6 .cse7) .cse8 .cse2) (and (and .cse9 .cse0 .cse10 .cse11 .cse2 (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse12 .cse13) (and .cse3 (and .cse6 .cse4 (<= ~a26~0 120) .cse2) .cse14) (and .cse6 .cse12 .cse15 (<= ~a26~0 532590) .cse2) (and .cse14 (and .cse16 .cse17 .cse2)) (and .cse18 .cse9 .cse15 .cse2) (and (and .cse18 .cse16 .cse8 .cse2) (<= ~a26~0 532448)) (and (and .cse16 .cse9 .cse2) .cse19) (and .cse18 .cse16 .cse10 .cse11 .cse2) (and .cse16 (<= 218 ~a26~0) .cse9 .cse2) (and .cse3 .cse20 .cse21 .cse2) (and (and .cse15 .cse4) .cse17) (and .cse3 .cse20 .cse8 .cse2) (and (<= ~a26~0 321684) (and .cse15 .cse21 .cse2)) (and (and .cse7 .cse2) .cse19) (and .cse15 .cse8) (and .cse16 .cse4 .cse2) (and .cse0 .cse10 .cse11 .cse4 (<= ~a28~0 133) .cse2) (and (<= ~a26~0 75) .cse2 .cse6 .cse4 .cse19) (and .cse1 .cse15) (and (and (and (exists ((v_~a26~0_1224 Int)) (let ((.cse22 (mod v_~a26~0_1224 95))) (and (<= ~a26~0 (+ .cse22 121)) (<= (+ v_~a26~0_1224 68) 0) (= .cse22 0)))) .cse10 .cse4) .cse11 .cse2) .cse14) (and .cse3 .cse4 (<= (+ ~a26~0 524888) 0) .cse8 .cse2))))) [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-01-12 05:05:14,082 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L451 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,083 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,084 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-12 05:05:14,085 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,085 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 05:05:14,085 INFO L448 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,085 INFO L448 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,085 INFO L444 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse22 (+ ~a26~0 68))) (let ((.cse23 (+ ~a14~0 182)) (.cse1 (<= .cse22 0)) (.cse18 (= ~a24~0 2)) (.cse17 (<= ~a26~0 217)) (.cse24 (+ ~a14~0 114)) (.cse10 (<= (+ ~a14~0 84) 0)) (.cse4 (< 37 ~a28~0))) (let ((.cse12 (<= 125 ~a26~0)) (.cse14 (exists ((v_prenex_14 Int)) (let ((.cse26 (* 9 v_prenex_14))) (let ((.cse25 (div .cse26 10))) (and (<= (+ ~a28~0 299980) (mod .cse25 300018)) (<= 0 .cse25) (<= 0 .cse26)))))) (.cse3 (<= 0 (+ ~a14~0 150))) (.cse6 (<= (+ ~a26~0 538401) 0)) (.cse7 (or (and .cse18 (or .cse17 (and (not (= ULTIMATE.start_calculate_output_~input 1)) (< 0 .cse24) .cse10))) .cse4)) (.cse9 (and .cse1 .cse4)) (.cse20 (<= ~a26~0 124)) (.cse0 (= ~a24~0 3)) (.cse8 (<= ~a28~0 300)) (.cse19 (<= .cse23 0)) (.cse13 (= ~a24~0 1)) (.cse15 (<= .cse24 0)) (.cse16 (< 0 .cse23)) (.cse2 (<= ~a21~0 124)) (.cse11 (< 0 .cse22))) (or (and .cse0 (and (<= (+ ~a28~0 588903) 0) (<= (+ ~a14~0 300092) 0) .cse1) .cse2) (and .cse3 (and (and (not (= 3 ~a24~0)) .cse1) .cse2)) (and (and .cse4 .cse2) (exists ((v_~a14~0_1226 Int)) (let ((.cse5 (mod v_~a14~0_1226 299909))) (and (<= (+ ~a14~0 300091) .cse5) (<= (+ v_~a14~0_1226 182) 0) (= 0 .cse5))))) (and .cse3 .cse6 .cse7 .cse2) (and (and .cse8 .cse9) .cse10 .cse2) (and .cse3 (and .cse8 .cse4 (<= ~a26~0 120) .cse2) .cse11) (and .cse8 .cse12 .cse13 (<= ~a26~0 532590) .cse2) (and (< 124 ~a26~0) .cse14 .cse13 .cse2) (and (and .cse14 .cse0 .cse15 .cse16 .cse2 (not (= 4 ULTIMATE.start_calculate_output_~input))) .cse12 .cse17) (and (and .cse18 .cse10 .cse2) (<= 0 (+ ~a26~0 12))) (and (and .cse18 .cse14 .cse2) .cse19) (and .cse3 (and .cse4 .cse10 .cse2) (<= (+ ~a26~0 524888) 0)) (and .cse18 (<= 218 ~a26~0) .cse14 .cse2) (and (and .cse13 .cse4) .cse20) (and .cse3 .cse6 .cse10 .cse2) (and (<= ~a26~0 321684) (and .cse13 .cse7 .cse2)) (and (and .cse9 .cse2) .cse19) (and .cse13 .cse10) (and .cse18 .cse4 .cse2) (and .cse18 .cse11 .cse20 .cse2) (and .cse0 .cse15 .cse16 .cse4 (<= ~a28~0 133) .cse2) (and (<= ~a26~0 75) .cse2 .cse8 .cse4 .cse19) (and .cse1 .cse13) (and (and (and (exists ((v_~a26~0_1224 Int)) (let ((.cse21 (mod v_~a26~0_1224 95))) (and (<= ~a26~0 (+ .cse21 121)) (<= (+ v_~a26~0_1224 68) 0) (= .cse21 0)))) .cse15 .cse4) .cse16 .cse2) .cse11))))) [2019-01-12 05:05:14,085 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,086 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,087 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 05:05:14,088 INFO L448 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,089 INFO L448 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 05:05:14,089 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,089 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,089 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,100 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,101 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 05:05:14,102 INFO L448 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 05:05:14,111 INFO L448 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,112 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,113 INFO L448 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,121 INFO L448 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,121 INFO L448 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,121 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 05:05:14,122 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,123 INFO L448 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 05:05:14,124 INFO L448 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-01-12 05:05:14,135 INFO L448 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-01-12 05:05:14,136 INFO L448 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-01-12 05:05:14,137 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-12 05:05:14,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,180 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,206 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,211 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,212 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,213 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,216 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,223 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,227 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,228 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,231 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,232 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,233 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,236 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,239 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,247 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,248 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,250 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,256 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,259 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,261 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,262 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 05:05:14 BoogieIcfgContainer [2019-01-12 05:05:14,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 05:05:14,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 05:05:14,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 05:05:14,270 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 05:05:14,270 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:58:08" (3/4) ... [2019-01-12 05:05:14,276 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 05:05:14,385 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 05:05:14,392 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 05:05:14,471 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || (((a24 == 2 && a14 + 84 <= 0) && a21 <= 124) && 0 <= a26 + 12)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((0 <= a14 + 150 && (37 < a28 && a14 + 84 <= 0) && a21 <= 124) && a26 + 524888 <= 0)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((a24 == 2 && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68) [2019-01-12 05:05:14,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || (((a24 == 2 && a14 + 84 <= 0) && a21 <= 124) && 0 <= a26 + 12)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((0 <= a14 + 150 && (37 < a28 && a14 + 84 <= 0) && a21 <= 124) && a26 + 524888 <= 0)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((a24 == 2 && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68) [2019-01-12 05:05:14,513 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (0 < a26 + 68 && (a24 == 2 && a26 <= 124) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a14 + 84 <= 0) && a21 <= 124) && a26 <= 532448)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((((124 < a26 && a24 == 2) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68)) || ((((0 <= a14 + 150 && 37 < a28) && a26 + 524888 <= 0) && a14 + 84 <= 0) && a21 <= 124) [2019-01-12 05:05:14,787 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 05:05:14,787 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 05:05:14,789 INFO L168 Benchmark]: Toolchain (without parser) took 438960.37 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.5 GB). Free memory was 940.5 MB in the beginning and 2.9 GB in the end (delta: -2.0 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,789 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 05:05:14,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1579.29 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 800.9 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,790 INFO L168 Benchmark]: Boogie Procedure Inliner took 446.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 800.9 MB in the beginning and 1.1 GB in the end (delta: -298.6 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,790 INFO L168 Benchmark]: Boogie Preprocessor took 279.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,790 INFO L168 Benchmark]: RCFGBuilder took 9974.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,791 INFO L168 Benchmark]: TraceAbstraction took 426157.32 ms. Allocated memory was 1.3 GB in the beginning and 5.5 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,791 INFO L168 Benchmark]: Witness Printer took 517.96 ms. Allocated memory is still 5.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. [2019-01-12 05:05:14,794 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 1579.29 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 800.9 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 446.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 800.9 MB in the beginning and 1.1 GB in the end (delta: -298.6 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 279.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9974.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 426157.32 ms. Allocated memory was 1.3 GB in the beginning and 5.5 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 517.96 ms. Allocated memory is still 5.5 GB. Free memory was 3.0 GB in the beginning and 2.9 GB in the end (delta: 78.6 MB). Peak memory consumption was 78.6 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_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 131]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-01-12 05:05:14,800 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,801 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,802 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,803 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,805 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,806 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,807 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,808 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,810 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,811 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || (((a24 == 2 && a14 + 84 <= 0) && a21 <= 124) && 0 <= a26 + 12)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((0 <= a14 + 150 && (37 < a28 && a14 + 84 <= 0) && a21 <= 124) && a26 + 524888 <= 0)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((a24 == 2 && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68) - InvariantResult [Line: 1646]: Loop Invariant [2019-01-12 05:05:14,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,817 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,819 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,820 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,821 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (0 < a26 + 68 && (a24 == 2 && a26 <= 124) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a14 + 84 <= 0) && a21 <= 124) && a26 <= 532448)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((((124 < a26 && a24 == 2) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68)) || ((((0 <= a14 + 150 && 37 < a28) && a26 + 524888 <= 0) && a14 + 84 <= 0) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2019-01-12 05:05:14,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1226,QUANTIFIED] [2019-01-12 05:05:14,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 05:05:14,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] [2019-01-12 05:05:14,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1224,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a24 == 3 && (a28 + 588903 <= 0 && a14 + 300092 <= 0) && a26 + 68 <= 0) && a21 <= 124) || (0 <= a14 + 150 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((37 < a28 && a21 <= 124) && (\exists v_~a14~0_1226 : int :: (a14 + 300091 <= v_~a14~0_1226 % 299909 && v_~a14~0_1226 + 182 <= 0) && 0 == v_~a14~0_1226 % 299909))) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a28 <= 300 && a26 + 68 <= 0 && 37 < a28) && a14 + 84 <= 0) && a21 <= 124)) || ((0 <= a14 + 150 && ((a28 <= 300 && 37 < a28) && a26 <= 120) && a21 <= 124) && 0 < a26 + 68)) || ((((a28 <= 300 && 125 <= a26) && a24 == 1) && a26 <= 532590) && a21 <= 124)) || (((124 < a26 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a24 == 1) && a21 <= 124)) || ((((((((\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14) && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a21 <= 124) && !(4 == input)) && 125 <= a26) && a26 <= 217)) || (((a24 == 2 && a14 + 84 <= 0) && a21 <= 124) && 0 <= a26 + 12)) || (((a24 == 2 && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124) && a14 + 182 <= 0)) || ((0 <= a14 + 150 && (37 < a28 && a14 + 84 <= 0) && a21 <= 124) && a26 + 524888 <= 0)) || (((a24 == 2 && 218 <= a26) && (\exists v_prenex_14 : int :: (a28 + 299980 <= 9 * v_prenex_14 / 10 % 300018 && 0 <= 9 * v_prenex_14 / 10) && 0 <= 9 * v_prenex_14)) && a21 <= 124)) || ((a24 == 1 && 37 < a28) && a26 <= 124)) || (((0 <= a14 + 150 && a26 + 538401 <= 0) && a14 + 84 <= 0) && a21 <= 124)) || (a26 <= 321684 && (a24 == 1 && ((a24 == 2 && (a26 <= 217 || ((!(input == 1) && 0 < a14 + 114) && a14 + 84 <= 0))) || 37 < a28)) && a21 <= 124)) || (((a26 + 68 <= 0 && 37 < a28) && a21 <= 124) && a14 + 182 <= 0)) || (a24 == 1 && a14 + 84 <= 0)) || ((a24 == 2 && 37 < a28) && a21 <= 124)) || (((a24 == 2 && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((a24 == 3 && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a28 <= 133) && a21 <= 124)) || ((((a26 <= 75 && a21 <= 124) && a28 <= 300) && 37 < a28) && a14 + 182 <= 0)) || (a26 + 68 <= 0 && a24 == 1)) || ((((((\exists v_~a26~0_1224 : int :: (a26 <= v_~a26~0_1224 % 95 + 121 && v_~a26~0_1224 + 68 <= 0) && v_~a26~0_1224 % 95 == 0) && a14 + 114 <= 0) && 37 < a28) && 0 < a14 + 182) && a21 <= 124) && 0 < a26 + 68) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. SAFE Result, 425.9s OverallTime, 20 OverallIterations, 12 TraceHistogramMax, 212.2s AutomataDifference, 0.0s DeadEndRemovalTime, 140.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 4944 SDtfs, 47437 SDslu, 3000 SDs, 0 SdLazy, 106787 SolverSat, 14317 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 174.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9918 GetRequests, 9749 SyntacticMatches, 11 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77135occurred in iteration=14, 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: 10.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 169286 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 673 NumberOfFragments, 1792 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2970100 FormulaSimplificationTreeSizeReduction, 15.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 8553823 FormulaSimplificationTreeSizeReductionInter, 125.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 31927 NumberOfCodeBlocks, 31927 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 31899 ConstructedInterpolants, 562 QuantifiedInterpolants, 135925555 SizeOfPredicates, 6 NumberOfNonLiveVariables, 11214 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 75682/78735 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...