./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label48_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/Problem14_label48_true-unreach-call_false-termination.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 9f9c3a25932676bec80072ad05bb4d96280afa80 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:19:00,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:19:00,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:19:00,108 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:19:00,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:19:00,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:19:00,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:19:00,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:19:00,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:19:00,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:19:00,117 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:19:00,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:19:00,119 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:19:00,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:19:00,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:19:00,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:19:00,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:19:00,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:19:00,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:19:00,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:19:00,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:19:00,132 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:19:00,135 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:19:00,136 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:19:00,136 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:19:00,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:19:00,139 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:19:00,139 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:19:00,140 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:19:00,142 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:19:00,142 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:19:00,143 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:19:00,144 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:19:00,144 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:19:00,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:19:00,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:19:00,147 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:19:00,164 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:19:00,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:19:00,166 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:19:00,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:19:00,167 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:19:00,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:19:00,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:19:00,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:19:00,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:19:00,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:19:00,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:19:00,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:19:00,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:19:00,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:19:00,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:19:00,170 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:19:00,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:19:00,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:19:00,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:19:00,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:19:00,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:19:00,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:19:00,173 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:19:00,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:19:00,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:19:00,174 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:19:00,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:19:00,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:19:00,174 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 -> 9f9c3a25932676bec80072ad05bb4d96280afa80 [2018-12-30 23:19:00,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:19:00,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:19:00,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:19:00,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:19:00,230 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:19:00,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label48_true-unreach-call_false-termination.c [2018-12-30 23:19:00,298 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98853c847/01367f1a8f6d41169021b8007ac81624/FLAGed43b334b [2018-12-30 23:19:00,843 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:19:00,847 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label48_true-unreach-call_false-termination.c [2018-12-30 23:19:00,863 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98853c847/01367f1a8f6d41169021b8007ac81624/FLAGed43b334b [2018-12-30 23:19:01,099 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98853c847/01367f1a8f6d41169021b8007ac81624 [2018-12-30 23:19:01,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:19:01,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:19:01,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:01,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:19:01,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:19:01,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:01,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc38887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01, skipping insertion in model container [2018-12-30 23:19:01,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:01,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:19:01,210 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:19:01,721 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:01,727 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:19:01,891 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:19:01,914 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:19:01,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01 WrapperNode [2018-12-30 23:19:01,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:19:01,916 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:01,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:19:01,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:19:02,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:19:02,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:19:02,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:19:02,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:19:02,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (1/1) ... [2018-12-30 23:19:02,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:19:02,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:19:02,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:19:02,274 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:19:02,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (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 [2018-12-30 23:19:02,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:19:02,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:19:06,252 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:19:06,252 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 23:19:06,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:06 BoogieIcfgContainer [2018-12-30 23:19:06,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:19:06,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:19:06,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:19:06,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:19:06,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:19:01" (1/3) ... [2018-12-30 23:19:06,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc18757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:06, skipping insertion in model container [2018-12-30 23:19:06,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:19:01" (2/3) ... [2018-12-30 23:19:06,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc18757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:19:06, skipping insertion in model container [2018-12-30 23:19:06,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:06" (3/3) ... [2018-12-30 23:19:06,262 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label48_true-unreach-call_false-termination.c [2018-12-30 23:19:06,273 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:19:06,282 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:19:06,303 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:19:06,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:19:06,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:19:06,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:19:06,343 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:19:06,343 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:19:06,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:19:06,344 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:19:06,344 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:19:06,344 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:19:06,378 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2018-12-30 23:19:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-30 23:19:06,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:06,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:06,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:06,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:06,410 INFO L82 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2018-12-30 23:19:06,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:06,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:06,950 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:19:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:19:07,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:07,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:07,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:07,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:07,043 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2018-12-30 23:19:10,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:10,074 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2018-12-30 23:19:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:10,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-30 23:19:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:10,102 INFO L225 Difference]: With dead ends: 850 [2018-12-30 23:19:10,102 INFO L226 Difference]: Without dead ends: 538 [2018-12-30 23:19:10,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-12-30 23:19:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2018-12-30 23:19:10,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2018-12-30 23:19:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2018-12-30 23:19:10,199 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 38 [2018-12-30 23:19:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:10,199 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2018-12-30 23:19:10,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2018-12-30 23:19:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-30 23:19:10,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:10,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:10,206 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:10,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1126953967, now seen corresponding path program 1 times [2018-12-30 23:19:10,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:10,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:10,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:10,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:10,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:19:10,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:10,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:10,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:10,528 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2018-12-30 23:19:12,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:12,509 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2018-12-30 23:19:12,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:12,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-30 23:19:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:12,529 INFO L225 Difference]: With dead ends: 2142 [2018-12-30 23:19:12,530 INFO L226 Difference]: Without dead ends: 1606 [2018-12-30 23:19:12,536 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 [2018-12-30 23:19:12,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2018-12-30 23:19:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2018-12-30 23:19:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2018-12-30 23:19:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1993 transitions. [2018-12-30 23:19:12,615 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1993 transitions. Word has length 120 [2018-12-30 23:19:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:12,617 INFO L480 AbstractCegarLoop]: Abstraction has 1428 states and 1993 transitions. [2018-12-30 23:19:12,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1993 transitions. [2018-12-30 23:19:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-30 23:19:12,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:12,630 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:12,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1627228242, now seen corresponding path program 1 times [2018-12-30 23:19:12,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:12,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:12,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:12,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-30 23:19:12,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:12,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:12,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:12,814 INFO L87 Difference]: Start difference. First operand 1428 states and 1993 transitions. Second operand 4 states. [2018-12-30 23:19:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:16,474 INFO L93 Difference]: Finished difference Result 4990 states and 7108 transitions. [2018-12-30 23:19:16,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:16,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-12-30 23:19:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:16,492 INFO L225 Difference]: With dead ends: 4990 [2018-12-30 23:19:16,493 INFO L226 Difference]: Without dead ends: 3564 [2018-12-30 23:19:16,496 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 [2018-12-30 23:19:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2018-12-30 23:19:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 2852. [2018-12-30 23:19:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3785 transitions. [2018-12-30 23:19:16,556 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3785 transitions. Word has length 183 [2018-12-30 23:19:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:16,557 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3785 transitions. [2018-12-30 23:19:16,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3785 transitions. [2018-12-30 23:19:16,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 23:19:16,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:16,561 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:16,561 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:16,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash -233481583, now seen corresponding path program 1 times [2018-12-30 23:19:16,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:16,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:16,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 138 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-30 23:19:16,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:16,857 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 [2018-12-30 23:19:16,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:16,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-30 23:19:17,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:17,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2018-12-30 23:19:17,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 23:19:17,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 23:19:17,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:19:17,130 INFO L87 Difference]: Start difference. First operand 2852 states and 3785 transitions. Second operand 6 states. [2018-12-30 23:19:18,633 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-12-30 23:19:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:24,409 INFO L93 Difference]: Finished difference Result 7747 states and 10113 transitions. [2018-12-30 23:19:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:19:24,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 197 [2018-12-30 23:19:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:24,429 INFO L225 Difference]: With dead ends: 7747 [2018-12-30 23:19:24,429 INFO L226 Difference]: Without dead ends: 4276 [2018-12-30 23:19:24,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2018-12-30 23:19:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 2674. [2018-12-30 23:19:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2018-12-30 23:19:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2990 transitions. [2018-12-30 23:19:24,498 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2990 transitions. Word has length 197 [2018-12-30 23:19:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:24,499 INFO L480 AbstractCegarLoop]: Abstraction has 2674 states and 2990 transitions. [2018-12-30 23:19:24,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 23:19:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2990 transitions. [2018-12-30 23:19:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-12-30 23:19:24,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:24,513 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-12-30 23:19:24,513 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:24,513 INFO L82 PathProgramCache]: Analyzing trace with hash 929105321, now seen corresponding path program 1 times [2018-12-30 23:19:24,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:24,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 569 proven. 4 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-30 23:19:25,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:25,509 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 [2018-12-30 23:19:25,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:25,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 550 proven. 23 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-30 23:19:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-12-30 23:19:26,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:26,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:26,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:26,297 INFO L87 Difference]: Start difference. First operand 2674 states and 2990 transitions. Second operand 8 states. [2018-12-30 23:19:29,669 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-12-30 23:19:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:31,657 INFO L93 Difference]: Finished difference Result 6109 states and 6752 transitions. [2018-12-30 23:19:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:31,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 530 [2018-12-30 23:19:31,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:31,672 INFO L225 Difference]: With dead ends: 6109 [2018-12-30 23:19:31,673 INFO L226 Difference]: Without dead ends: 3437 [2018-12-30 23:19:31,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-12-30 23:19:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2018-12-30 23:19:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2852. [2018-12-30 23:19:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3169 transitions. [2018-12-30 23:19:31,729 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3169 transitions. Word has length 530 [2018-12-30 23:19:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:31,730 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3169 transitions. [2018-12-30 23:19:31,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3169 transitions. [2018-12-30 23:19:31,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2018-12-30 23:19:31,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:31,747 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:31,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2057487060, now seen corresponding path program 1 times [2018-12-30 23:19:31,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:31,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:31,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:31,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:32,163 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-12-30 23:19:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 1050 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-12-30 23:19:32,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:32,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:32,383 INFO L87 Difference]: Start difference. First operand 2852 states and 3169 transitions. Second operand 3 states. [2018-12-30 23:19:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:33,251 INFO L93 Difference]: Finished difference Result 6058 states and 6701 transitions. [2018-12-30 23:19:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:33,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 621 [2018-12-30 23:19:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:33,265 INFO L225 Difference]: With dead ends: 6058 [2018-12-30 23:19:33,265 INFO L226 Difference]: Without dead ends: 3030 [2018-12-30 23:19:33,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2018-12-30 23:19:33,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2018-12-30 23:19:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2018-12-30 23:19:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3091 transitions. [2018-12-30 23:19:33,320 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3091 transitions. Word has length 621 [2018-12-30 23:19:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:33,321 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3091 transitions. [2018-12-30 23:19:33,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3091 transitions. [2018-12-30 23:19:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-12-30 23:19:33,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:33,338 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:33,339 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:33,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash -69619708, now seen corresponding path program 1 times [2018-12-30 23:19:33,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:33,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:33,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:33,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 664 proven. 174 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-12-30 23:19:34,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:34,620 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 [2018-12-30 23:19:34,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:34,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 809 proven. 29 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-12-30 23:19:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:35,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:19:35,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:35,841 INFO L87 Difference]: Start difference. First operand 2852 states and 3091 transitions. Second operand 8 states. [2018-12-30 23:19:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:37,812 INFO L93 Difference]: Finished difference Result 6470 states and 6981 transitions. [2018-12-30 23:19:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:19:37,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 664 [2018-12-30 23:19:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:37,836 INFO L225 Difference]: With dead ends: 6470 [2018-12-30 23:19:37,837 INFO L226 Difference]: Without dead ends: 3620 [2018-12-30 23:19:37,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-30 23:19:37,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3620 states. [2018-12-30 23:19:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3620 to 3208. [2018-12-30 23:19:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2018-12-30 23:19:37,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3456 transitions. [2018-12-30 23:19:37,899 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3456 transitions. Word has length 664 [2018-12-30 23:19:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:37,901 INFO L480 AbstractCegarLoop]: Abstraction has 3208 states and 3456 transitions. [2018-12-30 23:19:37,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3456 transitions. [2018-12-30 23:19:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2018-12-30 23:19:37,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:37,909 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:37,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:37,910 INFO L82 PathProgramCache]: Analyzing trace with hash 558972531, now seen corresponding path program 1 times [2018-12-30 23:19:37,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:37,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-12-30 23:19:38,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:38,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:38,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:38,774 INFO L87 Difference]: Start difference. First operand 3208 states and 3456 transitions. Second operand 7 states. [2018-12-30 23:19:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:39,669 INFO L93 Difference]: Finished difference Result 6642 states and 7142 transitions. [2018-12-30 23:19:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:19:39,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 666 [2018-12-30 23:19:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:39,685 INFO L225 Difference]: With dead ends: 6642 [2018-12-30 23:19:39,685 INFO L226 Difference]: Without dead ends: 3386 [2018-12-30 23:19:39,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2018-12-30 23:19:39,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3208. [2018-12-30 23:19:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3208 states. [2018-12-30 23:19:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 3414 transitions. [2018-12-30 23:19:39,754 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 3414 transitions. Word has length 666 [2018-12-30 23:19:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:39,756 INFO L480 AbstractCegarLoop]: Abstraction has 3208 states and 3414 transitions. [2018-12-30 23:19:39,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:19:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 3414 transitions. [2018-12-30 23:19:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-30 23:19:39,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:39,765 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:39,765 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:39,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash -711897079, now seen corresponding path program 1 times [2018-12-30 23:19:39,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:39,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:39,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:41,040 WARN L181 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2018-12-30 23:19:41,289 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-30 23:19:41,486 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-30 23:19:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2018-12-30 23:19:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:19:42,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:19:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:19:42,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:19:42,365 INFO L87 Difference]: Start difference. First operand 3208 states and 3414 transitions. Second operand 7 states. [2018-12-30 23:19:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:43,995 INFO L93 Difference]: Finished difference Result 7010 states and 7441 transitions. [2018-12-30 23:19:43,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:19:43,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 675 [2018-12-30 23:19:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:44,013 INFO L225 Difference]: With dead ends: 7010 [2018-12-30 23:19:44,013 INFO L226 Difference]: Without dead ends: 3804 [2018-12-30 23:19:44,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:19:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2018-12-30 23:19:44,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3386. [2018-12-30 23:19:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3386 states. [2018-12-30 23:19:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3595 transitions. [2018-12-30 23:19:44,084 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3595 transitions. Word has length 675 [2018-12-30 23:19:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:44,085 INFO L480 AbstractCegarLoop]: Abstraction has 3386 states and 3595 transitions. [2018-12-30 23:19:44,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:19:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3595 transitions. [2018-12-30 23:19:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2018-12-30 23:19:44,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:44,094 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:44,094 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 105793533, now seen corresponding path program 1 times [2018-12-30 23:19:44,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:44,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:44,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:44,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:44,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 1070 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2018-12-30 23:19:44,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:44,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:19:44,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:19:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:19:44,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:19:44,510 INFO L87 Difference]: Start difference. First operand 3386 states and 3595 transitions. Second operand 3 states. [2018-12-30 23:19:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:45,120 INFO L93 Difference]: Finished difference Result 7482 states and 7932 transitions. [2018-12-30 23:19:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:19:45,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 691 [2018-12-30 23:19:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:45,140 INFO L225 Difference]: With dead ends: 7482 [2018-12-30 23:19:45,140 INFO L226 Difference]: Without dead ends: 4098 [2018-12-30 23:19:45,144 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 [2018-12-30 23:19:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4098 states. [2018-12-30 23:19:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4098 to 3742. [2018-12-30 23:19:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2018-12-30 23:19:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3950 transitions. [2018-12-30 23:19:45,197 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3950 transitions. Word has length 691 [2018-12-30 23:19:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:45,198 INFO L480 AbstractCegarLoop]: Abstraction has 3742 states and 3950 transitions. [2018-12-30 23:19:45,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:19:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3950 transitions. [2018-12-30 23:19:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2018-12-30 23:19:45,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:45,209 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:45,209 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1452861494, now seen corresponding path program 1 times [2018-12-30 23:19:45,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:45,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:45,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:45,659 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:19:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2206 backedges. 1415 proven. 0 refuted. 0 times theorem prover too weak. 791 trivial. 0 not checked. [2018-12-30 23:19:46,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:46,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:19:46,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:19:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:19:46,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:19:46,143 INFO L87 Difference]: Start difference. First operand 3742 states and 3950 transitions. Second operand 4 states. [2018-12-30 23:19:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:47,130 INFO L93 Difference]: Finished difference Result 8728 states and 9265 transitions. [2018-12-30 23:19:47,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:47,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 846 [2018-12-30 23:19:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:47,146 INFO L225 Difference]: With dead ends: 8728 [2018-12-30 23:19:47,146 INFO L226 Difference]: Without dead ends: 4988 [2018-12-30 23:19:47,152 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 [2018-12-30 23:19:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2018-12-30 23:19:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4632. [2018-12-30 23:19:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2018-12-30 23:19:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4858 transitions. [2018-12-30 23:19:47,232 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4858 transitions. Word has length 846 [2018-12-30 23:19:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:47,233 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4858 transitions. [2018-12-30 23:19:47,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:19:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4858 transitions. [2018-12-30 23:19:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2018-12-30 23:19:47,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:47,246 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:19:47,247 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1223574979, now seen corresponding path program 1 times [2018-12-30 23:19:47,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:47,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:47,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1576 proven. 199 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-12-30 23:19:49,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:49,009 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 [2018-12-30 23:19:49,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:49,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 1483 proven. 93 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-12-30 23:19:50,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:19:50,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2018-12-30 23:19:50,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:19:50,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:19:50,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:19:50,545 INFO L87 Difference]: Start difference. First operand 4632 states and 4858 transitions. Second operand 8 states. [2018-12-30 23:19:52,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:52,260 INFO L93 Difference]: Finished difference Result 10218 states and 10714 transitions. [2018-12-30 23:19:52,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-30 23:19:52,261 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 864 [2018-12-30 23:19:52,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:52,274 INFO L225 Difference]: With dead ends: 10218 [2018-12-30 23:19:52,274 INFO L226 Difference]: Without dead ends: 5766 [2018-12-30 23:19:52,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 863 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:19:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2018-12-30 23:19:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 4632. [2018-12-30 23:19:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2018-12-30 23:19:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4821 transitions. [2018-12-30 23:19:52,371 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4821 transitions. Word has length 864 [2018-12-30 23:19:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:52,372 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4821 transitions. [2018-12-30 23:19:52,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:19:52,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4821 transitions. [2018-12-30 23:19:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 942 [2018-12-30 23:19:52,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:52,385 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:52,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:52,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:52,386 INFO L82 PathProgramCache]: Analyzing trace with hash 377118381, now seen corresponding path program 1 times [2018-12-30 23:19:52,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:52,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:52,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:52,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2793 backedges. 1490 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2018-12-30 23:19:53,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:19:53,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:19:53,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:19:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:19:53,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:53,723 INFO L87 Difference]: Start difference. First operand 4632 states and 4821 transitions. Second operand 5 states. [2018-12-30 23:19:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:55,216 INFO L93 Difference]: Finished difference Result 10152 states and 10560 transitions. [2018-12-30 23:19:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:19:55,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 941 [2018-12-30 23:19:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:55,228 INFO L225 Difference]: With dead ends: 10152 [2018-12-30 23:19:55,229 INFO L226 Difference]: Without dead ends: 5700 [2018-12-30 23:19:55,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:55,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2018-12-30 23:19:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 4988. [2018-12-30 23:19:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4988 states. [2018-12-30 23:19:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4988 states to 4988 states and 5183 transitions. [2018-12-30 23:19:55,319 INFO L78 Accepts]: Start accepts. Automaton has 4988 states and 5183 transitions. Word has length 941 [2018-12-30 23:19:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:55,321 INFO L480 AbstractCegarLoop]: Abstraction has 4988 states and 5183 transitions. [2018-12-30 23:19:55,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:19:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4988 states and 5183 transitions. [2018-12-30 23:19:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1288 [2018-12-30 23:19:55,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:55,343 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:55,344 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash 321945556, now seen corresponding path program 1 times [2018-12-30 23:19:55,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:55,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:55,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 12 refuted. 0 times theorem prover too weak. 2408 trivial. 0 not checked. [2018-12-30 23:19:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:19:56,940 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 [2018-12-30 23:19:56,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:19:57,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:19:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4935 backedges. 2515 proven. 0 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-30 23:19:58,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:19:58,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-12-30 23:19:58,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:19:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:19:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:58,180 INFO L87 Difference]: Start difference. First operand 4988 states and 5183 transitions. Second operand 5 states. [2018-12-30 23:19:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:19:59,420 INFO L93 Difference]: Finished difference Result 9974 states and 10370 transitions. [2018-12-30 23:19:59,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:19:59,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1287 [2018-12-30 23:19:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:19:59,432 INFO L225 Difference]: With dead ends: 9974 [2018-12-30 23:19:59,432 INFO L226 Difference]: Without dead ends: 5166 [2018-12-30 23:19:59,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1291 GetRequests, 1287 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:19:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2018-12-30 23:19:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4810. [2018-12-30 23:19:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-12-30 23:19:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4960 transitions. [2018-12-30 23:19:59,523 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4960 transitions. Word has length 1287 [2018-12-30 23:19:59,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:19:59,524 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4960 transitions. [2018-12-30 23:19:59,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:19:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4960 transitions. [2018-12-30 23:19:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2018-12-30 23:19:59,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:19:59,554 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:19:59,557 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:19:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:19:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash -239383974, now seen corresponding path program 1 times [2018-12-30 23:19:59,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:19:59,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:19:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:59,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:19:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:19:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:00,553 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-30 23:20:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8126 backedges. 1435 proven. 0 refuted. 0 times theorem prover too weak. 6691 trivial. 0 not checked. [2018-12-30 23:20:01,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:01,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:01,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:01,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:01,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:01,819 INFO L87 Difference]: Start difference. First operand 4810 states and 4960 transitions. Second operand 4 states. [2018-12-30 23:20:02,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:02,820 INFO L93 Difference]: Finished difference Result 9618 states and 9921 transitions. [2018-12-30 23:20:02,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:02,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1584 [2018-12-30 23:20:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:02,832 INFO L225 Difference]: With dead ends: 9618 [2018-12-30 23:20:02,832 INFO L226 Difference]: Without dead ends: 4810 [2018-12-30 23:20:02,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2018-12-30 23:20:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 4810. [2018-12-30 23:20:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-12-30 23:20:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4922 transitions. [2018-12-30 23:20:02,912 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4922 transitions. Word has length 1584 [2018-12-30 23:20:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:02,913 INFO L480 AbstractCegarLoop]: Abstraction has 4810 states and 4922 transitions. [2018-12-30 23:20:02,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4922 transitions. [2018-12-30 23:20:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1652 [2018-12-30 23:20:02,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:02,942 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:02,942 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash 292188241, now seen corresponding path program 1 times [2018-12-30 23:20:02,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:02,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:02,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:03,813 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 23:20:04,996 INFO L134 CoverageAnalysis]: Checked inductivity of 8364 backedges. 2751 proven. 0 refuted. 0 times theorem prover too weak. 5613 trivial. 0 not checked. [2018-12-30 23:20:04,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:04,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:20:04,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:20:04,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:20:04,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:20:04,999 INFO L87 Difference]: Start difference. First operand 4810 states and 4922 transitions. Second operand 4 states. [2018-12-30 23:20:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:05,933 INFO L93 Difference]: Finished difference Result 9440 states and 9657 transitions. [2018-12-30 23:20:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:20:05,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1651 [2018-12-30 23:20:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:05,942 INFO L225 Difference]: With dead ends: 9440 [2018-12-30 23:20:05,942 INFO L226 Difference]: Without dead ends: 3564 [2018-12-30 23:20:05,948 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 [2018-12-30 23:20:05,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2018-12-30 23:20:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3564. [2018-12-30 23:20:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2018-12-30 23:20:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3614 transitions. [2018-12-30 23:20:05,998 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3614 transitions. Word has length 1651 [2018-12-30 23:20:06,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:06,000 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3614 transitions. [2018-12-30 23:20:06,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:20:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3614 transitions. [2018-12-30 23:20:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1670 [2018-12-30 23:20:06,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:06,025 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:06,027 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1222533483, now seen corresponding path program 1 times [2018-12-30 23:20:06,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:07,286 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-30 23:20:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8470 backedges. 2593 proven. 0 refuted. 0 times theorem prover too weak. 5877 trivial. 0 not checked. [2018-12-30 23:20:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:20:09,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:09,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:09,185 INFO L87 Difference]: Start difference. First operand 3564 states and 3614 transitions. Second operand 7 states. [2018-12-30 23:20:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:10,171 INFO L93 Difference]: Finished difference Result 7008 states and 7109 transitions. [2018-12-30 23:20:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:20:10,172 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1669 [2018-12-30 23:20:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:10,176 INFO L225 Difference]: With dead ends: 7008 [2018-12-30 23:20:10,176 INFO L226 Difference]: Without dead ends: 3742 [2018-12-30 23:20:10,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2018-12-30 23:20:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3564. [2018-12-30 23:20:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2018-12-30 23:20:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 3613 transitions. [2018-12-30 23:20:10,219 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 3613 transitions. Word has length 1669 [2018-12-30 23:20:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:10,220 INFO L480 AbstractCegarLoop]: Abstraction has 3564 states and 3613 transitions. [2018-12-30 23:20:10,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 3613 transitions. [2018-12-30 23:20:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1723 [2018-12-30 23:20:10,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:10,237 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:10,237 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:10,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1151917844, now seen corresponding path program 1 times [2018-12-30 23:20:10,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:10,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 9629 backedges. 4699 proven. 354 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2018-12-30 23:20:12,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:12,288 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 [2018-12-30 23:20:12,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:12,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:14,882 INFO L134 CoverageAnalysis]: Checked inductivity of 9629 backedges. 2699 proven. 154 refuted. 0 times theorem prover too weak. 6776 trivial. 0 not checked. [2018-12-30 23:20:14,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:14,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2018-12-30 23:20:14,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-30 23:20:14,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-30 23:20:14,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-30 23:20:14,904 INFO L87 Difference]: Start difference. First operand 3564 states and 3613 transitions. Second operand 10 states. [2018-12-30 23:20:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:27,013 INFO L93 Difference]: Finished difference Result 9618 states and 9792 transitions. [2018-12-30 23:20:27,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-30 23:20:27,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1722 [2018-12-30 23:20:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:27,020 INFO L225 Difference]: With dead ends: 9618 [2018-12-30 23:20:27,020 INFO L226 Difference]: Without dead ends: 5522 [2018-12-30 23:20:27,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1745 GetRequests, 1727 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:20:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2018-12-30 23:20:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4632. [2018-12-30 23:20:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2018-12-30 23:20:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 4697 transitions. [2018-12-30 23:20:27,102 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 4697 transitions. Word has length 1722 [2018-12-30 23:20:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:27,103 INFO L480 AbstractCegarLoop]: Abstraction has 4632 states and 4697 transitions. [2018-12-30 23:20:27,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-30 23:20:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 4697 transitions. [2018-12-30 23:20:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2018-12-30 23:20:27,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:27,135 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:27,135 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:27,138 INFO L82 PathProgramCache]: Analyzing trace with hash 773480895, now seen corresponding path program 1 times [2018-12-30 23:20:27,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:27,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:28,209 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-30 23:20:28,404 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-30 23:20:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11344 backedges. 3050 proven. 0 refuted. 0 times theorem prover too weak. 8294 trivial. 0 not checked. [2018-12-30 23:20:30,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:20:30,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 23:20:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:30,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:30,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:30,494 INFO L87 Difference]: Start difference. First operand 4632 states and 4697 transitions. Second operand 7 states. [2018-12-30 23:20:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:31,734 INFO L93 Difference]: Finished difference Result 6997 states and 7109 transitions. [2018-12-30 23:20:31,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:20:31,735 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1892 [2018-12-30 23:20:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:31,739 INFO L225 Difference]: With dead ends: 6997 [2018-12-30 23:20:31,739 INFO L226 Difference]: Without dead ends: 4454 [2018-12-30 23:20:31,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2018-12-30 23:20:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4454. [2018-12-30 23:20:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2018-12-30 23:20:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4509 transitions. [2018-12-30 23:20:31,800 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4509 transitions. Word has length 1892 [2018-12-30 23:20:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:31,801 INFO L480 AbstractCegarLoop]: Abstraction has 4454 states and 4509 transitions. [2018-12-30 23:20:31,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4509 transitions. [2018-12-30 23:20:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2025 [2018-12-30 23:20:31,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:20:31,835 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:20:31,836 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:20:31,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:20:31,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1727252823, now seen corresponding path program 1 times [2018-12-30 23:20:31,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:20:31,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:20:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:31,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:31,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:20:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13033 backedges. 3240 proven. 118 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2018-12-30 23:20:34,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:20:34,103 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 [2018-12-30 23:20:34,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:20:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:20:34,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:20:34,834 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 13 [2018-12-30 23:20:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13033 backedges. 3286 proven. 72 refuted. 0 times theorem prover too weak. 9675 trivial. 0 not checked. [2018-12-30 23:20:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:20:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-30 23:20:37,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:20:37,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:20:37,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:20:37,529 INFO L87 Difference]: Start difference. First operand 4454 states and 4509 transitions. Second operand 7 states. [2018-12-30 23:20:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:20:39,936 INFO L93 Difference]: Finished difference Result 8370 states and 8481 transitions. [2018-12-30 23:20:39,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-30 23:20:39,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2024 [2018-12-30 23:20:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:20:39,939 INFO L225 Difference]: With dead ends: 8370 [2018-12-30 23:20:39,939 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:20:39,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2032 GetRequests, 2024 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:20:39,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:20:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:20:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:20:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:20:39,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2024 [2018-12-30 23:20:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:20:39,945 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:20:39,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:20:39,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:20:39,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:20:39,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:20:40,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:40,619 WARN L181 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 426 DAG size of output: 304 [2018-12-30 23:20:40,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:20:41,186 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 424 DAG size of output: 302 [2018-12-30 23:22:39,832 WARN L181 SmtUtils]: Spent 1.98 m on a formula simplification. DAG size of input: 282 DAG size of output: 124 [2018-12-30 23:24:39,315 WARN L181 SmtUtils]: Spent 1.99 m on a formula simplification. DAG size of input: 281 DAG size of output: 124 [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-12-30 23:24:39,320 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-12-30 23:24:39,321 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-12-30 23:24:39,322 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-12-30 23:24:39,323 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-12-30 23:24:39,324 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-30 23:24:39,326 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-12-30 23:24:39,326 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-12-30 23:24:39,327 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-12-30 23:24:39,328 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-12-30 23:24:39,329 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-12-30 23:24:39,330 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-12-30 23:24:39,331 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-12-30 23:24:39,332 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:24:39,333 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-12-30 23:24:39,334 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-12-30 23:24:39,334 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,334 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 118) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-12-30 23:24:39,335 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,336 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-12-30 23:24:39,337 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,338 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse20 (= ~a21~0 10)) (.cse28 (+ ~a12~0 43))) (let ((.cse22 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse10 (<= ~a12~0 80)) (.cse27 (<= ~a15~0 8)) (.cse11 (< 0 .cse28)) (.cse13 (not .cse20))) (let ((.cse19 (or (and .cse10 .cse22 .cse1 .cse11) (and .cse10 .cse27 .cse11 .cse13))) (.cse15 (= ~a21~0 9)) (.cse25 (= ~a21~0 7)) (.cse18 (= ~a21~0 8))) (let ((.cse6 (< 80 ~a12~0)) (.cse9 (= ~a15~0 5)) (.cse14 (<= ~a12~0 586307)) (.cse16 (and .cse18 (and .cse1 .cse27))) (.cse2 (<= (+ ~a12~0 49) 0)) (.cse24 (and .cse25 .cse27)) (.cse0 (<= ~a15~0 6)) (.cse12 (<= .cse28 0)) (.cse23 (= ~a15~0 7)) (.cse3 (not .cse15)) (.cse4 (not .cse18)) (.cse7 (not .cse25)) (.cse8 (= ~a21~0 6)) (.cse17 (<= 19 ~a12~0)) (.cse26 (and .cse19 .cse1)) (.cse21 (<= ~a12~0 11)) (.cse5 (= ~a15~0 9))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (<= ~a12~0 599999) .cse1 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9) (and (exists ((v_prenex_56 Int)) (and (= ~a12~0 (+ (mod v_prenex_56 299959) 300041)) (< 80 v_prenex_56) (<= 0 v_prenex_56))) .cse1 .cse5) (and .cse10 .cse0 .cse11) (and .cse0 .cse12 .cse1 .cse13) (and .cse1 .cse14 .cse5 .cse6) (and .cse15 .cse0) (and (<= ~a12~0 73282) .cse16 .cse17) (and .cse18 .cse1 .cse14 .cse5 .cse17) (or (and .cse19 .cse20 .cse21) (and .cse22 .cse1 .cse20 .cse17)) (and (and .cse18 .cse21 .cse11) .cse1 .cse5) (and .cse1 .cse20 .cse9 .cse14 .cse17) (and .cse23 .cse16) (and .cse24 .cse1 .cse21 .cse11) (and .cse0 (and .cse10 .cse25)) (and (and .cse3 (and .cse2 .cse1)) .cse23) (and .cse23 (and .cse3 .cse26)) (and .cse1 (and .cse25 .cse27 .cse2)) (and .cse23 (and .cse1 .cse24)) (and .cse12 (<= ~a21~0 6) .cse0) (and .cse8 .cse1 (= ~a15~0 6)) (and (and .cse22 .cse20) .cse12 .cse1) (and .cse23 (and (< 11 ~a12~0) .cse1)) (and .cse3 .cse4 .cse1 .cse5 .cse21 .cse7) (and .cse8 .cse22 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse26 .cse15 .cse17) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse22 .cse26 .cse21 .cse15) (and .cse1 .cse18 (<= (+ ~a12~0 526767) 0) .cse5)))))) [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-12-30 23:24:39,339 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,340 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,341 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-12-30 23:24:39,349 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,349 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-12-30 23:24:39,349 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse22 (= ~a21~0 10)) (.cse28 (+ ~a12~0 43))) (let ((.cse24 (= ~a15~0 8)) (.cse1 (= ~a24~0 1)) (.cse10 (<= ~a12~0 80)) (.cse13 (<= ~a15~0 8)) (.cse11 (< 0 .cse28)) (.cse15 (not .cse22))) (let ((.cse21 (or (and .cse10 .cse24 .cse1 .cse11) (and .cse10 .cse13 .cse11 .cse15))) (.cse17 (= ~a21~0 9)) (.cse12 (= ~a21~0 7)) (.cse20 (= ~a21~0 8))) (let ((.cse6 (< 80 ~a12~0)) (.cse9 (= ~a15~0 5)) (.cse16 (<= ~a12~0 586307)) (.cse18 (and .cse20 (and .cse1 .cse13))) (.cse2 (<= (+ ~a12~0 49) 0)) (.cse26 (and .cse12 .cse13)) (.cse0 (<= ~a15~0 6)) (.cse14 (<= .cse28 0)) (.cse25 (= ~a15~0 7)) (.cse3 (not .cse17)) (.cse4 (not .cse20)) (.cse7 (not .cse12)) (.cse8 (= ~a21~0 6)) (.cse19 (<= 19 ~a12~0)) (.cse27 (and .cse21 .cse1)) (.cse23 (<= ~a12~0 11)) (.cse5 (= ~a15~0 9))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (<= ~a12~0 599999) .cse1 .cse5 .cse6 .cse7) (and .cse8 .cse1 .cse9) (and (exists ((v_prenex_56 Int)) (and (= ~a12~0 (+ (mod v_prenex_56 299959) 300041)) (< 80 v_prenex_56) (<= 0 v_prenex_56))) .cse1 .cse5) (and .cse10 .cse0 .cse11) (and .cse1 (and .cse12 .cse13 .cse2)) (and .cse0 .cse14 .cse1 .cse15) (and .cse1 .cse16 .cse5 .cse6) (and .cse17 .cse0) (and (<= ~a12~0 73282) .cse18 .cse19) (and .cse20 .cse1 .cse16 .cse5 .cse19) (or (and .cse21 .cse22 .cse23) (and .cse24 .cse1 .cse22 .cse19)) (and (and .cse20 .cse23 .cse11) .cse1 .cse5) (and .cse1 .cse22 .cse9 .cse16 .cse19) (and .cse25 .cse18) (and .cse26 .cse1 .cse23 .cse11) (and .cse0 (and .cse10 .cse12)) (and (and .cse3 (and .cse2 .cse1)) .cse25) (and .cse25 (and .cse3 .cse27)) (and .cse25 (and .cse1 .cse26)) (and .cse14 (<= ~a21~0 6) .cse0) (and .cse8 .cse1 (= ~a15~0 6)) (and (and .cse24 .cse22) .cse14 .cse1) (and .cse25 (and (< 11 ~a12~0) .cse1)) (and .cse3 .cse4 .cse1 .cse5 .cse23 .cse7) (and .cse8 .cse24 (exists ((v_prenex_2 Int)) (and (< 80 v_prenex_2) (= (+ (mod v_prenex_2 299959) 286349) ~a12~0) (<= 0 v_prenex_2))) .cse1) (and .cse27 .cse17 .cse19) (and (not (= ULTIMATE.start_calculate_output_~input 5)) .cse24 .cse27 .cse23 .cse17) (and .cse1 .cse20 (<= (+ ~a12~0 526767) 0) .cse5)))))) [2018-12-30 23:24:39,349 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,350 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,351 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-12-30 23:24:39,352 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,355 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,356 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-12-30 23:24:39,358 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-12-30 23:24:39,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,396 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:24:39 BoogieIcfgContainer [2018-12-30 23:24:39,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:24:39,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:24:39,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:24:39,434 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:24:39,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:19:06" (3/4) ... [2018-12-30 23:24:39,443 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:24:39,489 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 23:24:39,495 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:24:39,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a15 <= 6 && a24 == 1) && a12 + 49 <= 0) || ((((((!(a21 == 9) && !(a21 == 8)) && a12 <= 599999) && a24 == 1) && a15 == 9) && 80 < a12) && !(a21 == 7))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((\exists v_prenex_56 : int :: (a12 == v_prenex_56 % 299959 + 300041 && 80 < v_prenex_56) && 0 <= v_prenex_56) && a24 == 1) && a15 == 9)) || ((a12 <= 80 && a15 <= 6) && 0 < a12 + 43)) || (a24 == 1 && (a21 == 7 && a15 <= 8) && a12 + 49 <= 0)) || (((a15 <= 6 && a12 + 43 <= 0) && a24 == 1) && !(a21 == 10))) || (((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12)) || (a21 == 9 && a15 <= 6)) || ((a12 <= 73282 && a21 == 8 && a24 == 1 && a15 <= 8) && 19 <= a12)) || ((((a21 == 8 && a24 == 1) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || ((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a21 == 10) && a12 <= 11) || (((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12)) || ((((a21 == 8 && a12 <= 11) && 0 < a12 + 43) && a24 == 1) && a15 == 9)) || ((((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307) && 19 <= a12)) || (a15 == 7 && a21 == 8 && a24 == 1 && a15 <= 8)) || ((((a21 == 7 && a15 <= 8) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || ((!(a21 == 9) && a12 + 49 <= 0 && a24 == 1) && a15 == 7)) || (a15 == 7 && !(a21 == 9) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1)) || (a15 == 7 && a24 == 1 && a21 == 7 && a15 <= 8)) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((a15 == 8 && a21 == 10) && a12 + 43 <= 0) && a24 == 1)) || (a15 == 7 && 11 < a12 && a24 == 1)) || (((((!(a21 == 9) && !(a21 == 8)) && a24 == 1) && a15 == 9) && a12 <= 11) && !(a21 == 7))) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a21 == 9) && 19 <= a12)) || ((((!(input == 5) && a15 == 8) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a12 <= 11) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9) [2018-12-30 23:24:39,544 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a15 <= 6 && a24 == 1) && a12 + 49 <= 0) || ((((((!(a21 == 9) && !(a21 == 8)) && a12 <= 599999) && a24 == 1) && a15 == 9) && 80 < a12) && !(a21 == 7))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((\exists v_prenex_56 : int :: (a12 == v_prenex_56 % 299959 + 300041 && 80 < v_prenex_56) && 0 <= v_prenex_56) && a24 == 1) && a15 == 9)) || ((a12 <= 80 && a15 <= 6) && 0 < a12 + 43)) || (((a15 <= 6 && a12 + 43 <= 0) && a24 == 1) && !(a21 == 10))) || (((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12)) || (a21 == 9 && a15 <= 6)) || ((a12 <= 73282 && a21 == 8 && a24 == 1 && a15 <= 8) && 19 <= a12)) || ((((a21 == 8 && a24 == 1) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || ((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a21 == 10) && a12 <= 11) || (((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12)) || ((((a21 == 8 && a12 <= 11) && 0 < a12 + 43) && a24 == 1) && a15 == 9)) || ((((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307) && 19 <= a12)) || (a15 == 7 && a21 == 8 && a24 == 1 && a15 <= 8)) || ((((a21 == 7 && a15 <= 8) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || ((!(a21 == 9) && a12 + 49 <= 0 && a24 == 1) && a15 == 7)) || (a15 == 7 && !(a21 == 9) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1)) || (a24 == 1 && (a21 == 7 && a15 <= 8) && a12 + 49 <= 0)) || (a15 == 7 && a24 == 1 && a21 == 7 && a15 <= 8)) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((a15 == 8 && a21 == 10) && a12 + 43 <= 0) && a24 == 1)) || (a15 == 7 && 11 < a12 && a24 == 1)) || (((((!(a21 == 9) && !(a21 == 8)) && a24 == 1) && a15 == 9) && a12 <= 11) && !(a21 == 7))) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a21 == 9) && 19 <= a12)) || ((((!(input == 5) && a15 == 8) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a12 <= 11) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9) [2018-12-30 23:24:39,700 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:24:39,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:24:39,702 INFO L168 Benchmark]: Toolchain (without parser) took 338594.69 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 946.0 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 409.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,702 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-12-30 23:24:39,703 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.38 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,704 INFO L168 Benchmark]: Boogie Preprocessor took 139.94 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,704 INFO L168 Benchmark]: RCFGBuilder took 3979.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.6 MB in the end (delta: 133.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,705 INFO L168 Benchmark]: TraceAbstraction took 333179.07 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 978.6 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-30 23:24:39,705 INFO L168 Benchmark]: Witness Printer took 266.39 ms. Allocated memory is still 4.9 GB. Free memory is still 4.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:24:39,710 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.16 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 805.38 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 216.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -204.8 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.94 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3979.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.6 MB in the end (delta: 133.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 333179.07 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 978.6 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 266.39 ms. Allocated memory is still 4.9 GB. Free memory is still 4.4 GB. There was no memory consumed. 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_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 118]: 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: 880]: Loop Invariant [2018-12-30 23:24:39,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a15 <= 6 && a24 == 1) && a12 + 49 <= 0) || ((((((!(a21 == 9) && !(a21 == 8)) && a12 <= 599999) && a24 == 1) && a15 == 9) && 80 < a12) && !(a21 == 7))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((\exists v_prenex_56 : int :: (a12 == v_prenex_56 % 299959 + 300041 && 80 < v_prenex_56) && 0 <= v_prenex_56) && a24 == 1) && a15 == 9)) || ((a12 <= 80 && a15 <= 6) && 0 < a12 + 43)) || (a24 == 1 && (a21 == 7 && a15 <= 8) && a12 + 49 <= 0)) || (((a15 <= 6 && a12 + 43 <= 0) && a24 == 1) && !(a21 == 10))) || (((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12)) || (a21 == 9 && a15 <= 6)) || ((a12 <= 73282 && a21 == 8 && a24 == 1 && a15 <= 8) && 19 <= a12)) || ((((a21 == 8 && a24 == 1) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || ((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a21 == 10) && a12 <= 11) || (((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12)) || ((((a21 == 8 && a12 <= 11) && 0 < a12 + 43) && a24 == 1) && a15 == 9)) || ((((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307) && 19 <= a12)) || (a15 == 7 && a21 == 8 && a24 == 1 && a15 <= 8)) || ((((a21 == 7 && a15 <= 8) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || ((!(a21 == 9) && a12 + 49 <= 0 && a24 == 1) && a15 == 7)) || (a15 == 7 && !(a21 == 9) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1)) || (a15 == 7 && a24 == 1 && a21 == 7 && a15 <= 8)) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((a15 == 8 && a21 == 10) && a12 + 43 <= 0) && a24 == 1)) || (a15 == 7 && 11 < a12 && a24 == 1)) || (((((!(a21 == 9) && !(a21 == 8)) && a24 == 1) && a15 == 9) && a12 <= 11) && !(a21 == 7))) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a21 == 9) && 19 <= a12)) || ((((!(input == 5) && a15 == 8) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a12 <= 11) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9) - InvariantResult [Line: 20]: Loop Invariant [2018-12-30 23:24:39,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_56,QUANTIFIED] [2018-12-30 23:24:39,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-12-30 23:24:39,744 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a15 <= 6 && a24 == 1) && a12 + 49 <= 0) || ((((((!(a21 == 9) && !(a21 == 8)) && a12 <= 599999) && a24 == 1) && a15 == 9) && 80 < a12) && !(a21 == 7))) || ((a21 == 6 && a24 == 1) && a15 == 5)) || (((\exists v_prenex_56 : int :: (a12 == v_prenex_56 % 299959 + 300041 && 80 < v_prenex_56) && 0 <= v_prenex_56) && a24 == 1) && a15 == 9)) || ((a12 <= 80 && a15 <= 6) && 0 < a12 + 43)) || (((a15 <= 6 && a12 + 43 <= 0) && a24 == 1) && !(a21 == 10))) || (((a24 == 1 && a12 <= 586307) && a15 == 9) && 80 < a12)) || (a21 == 9 && a15 <= 6)) || ((a12 <= 73282 && a21 == 8 && a24 == 1 && a15 <= 8) && 19 <= a12)) || ((((a21 == 8 && a24 == 1) && a12 <= 586307) && a15 == 9) && 19 <= a12)) || ((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a21 == 10) && a12 <= 11) || (((a15 == 8 && a24 == 1) && a21 == 10) && 19 <= a12)) || ((((a21 == 8 && a12 <= 11) && 0 < a12 + 43) && a24 == 1) && a15 == 9)) || ((((a24 == 1 && a21 == 10) && a15 == 5) && a12 <= 586307) && 19 <= a12)) || (a15 == 7 && a21 == 8 && a24 == 1 && a15 <= 8)) || ((((a21 == 7 && a15 <= 8) && a24 == 1) && a12 <= 11) && 0 < a12 + 43)) || (a15 <= 6 && a12 <= 80 && a21 == 7)) || ((!(a21 == 9) && a12 + 49 <= 0 && a24 == 1) && a15 == 7)) || (a15 == 7 && !(a21 == 9) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1)) || (a24 == 1 && (a21 == 7 && a15 <= 8) && a12 + 49 <= 0)) || (a15 == 7 && a24 == 1 && a21 == 7 && a15 <= 8)) || ((a12 + 43 <= 0 && a21 <= 6) && a15 <= 6)) || ((a21 == 6 && a24 == 1) && a15 == 6)) || (((a15 == 8 && a21 == 10) && a12 + 43 <= 0) && a24 == 1)) || (a15 == 7 && 11 < a12 && a24 == 1)) || (((((!(a21 == 9) && !(a21 == 8)) && a24 == 1) && a15 == 9) && a12 <= 11) && !(a21 == 7))) || (((a21 == 6 && a15 == 8) && (\exists v_prenex_2 : int :: (80 < v_prenex_2 && v_prenex_2 % 299959 + 286349 == a12) && 0 <= v_prenex_2)) && a24 == 1)) || (((((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a21 == 9) && 19 <= a12)) || ((((!(input == 5) && a15 == 8) && ((((a12 <= 80 && a15 == 8) && a24 == 1) && 0 < a12 + 43) || (((a12 <= 80 && a15 <= 8) && 0 < a12 + 43) && !(a21 == 10))) && a24 == 1) && a12 <= 11) && a21 == 9)) || (((a24 == 1 && a21 == 8) && a12 + 526767 <= 0) && a15 == 9) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 333.0s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 51.8s AutomataDifference, 0.0s DeadEndRemovalTime, 239.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1168 SDtfs, 6847 SDslu, 411 SDs, 0 SdLazy, 27692 SolverSat, 2085 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 43.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7418 GetRequests, 7310 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4988occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 8245 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 1167 HoareAnnotationTreeSize, 3 FomulaSimplifications, 776310 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 125009 FormulaSimplificationTreeSizeReductionInter, 238.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 26153 NumberOfCodeBlocks, 26153 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 26126 ConstructedInterpolants, 164 QuantifiedInterpolants, 83235273 SizeOfPredicates, 16 NumberOfNonLiveVariables, 8878 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 27 InterpolantComputations, 15 PerfectInterpolantSequences, 109781/111017 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...