./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d242fd154f76fbbdca66276c5caf34f74dcc939 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:40:00,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:40:00,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:40:00,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:40:00,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:40:00,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:40:00,510 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:40:00,512 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:40:00,513 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:40:00,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:40:00,515 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:40:00,515 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:40:00,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:40:00,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:40:00,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:40:00,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:40:00,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:40:00,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:40:00,530 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:40:00,535 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:40:00,536 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:40:00,538 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:40:00,540 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:40:00,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:40:00,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:40:00,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:40:00,543 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:40:00,544 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:40:00,545 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:40:00,546 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:40:00,546 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:40:00,547 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:40:00,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:40:00,548 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:40:00,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:40:00,549 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:40:00,550 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:40:00,566 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:40:00,566 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:40:00,567 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:40:00,567 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:40:00,567 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:40:00,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:40:00,568 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:40:00,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:40:00,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:40:00,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:40:00,570 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:40:00,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:40:00,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:40:00,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:40:00,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:40:00,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:40:00,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:40:00,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:40:00,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:40:00,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:40:00,574 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:40:00,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:40:00,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:40:00,574 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 -> 8d242fd154f76fbbdca66276c5caf34f74dcc939 [2019-01-12 03:40:00,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:40:00,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:40:00,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:40:00,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:40:00,627 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:40:00,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c [2019-01-12 03:40:00,690 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8cfc1b2/bdcd056866084e47874b425e1b96a9a2/FLAGe06551299 [2019-01-12 03:40:01,312 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:40:01,316 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label30_true-unreach-call.c [2019-01-12 03:40:01,333 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8cfc1b2/bdcd056866084e47874b425e1b96a9a2/FLAGe06551299 [2019-01-12 03:40:01,516 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8cfc1b2/bdcd056866084e47874b425e1b96a9a2 [2019-01-12 03:40:01,520 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:40:01,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:40:01,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:40:01,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:40:01,528 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:40:01,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:40:01" (1/1) ... [2019-01-12 03:40:01,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f8ae22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:01, skipping insertion in model container [2019-01-12 03:40:01,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:40:01" (1/1) ... [2019-01-12 03:40:01,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:40:01,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:40:02,253 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:40:02,267 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:40:02,533 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:40:02,674 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:40:02,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02 WrapperNode [2019-01-12 03:40:02,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:40:02,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:40:02,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:40:02,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:40:02,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:40:02,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:40:02,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:40:02,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:40:02,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:02,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (1/1) ... [2019-01-12 03:40:03,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:40:03,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:40:03,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:40:03,009 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:40:03,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (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 03:40:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:40:03,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:40:07,137 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:40:07,138 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:40:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:07 BoogieIcfgContainer [2019-01-12 03:40:07,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:40:07,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:40:07,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:40:07,144 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:40:07,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:40:01" (1/3) ... [2019-01-12 03:40:07,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ab8234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:40:07, skipping insertion in model container [2019-01-12 03:40:07,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:40:02" (2/3) ... [2019-01-12 03:40:07,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ab8234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:40:07, skipping insertion in model container [2019-01-12 03:40:07,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:07" (3/3) ... [2019-01-12 03:40:07,149 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label30_true-unreach-call.c [2019-01-12 03:40:07,160 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:40:07,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:40:07,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:40:07,223 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:40:07,224 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:40:07,224 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:40:07,224 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:40:07,224 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:40:07,224 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:40:07,225 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:40:07,225 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:40:07,226 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:40:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:40:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 03:40:07,258 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:07,259 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] [2019-01-12 03:40:07,262 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:07,268 INFO L82 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2019-01-12 03:40:07,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:07,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:07,689 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2019-01-12 03:40:07,706 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 03:40:07,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:07,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:40:07,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:07,742 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:40:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:11,243 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-01-12 03:40:11,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:11,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-12 03:40:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:11,266 INFO L225 Difference]: With dead ends: 973 [2019-01-12 03:40:11,266 INFO L226 Difference]: Without dead ends: 607 [2019-01-12 03:40:11,272 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 03:40:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-01-12 03:40:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-01-12 03:40:11,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-01-12 03:40:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-01-12 03:40:11,365 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 29 [2019-01-12 03:40:11,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:11,365 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-01-12 03:40:11,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-01-12 03:40:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 03:40:11,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:11,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:11,370 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -618924976, now seen corresponding path program 1 times [2019-01-12 03:40:11,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:11,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:11,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:11,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:40:11,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:11,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:11,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:11,589 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-01-12 03:40:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:14,188 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-01-12 03:40:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:14,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-12 03:40:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:14,200 INFO L225 Difference]: With dead ends: 2328 [2019-01-12 03:40:14,201 INFO L226 Difference]: Without dead ends: 1726 [2019-01-12 03:40:14,205 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 03:40:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-01-12 03:40:14,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-01-12 03:40:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-01-12 03:40:14,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-01-12 03:40:14,259 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 97 [2019-01-12 03:40:14,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:14,260 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-01-12 03:40:14,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-01-12 03:40:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 03:40:14,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:14,265 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:14,265 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:14,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1171000047, now seen corresponding path program 1 times [2019-01-12 03:40:14,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:14,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:14,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:14,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:14,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:40:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:40:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:40:14,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:40:14,453 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-01-12 03:40:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:16,336 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-01-12 03:40:16,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:40:16,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-01-12 03:40:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:16,355 INFO L225 Difference]: With dead ends: 4707 [2019-01-12 03:40:16,355 INFO L226 Difference]: Without dead ends: 2999 [2019-01-12 03:40:16,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:40:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-01-12 03:40:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-01-12 03:40:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-01-12 03:40:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-01-12 03:40:16,426 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 123 [2019-01-12 03:40:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:16,431 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-01-12 03:40:16,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:40:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-01-12 03:40:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-12 03:40:16,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:16,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:16,438 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:16,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:16,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1063098843, now seen corresponding path program 1 times [2019-01-12 03:40:16,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:16,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-12 03:40:16,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:16,699 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 03:40:16,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:16,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 03:40:16,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:40:16,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 03:40:16,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:16,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:16,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:16,934 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 4 states. [2019-01-12 03:40:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:19,930 INFO L93 Difference]: Finished difference Result 8762 states and 10637 transitions. [2019-01-12 03:40:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:19,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-01-12 03:40:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:19,955 INFO L225 Difference]: With dead ends: 8762 [2019-01-12 03:40:19,956 INFO L226 Difference]: Without dead ends: 5765 [2019-01-12 03:40:19,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 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 03:40:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2019-01-12 03:40:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 5580. [2019-01-12 03:40:20,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5580 states. [2019-01-12 03:40:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5580 states to 5580 states and 6694 transitions. [2019-01-12 03:40:20,067 INFO L78 Accepts]: Start accepts. Automaton has 5580 states and 6694 transitions. Word has length 151 [2019-01-12 03:40:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:20,068 INFO L480 AbstractCegarLoop]: Abstraction has 5580 states and 6694 transitions. [2019-01-12 03:40:20,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 5580 states and 6694 transitions. [2019-01-12 03:40:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 03:40:20,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:20,072 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:20,072 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash 786326133, now seen corresponding path program 1 times [2019-01-12 03:40:20,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:20,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:20,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:20,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:20,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:20,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:20,443 INFO L87 Difference]: Start difference. First operand 5580 states and 6694 transitions. Second operand 4 states. [2019-01-12 03:40:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:27,342 INFO L93 Difference]: Finished difference Result 12836 states and 15535 transitions. [2019-01-12 03:40:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:27,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-01-12 03:40:27,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:27,378 INFO L225 Difference]: With dead ends: 12836 [2019-01-12 03:40:27,378 INFO L226 Difference]: Without dead ends: 7442 [2019-01-12 03:40:27,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7442 states. [2019-01-12 03:40:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7442 to 7236. [2019-01-12 03:40:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2019-01-12 03:40:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 8587 transitions. [2019-01-12 03:40:27,509 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 8587 transitions. Word has length 156 [2019-01-12 03:40:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:27,509 INFO L480 AbstractCegarLoop]: Abstraction has 7236 states and 8587 transitions. [2019-01-12 03:40:27,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 8587 transitions. [2019-01-12 03:40:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-12 03:40:27,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:27,517 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:40:27,518 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1660657955, now seen corresponding path program 1 times [2019-01-12 03:40:27,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:27,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:27,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 89 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:28,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:28,269 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 03:40:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:28,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:29,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:40:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3] total 7 [2019-01-12 03:40:29,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:40:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:40:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:40:29,148 INFO L87 Difference]: Start difference. First operand 7236 states and 8587 transitions. Second operand 8 states. [2019-01-12 03:40:29,490 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-12 03:40:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:37,183 INFO L93 Difference]: Finished difference Result 22220 states and 26520 transitions. [2019-01-12 03:40:37,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 03:40:37,183 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 241 [2019-01-12 03:40:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:37,237 INFO L225 Difference]: With dead ends: 22220 [2019-01-12 03:40:37,237 INFO L226 Difference]: Without dead ends: 15170 [2019-01-12 03:40:37,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:40:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15170 states. [2019-01-12 03:40:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15170 to 12398. [2019-01-12 03:40:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12398 states. [2019-01-12 03:40:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 14632 transitions. [2019-01-12 03:40:37,520 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 14632 transitions. Word has length 241 [2019-01-12 03:40:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:37,521 INFO L480 AbstractCegarLoop]: Abstraction has 12398 states and 14632 transitions. [2019-01-12 03:40:37,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:40:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 14632 transitions. [2019-01-12 03:40:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-01-12 03:40:37,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:37,527 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:40:37,528 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:37,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1739170223, now seen corresponding path program 1 times [2019-01-12 03:40:37,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:37,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:37,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-12 03:40:37,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:37,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:40:37,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:40:37,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:40:37,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:40:37,731 INFO L87 Difference]: Start difference. First operand 12398 states and 14632 transitions. Second operand 3 states. [2019-01-12 03:40:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:39,740 INFO L93 Difference]: Finished difference Result 27553 states and 32779 transitions. [2019-01-12 03:40:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:40:39,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2019-01-12 03:40:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:39,766 INFO L225 Difference]: With dead ends: 27553 [2019-01-12 03:40:39,766 INFO L226 Difference]: Without dead ends: 14421 [2019-01-12 03:40:39,782 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 03:40:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14421 states. [2019-01-12 03:40:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14421 to 14421. [2019-01-12 03:40:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14421 states. [2019-01-12 03:40:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14421 states to 14421 states and 16675 transitions. [2019-01-12 03:40:39,989 INFO L78 Accepts]: Start accepts. Automaton has 14421 states and 16675 transitions. Word has length 243 [2019-01-12 03:40:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:39,990 INFO L480 AbstractCegarLoop]: Abstraction has 14421 states and 16675 transitions. [2019-01-12 03:40:39,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:40:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14421 states and 16675 transitions. [2019-01-12 03:40:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-12 03:40:40,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:40,001 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:40:40,001 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1587586701, now seen corresponding path program 1 times [2019-01-12 03:40:40,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:40,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:40,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:40,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:40,348 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:40,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:40,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:40:40,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:40:40,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:40:40,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:40,350 INFO L87 Difference]: Start difference. First operand 14421 states and 16675 transitions. Second operand 5 states. [2019-01-12 03:40:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:42,689 INFO L93 Difference]: Finished difference Result 31262 states and 36386 transitions. [2019-01-12 03:40:42,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:40:42,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-01-12 03:40:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:42,720 INFO L225 Difference]: With dead ends: 31262 [2019-01-12 03:40:42,721 INFO L226 Difference]: Without dead ends: 17211 [2019-01-12 03:40:42,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17211 states. [2019-01-12 03:40:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17211 to 16084. [2019-01-12 03:40:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16084 states. [2019-01-12 03:40:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16084 states to 16084 states and 18426 transitions. [2019-01-12 03:40:42,965 INFO L78 Accepts]: Start accepts. Automaton has 16084 states and 18426 transitions. Word has length 246 [2019-01-12 03:40:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:42,965 INFO L480 AbstractCegarLoop]: Abstraction has 16084 states and 18426 transitions. [2019-01-12 03:40:42,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:40:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 16084 states and 18426 transitions. [2019-01-12 03:40:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-01-12 03:40:42,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:42,972 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:40:42,972 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -535862831, now seen corresponding path program 1 times [2019-01-12 03:40:42,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:42,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:42,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:43,561 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:40:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 139 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:43,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:43,648 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 03:40:43,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:43,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:44,056 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:44,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:40:44,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 03:40:44,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:40:44,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:40:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:40:44,103 INFO L87 Difference]: Start difference. First operand 16084 states and 18426 transitions. Second operand 7 states. [2019-01-12 03:40:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:48,721 INFO L93 Difference]: Finished difference Result 38620 states and 44094 transitions. [2019-01-12 03:40:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:40:48,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 262 [2019-01-12 03:40:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:48,753 INFO L225 Difference]: With dead ends: 38620 [2019-01-12 03:40:48,753 INFO L226 Difference]: Without dead ends: 22537 [2019-01-12 03:40:48,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:40:48,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22537 states. [2019-01-12 03:40:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22537 to 16450. [2019-01-12 03:40:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16450 states. [2019-01-12 03:40:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16450 states to 16450 states and 18418 transitions. [2019-01-12 03:40:49,035 INFO L78 Accepts]: Start accepts. Automaton has 16450 states and 18418 transitions. Word has length 262 [2019-01-12 03:40:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 16450 states and 18418 transitions. [2019-01-12 03:40:49,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:40:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 16450 states and 18418 transitions. [2019-01-12 03:40:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-12 03:40:49,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:49,048 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 03:40:49,049 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:49,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:49,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2019684113, now seen corresponding path program 1 times [2019-01-12 03:40:49,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:49,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:49,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:49,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-01-12 03:40:49,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:49,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:49,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:49,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:49,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:49,439 INFO L87 Difference]: Start difference. First operand 16450 states and 18418 transitions. Second operand 4 states. [2019-01-12 03:40:51,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:51,065 INFO L93 Difference]: Finished difference Result 33478 states and 37445 transitions. [2019-01-12 03:40:51,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:51,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-01-12 03:40:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:51,085 INFO L225 Difference]: With dead ends: 33478 [2019-01-12 03:40:51,085 INFO L226 Difference]: Without dead ends: 17398 [2019-01-12 03:40:51,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 03:40:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17398 states. [2019-01-12 03:40:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17398 to 14606. [2019-01-12 03:40:51,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14606 states. [2019-01-12 03:40:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14606 states to 14606 states and 16182 transitions. [2019-01-12 03:40:51,286 INFO L78 Accepts]: Start accepts. Automaton has 14606 states and 16182 transitions. Word has length 311 [2019-01-12 03:40:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:51,286 INFO L480 AbstractCegarLoop]: Abstraction has 14606 states and 16182 transitions. [2019-01-12 03:40:51,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 14606 states and 16182 transitions. [2019-01-12 03:40:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-01-12 03:40:51,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:51,302 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:40:51,302 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:51,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2055586056, now seen corresponding path program 1 times [2019-01-12 03:40:51,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:51,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:51,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:40:51,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:51,683 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 03:40:51,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:51,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:52,148 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 483 DAG size of output: 27 [2019-01-12 03:40:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:40:52,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:40:52,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 03:40:52,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:40:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:40:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:40:52,641 INFO L87 Difference]: Start difference. First operand 14606 states and 16182 transitions. Second operand 7 states. [2019-01-12 03:40:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:56,031 INFO L93 Difference]: Finished difference Result 32165 states and 35682 transitions. [2019-01-12 03:40:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:40:56,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 338 [2019-01-12 03:40:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:56,046 INFO L225 Difference]: With dead ends: 32165 [2019-01-12 03:40:56,047 INFO L226 Difference]: Without dead ends: 17376 [2019-01-12 03:40:56,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:40:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17376 states. [2019-01-12 03:40:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17376 to 14975. [2019-01-12 03:40:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14975 states. [2019-01-12 03:40:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14975 states to 14975 states and 16512 transitions. [2019-01-12 03:40:56,232 INFO L78 Accepts]: Start accepts. Automaton has 14975 states and 16512 transitions. Word has length 338 [2019-01-12 03:40:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:56,233 INFO L480 AbstractCegarLoop]: Abstraction has 14975 states and 16512 transitions. [2019-01-12 03:40:56,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:40:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 14975 states and 16512 transitions. [2019-01-12 03:40:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-01-12 03:40:56,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:56,245 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 03:40:56,246 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash 209609097, now seen corresponding path program 1 times [2019-01-12 03:40:56,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:56,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-12 03:40:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:56,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:56,762 INFO L87 Difference]: Start difference. First operand 14975 states and 16512 transitions. Second operand 4 states. [2019-01-12 03:40:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:58,087 INFO L93 Difference]: Finished difference Result 32346 states and 35608 transitions. [2019-01-12 03:40:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:58,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 394 [2019-01-12 03:40:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:58,104 INFO L225 Difference]: With dead ends: 32346 [2019-01-12 03:40:58,104 INFO L226 Difference]: Without dead ends: 17741 [2019-01-12 03:40:58,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 03:40:58,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17741 states. [2019-01-12 03:40:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17741 to 13869. [2019-01-12 03:40:58,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13869 states. [2019-01-12 03:40:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13869 states to 13869 states and 15194 transitions. [2019-01-12 03:40:58,266 INFO L78 Accepts]: Start accepts. Automaton has 13869 states and 15194 transitions. Word has length 394 [2019-01-12 03:40:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:58,266 INFO L480 AbstractCegarLoop]: Abstraction has 13869 states and 15194 transitions. [2019-01-12 03:40:58,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13869 states and 15194 transitions. [2019-01-12 03:40:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-01-12 03:40:58,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:58,276 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:40:58,276 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:58,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -584777729, now seen corresponding path program 1 times [2019-01-12 03:40:58,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:58,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:58,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:58,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:58,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 117 proven. 284 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:58,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:58,727 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 03:40:58,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:58,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:59,547 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 19 [2019-01-12 03:41:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 170 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-12 03:41:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:41:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:41:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:41:00,764 INFO L87 Difference]: Start difference. First operand 13869 states and 15194 transitions. Second operand 10 states. [2019-01-12 03:41:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:08,842 INFO L93 Difference]: Finished difference Result 31068 states and 33982 transitions. [2019-01-12 03:41:08,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:41:08,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 424 [2019-01-12 03:41:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:08,860 INFO L225 Difference]: With dead ends: 31068 [2019-01-12 03:41:08,860 INFO L226 Difference]: Without dead ends: 17201 [2019-01-12 03:41:08,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-01-12 03:41:08,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17201 states. [2019-01-12 03:41:09,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17201 to 14789. [2019-01-12 03:41:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14789 states. [2019-01-12 03:41:09,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14789 states to 14789 states and 16143 transitions. [2019-01-12 03:41:09,018 INFO L78 Accepts]: Start accepts. Automaton has 14789 states and 16143 transitions. Word has length 424 [2019-01-12 03:41:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:09,019 INFO L480 AbstractCegarLoop]: Abstraction has 14789 states and 16143 transitions. [2019-01-12 03:41:09,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:41:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14789 states and 16143 transitions. [2019-01-12 03:41:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2019-01-12 03:41:09,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:09,031 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:09,031 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2087249021, now seen corresponding path program 1 times [2019-01-12 03:41:09,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:09,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:09,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:09,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:09,474 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-01-12 03:41:09,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:41:09,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:41:09,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:41:09,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:41:09,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:09,476 INFO L87 Difference]: Start difference. First operand 14789 states and 16143 transitions. Second operand 3 states. [2019-01-12 03:41:10,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:10,314 INFO L93 Difference]: Finished difference Result 28276 states and 30810 transitions. [2019-01-12 03:41:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:41:10,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 475 [2019-01-12 03:41:10,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:10,329 INFO L225 Difference]: With dead ends: 28276 [2019-01-12 03:41:10,329 INFO L226 Difference]: Without dead ends: 13857 [2019-01-12 03:41:10,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:41:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13857 states. [2019-01-12 03:41:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13857 to 13670. [2019-01-12 03:41:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13670 states. [2019-01-12 03:41:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13670 states to 13670 states and 14851 transitions. [2019-01-12 03:41:10,582 INFO L78 Accepts]: Start accepts. Automaton has 13670 states and 14851 transitions. Word has length 475 [2019-01-12 03:41:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:10,583 INFO L480 AbstractCegarLoop]: Abstraction has 13670 states and 14851 transitions. [2019-01-12 03:41:10,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:41:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 13670 states and 14851 transitions. [2019-01-12 03:41:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-01-12 03:41:10,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:10,605 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:41:10,605 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash -522311216, now seen corresponding path program 1 times [2019-01-12 03:41:10,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:10,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:10,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:10,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:11,704 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-01-12 03:41:12,084 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2019-01-12 03:41:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 816 proven. 229 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-12 03:41:12,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:12,676 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 03:41:12,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:12,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 816 proven. 229 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-12 03:41:14,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:14,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-01-12 03:41:14,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 03:41:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 03:41:14,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:41:14,113 INFO L87 Difference]: Start difference. First operand 13670 states and 14851 transitions. Second operand 13 states. [2019-01-12 03:41:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:19,597 INFO L93 Difference]: Finished difference Result 27689 states and 30017 transitions. [2019-01-12 03:41:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:41:19,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 647 [2019-01-12 03:41:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:19,614 INFO L225 Difference]: With dead ends: 27689 [2019-01-12 03:41:19,614 INFO L226 Difference]: Without dead ends: 14387 [2019-01-12 03:41:19,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 643 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=207, Invalid=443, Unknown=0, NotChecked=0, Total=650 [2019-01-12 03:41:19,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14387 states. [2019-01-12 03:41:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14387 to 12368. [2019-01-12 03:41:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12368 states. [2019-01-12 03:41:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12368 states to 12368 states and 13380 transitions. [2019-01-12 03:41:19,845 INFO L78 Accepts]: Start accepts. Automaton has 12368 states and 13380 transitions. Word has length 647 [2019-01-12 03:41:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:19,845 INFO L480 AbstractCegarLoop]: Abstraction has 12368 states and 13380 transitions. [2019-01-12 03:41:19,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 03:41:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12368 states and 13380 transitions. [2019-01-12 03:41:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-01-12 03:41:19,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:41:19,864 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:41:19,865 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:41:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:41:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1699215781, now seen corresponding path program 1 times [2019-01-12 03:41:19,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:41:19,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:41:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:19,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:41:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:20,695 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:41:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 269 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:41:21,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:41:21,518 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 03:41:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:41:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:41:21,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:41:22,530 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2019-01-12 03:41:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 732 proven. 440 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-12 03:41:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:41:24,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 14 [2019-01-12 03:41:24,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 03:41:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 03:41:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:41:24,185 INFO L87 Difference]: Start difference. First operand 12368 states and 13380 transitions. Second operand 15 states. [2019-01-12 03:41:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:41:37,661 INFO L93 Difference]: Finished difference Result 27886 states and 30065 transitions. [2019-01-12 03:41:37,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-12 03:41:37,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 708 [2019-01-12 03:41:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:41:37,663 INFO L225 Difference]: With dead ends: 27886 [2019-01-12 03:41:37,663 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:41:37,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 748 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2019-01-12 03:41:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:41:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:41:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:41:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:41:37,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 708 [2019-01-12 03:41:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:41:37,673 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:41:37,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 03:41:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:41:37,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:41:37,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:41:37,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:37,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:38,961 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 696 DAG size of output: 445 [2019-01-12 03:41:38,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:39,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:40,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:41:40,010 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 693 DAG size of output: 444 [2019-01-12 03:41:43,490 WARN L181 SmtUtils]: Spent 3.45 s on a formula simplification. DAG size of input: 380 DAG size of output: 149 [2019-01-12 03:41:46,652 WARN L181 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 380 DAG size of output: 149 [2019-01-12 03:41:46,656 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:41:46,656 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:41:46,656 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:41:46,657 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:41:46,658 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:41:46,659 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,659 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse8 (= ~a25~0 12)) (.cse12 (< 138 ~a23~0)) (.cse17 (<= ~a29~0 130)) (.cse3 (= 1 ~a4~0)) (.cse11 (= ~a25~0 10))) (let ((.cse25 (<= ~a29~0 245)) (.cse21 (<= 130 ~a29~0)) (.cse6 (not .cse11)) (.cse28 (= ~a4~0 1)) (.cse29 (+ ~a23~0 43)) (.cse27 (or (and .cse8 .cse17 .cse3) (and (<= ~a25~0 12) .cse17 .cse3 .cse12) (and .cse17 .cse3 .cse11))) (.cse0 (= ~a8~0 15)) (.cse4 (= ~a3~0 1)) (.cse22 (= ~a25~0 13))) (let ((.cse1 (not .cse22)) (.cse2 (<= ~a29~0 599998)) (.cse18 (and .cse27 .cse0 .cse4)) (.cse24 (not .cse8)) (.cse15 (= ~a25~0 11)) (.cse26 (= ~a25~0 9)) (.cse9 (< 0 .cse29)) (.cse20 (<= ~a25~0 9)) (.cse10 (exists ((v_prenex_40 Int)) (and (<= 0 v_prenex_40) (<= ~a29~0 (+ (mod v_prenex_40 299861) 300139)) (< 277 v_prenex_40)))) (.cse19 (not .cse28)) (.cse5 (<= .cse29 0)) (.cse13 (< 140 ~a29~0)) (.cse16 (<= ~a29~0 277)) (.cse7 (and .cse25 .cse3 .cse21 .cse6))) (or (and .cse0 (exists ((v_prenex_33 Int)) (and (<= 0 v_prenex_33) (<= (+ (mod v_prenex_33 299861) 10250) ~a29~0) (< 140 v_prenex_33))) .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse4 .cse7) (and .cse8 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9) (<= (+ ~a29~0 22) 0) .cse4) (and .cse0 .cse10 .cse11 .cse3 .cse4 .cse12) (and (and .cse0 (or (and .cse13 (let ((.cse14 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse14 .cse15) (and .cse8 .cse9 .cse14)))) (and .cse8 .cse13 .cse16 .cse12)) .cse4) .cse3) (and .cse0 .cse17 .cse11 .cse4) (and (<= (+ ~a29~0 21) 0) .cse18) (and .cse0 (<= (+ ~a29~0 275923) 0) .cse1 .cse4 .cse5) (and .cse0 .cse2 .cse15 .cse19 .cse4) (and .cse20 .cse3 .cse21 .cse5) (and .cse0 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse23 (+ v_~a29~0_503 69157))) (and (<= ~a29~0 (+ (mod .cse23 299861) 300138)) (<= 0 .cse23) (<= 130 v_~a29~0_503)))) .cse3 .cse4 .cse12) (and .cse0 .cse9 .cse24 .cse25 .cse19 .cse4) (and .cse26 .cse27) (and .cse0 .cse25 .cse11 .cse3 .cse4) (and .cse18 .cse24) (and .cse28 .cse11 .cse5) (and .cse25 .cse3 .cse21 .cse5) (and .cse0 .cse9 .cse10 .cse15 .cse21 .cse3 .cse4) (and .cse22 .cse3 .cse12 (<= ~a23~0 262)) (and .cse27 .cse5) (and (or (and .cse26 .cse9) (and .cse20 .cse21)) .cse0 .cse10 .cse3 .cse4) (and .cse19 .cse4 (or (and .cse8 .cse0 .cse13 .cse16 .cse5) (and .cse8 .cse0 (<= ~a4~0 0) .cse13 .cse16))) (and .cse22 (<= ~a23~0 306) .cse7))))) [2019-01-12 03:41:46,659 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,659 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,659 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:41:46,660 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,661 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:41:46,662 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,663 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,664 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:41:46,665 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:41:46,666 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:41:46,667 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:41:46,668 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,669 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,670 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,671 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:41:46,672 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:41:46,673 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,674 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,675 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:41:46,676 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:41:46,677 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,678 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,679 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,680 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse8 (= ~a25~0 12)) (.cse12 (< 138 ~a23~0)) (.cse17 (<= ~a29~0 130)) (.cse3 (= 1 ~a4~0)) (.cse11 (= ~a25~0 10))) (let ((.cse25 (<= ~a29~0 245)) (.cse21 (<= 130 ~a29~0)) (.cse6 (not .cse11)) (.cse28 (= ~a4~0 1)) (.cse29 (+ ~a23~0 43)) (.cse27 (or (and .cse8 .cse17 .cse3) (and (<= ~a25~0 12) .cse17 .cse3 .cse12) (and .cse17 .cse3 .cse11))) (.cse0 (= ~a8~0 15)) (.cse4 (= ~a3~0 1)) (.cse22 (= ~a25~0 13))) (let ((.cse1 (not .cse22)) (.cse2 (<= ~a29~0 599998)) (.cse18 (and .cse27 .cse0 .cse4)) (.cse24 (not .cse8)) (.cse15 (= ~a25~0 11)) (.cse26 (= ~a25~0 9)) (.cse9 (< 0 .cse29)) (.cse20 (<= ~a25~0 9)) (.cse10 (exists ((v_prenex_40 Int)) (and (<= 0 v_prenex_40) (<= ~a29~0 (+ (mod v_prenex_40 299861) 300139)) (< 277 v_prenex_40)))) (.cse19 (not .cse28)) (.cse5 (<= .cse29 0)) (.cse13 (< 140 ~a29~0)) (.cse16 (<= ~a29~0 277)) (.cse7 (and .cse25 .cse3 .cse21 .cse6))) (or (and .cse0 (exists ((v_prenex_33 Int)) (and (<= 0 v_prenex_33) (<= (+ (mod v_prenex_33 299861) 10250) ~a29~0) (< 140 v_prenex_33))) .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6) (and .cse0 (<= 13 ~a25~0) .cse4 .cse7) (and .cse8 .cse0 (or (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse9) (<= (+ ~a29~0 22) 0) .cse4) (and .cse0 .cse10 .cse11 .cse3 .cse4 .cse12) (and (and .cse0 (or (and .cse13 (let ((.cse14 (exists ((v_~a29~0_499 Int)) (and (<= ~a29~0 (+ (mod v_~a29~0_499 15) 261)) (<= 130 v_~a29~0_499) (<= 0 v_~a29~0_499))))) (or (and .cse14 .cse15) (and .cse8 .cse9 .cse14)))) (and .cse8 .cse13 .cse16 .cse12)) .cse4) .cse3) (and .cse0 .cse17 .cse11 .cse4) (and (<= (+ ~a29~0 21) 0) .cse18) (and .cse0 (<= (+ ~a29~0 275923) 0) .cse1 .cse4 .cse5) (and .cse0 .cse2 .cse15 .cse19 .cse4) (and .cse20 .cse3 .cse21 .cse5) (and .cse0 .cse22 (exists ((v_~a29~0_503 Int)) (let ((.cse23 (+ v_~a29~0_503 69157))) (and (<= ~a29~0 (+ (mod .cse23 299861) 300138)) (<= 0 .cse23) (<= 130 v_~a29~0_503)))) .cse3 .cse4 .cse12) (and .cse0 .cse9 .cse24 .cse25 .cse19 .cse4) (and .cse26 .cse27) (and .cse0 .cse25 .cse11 .cse3 .cse4) (and .cse18 .cse24) (and .cse28 .cse11 .cse5) (and .cse25 .cse3 .cse21 .cse5) (and .cse0 .cse9 .cse10 .cse15 .cse21 .cse3 .cse4) (and .cse22 .cse3 .cse12 (<= ~a23~0 262)) (and .cse27 .cse5) (and (or (and .cse26 .cse9) (and .cse20 .cse21)) .cse0 .cse10 .cse3 .cse4) (and .cse19 .cse4 (or (and .cse8 .cse0 .cse13 .cse16 .cse5) (and .cse8 .cse0 (<= ~a4~0 0) .cse13 .cse16))) (and .cse22 (<= ~a23~0 306) .cse7))))) [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,681 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:41:46,682 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,682 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,682 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:41:46,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,726 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,727 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,728 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,729 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,735 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:46,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,736 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:46,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:46,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,741 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:46,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:41:46 BoogieIcfgContainer [2019-01-12 03:41:46,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:41:46,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:41:46,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:41:46,752 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:41:46,753 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:40:07" (3/4) ... [2019-01-12 03:41:46,761 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:41:46,808 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:41:46,810 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:41:46,867 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) [2019-01-12 03:41:46,873 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) [2019-01-12 03:41:47,082 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:41:47,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:41:47,084 INFO L168 Benchmark]: Toolchain (without parser) took 105563.14 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 948.7 MB in the beginning and 1.6 GB in the end (delta: -681.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,084 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 03:41:47,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -203.9 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 174.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,086 INFO L168 Benchmark]: Boogie Preprocessor took 155.78 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,086 INFO L168 Benchmark]: RCFGBuilder took 4130.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.2 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,087 INFO L168 Benchmark]: TraceAbstraction took 99605.91 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 941.2 MB in the beginning and 1.7 GB in the end (delta: -726.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,087 INFO L168 Benchmark]: Witness Printer took 335.65 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:41:47,092 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 1154.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -203.9 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 174.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 155.78 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4130.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.2 MB in the end (delta: 177.3 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 99605.91 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 941.2 MB in the beginning and 1.7 GB in the end (delta: -726.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 335.65 ms. Allocated memory is still 2.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 38.1 MB). Peak memory consumption was 38.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-01-12 03:41:47,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,106 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,110 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,111 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,112 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,113 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 03:41:47,141 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,142 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,143 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:41:47,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-01-12 03:41:47,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_503,QUANTIFIED] [2019-01-12 03:41:47,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] [2019-01-12 03:41:47,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_40,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((a8 == 15 && (\exists v_prenex_33 : int :: (0 <= v_prenex_33 && v_prenex_33 % 299861 + 10250 <= a29) && 140 < v_prenex_33)) && !(a25 == 13)) && a29 <= 599998) && !(1 == a4)) && a3 == 1) && a23 + 43 <= 0) && !(a25 == 10)) || (((a8 == 15 && 13 <= a25) && a3 == 1) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10))) || ((((a25 == 12 && a8 == 15) && (!(3 == input) || 0 < a23 + 43)) && a29 + 22 <= 0) && a3 == 1)) || (((((a8 == 15 && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 10) && 1 == a4) && a3 == 1) && 138 < a23)) || (((a8 == 15 && ((140 < a29 && (((\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499) && a25 == 11) || ((a25 == 12 && 0 < a23 + 43) && (\exists v_~a29~0_499 : int :: (a29 <= v_~a29~0_499 % 15 + 261 && 130 <= v_~a29~0_499) && 0 <= v_~a29~0_499)))) || (((a25 == 12 && 140 < a29) && a29 <= 277) && 138 < a23))) && a3 == 1) && 1 == a4)) || (((a8 == 15 && a29 <= 130) && a25 == 10) && a3 == 1)) || (a29 + 21 <= 0 && (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1)) || ((((a8 == 15 && a29 + 275923 <= 0) && !(a25 == 13)) && a3 == 1) && a23 + 43 <= 0)) || ((((a8 == 15 && a29 <= 599998) && a25 == 11) && !(a4 == 1)) && a3 == 1)) || (((a25 <= 9 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((((a8 == 15 && a25 == 13) && (\exists v_~a29~0_503 : int :: (a29 <= (v_~a29~0_503 + 69157) % 299861 + 300138 && 0 <= v_~a29~0_503 + 69157) && 130 <= v_~a29~0_503)) && 1 == a4) && a3 == 1) && 138 < a23)) || (((((a8 == 15 && 0 < a23 + 43) && !(a25 == 12)) && a29 <= 245) && !(a4 == 1)) && a3 == 1)) || (a25 == 9 && ((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)))) || ((((a8 == 15 && a29 <= 245) && a25 == 10) && 1 == a4) && a3 == 1)) || (((((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a8 == 15) && a3 == 1) && !(a25 == 12))) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || ((((((a8 == 15 && 0 < a23 + 43) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && a25 == 11) && 130 <= a29) && 1 == a4) && a3 == 1)) || (((a25 == 13 && 1 == a4) && 138 < a23) && a23 <= 262)) || (((((a25 == 12 && a29 <= 130) && 1 == a4) || (((a25 <= 12 && a29 <= 130) && 1 == a4) && 138 < a23)) || ((a29 <= 130 && 1 == a4) && a25 == 10)) && a23 + 43 <= 0)) || ((((((a25 == 9 && 0 < a23 + 43) || (a25 <= 9 && 130 <= a29)) && a8 == 15) && (\exists v_prenex_40 : int :: (0 <= v_prenex_40 && a29 <= v_prenex_40 % 299861 + 300139) && 277 < v_prenex_40)) && 1 == a4) && a3 == 1)) || ((!(a4 == 1) && a3 == 1) && (((((a25 == 12 && a8 == 15) && 140 < a29) && a29 <= 277) && a23 + 43 <= 0) || ((((a25 == 12 && a8 == 15) && a4 <= 0) && 140 < a29) && a29 <= 277)))) || ((a25 == 13 && a23 <= 306) && ((a29 <= 245 && 1 == a4) && 130 <= a29) && !(a25 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 99.4s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 69.6s AutomataDifference, 0.0s DeadEndRemovalTime, 8.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2322 SDtfs, 17171 SDslu, 1293 SDs, 0 SdLazy, 40197 SolverSat, 5848 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2905 GetRequests, 2768 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16450occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 24079 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 202 NumberOfFragments, 1379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 69793 FormulaSimplificationTreeSizeReduction, 2.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 36570 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.6s InterpolantComputationTime, 7616 NumberOfCodeBlocks, 7616 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 7593 ConstructedInterpolants, 789 QuantifiedInterpolants, 24887339 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3633 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 5897/8825 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...