./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem03_label14_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem03_label14_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9197060d9e6f590900f81f4b5b3ae266edbba8aa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:59:52,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:59:52,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:59:52,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:59:52,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:59:52,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:59:52,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:59:52,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:59:52,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:59:52,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:59:52,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:59:52,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:59:52,232 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:59:52,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:59:52,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:59:52,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:59:52,236 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:59:52,238 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:59:52,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:59:52,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:59:52,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:59:52,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:59:52,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:59:52,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:59:52,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:59:52,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:59:52,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:59:52,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:59:52,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:59:52,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:59:52,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:59:52,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:59:52,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:59:52,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:59:52,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:59:52,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:59:52,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:59:52,271 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:59:52,272 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:59:52,273 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:59:52,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:59:52,273 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:59:52,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:59:52,274 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:59:52,274 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:59:52,274 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:59:52,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:59:52,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:59:52,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:59:52,276 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:59:52,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:59:52,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:59:52,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:59:52,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:59:52,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:59:52,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:59:52,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:59:52,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:59:52,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:59:52,277 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:59:52,278 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 -> 9197060d9e6f590900f81f4b5b3ae266edbba8aa [2019-01-12 00:59:52,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:59:52,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:59:52,337 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:59:52,338 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:59:52,339 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:59:52,339 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem03_label14_true-unreach-call.c [2019-01-12 00:59:52,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd7d327a/7a7443452cd641dd87d3d7b7370c6806/FLAGaab47fc80 [2019-01-12 00:59:53,029 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:59:53,029 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem03_label14_true-unreach-call.c [2019-01-12 00:59:53,052 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd7d327a/7a7443452cd641dd87d3d7b7370c6806/FLAGaab47fc80 [2019-01-12 00:59:53,184 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd7d327a/7a7443452cd641dd87d3d7b7370c6806 [2019-01-12 00:59:53,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:59:53,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:59:53,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:59:53,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:59:53,196 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:59:53,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:59:53" (1/1) ... [2019-01-12 00:59:53,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672937de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:53, skipping insertion in model container [2019-01-12 00:59:53,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:59:53" (1/1) ... [2019-01-12 00:59:53,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:59:53,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:59:54,090 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:59:54,103 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:59:54,491 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:59:54,667 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:59:54,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54 WrapperNode [2019-01-12 00:59:54,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:59:54,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:59:54,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:59:54,668 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:59:54,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:59:54,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:59:54,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:59:54,827 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:59:54,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... [2019-01-12 00:59:54,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:59:54,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:59:54,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:59:54,948 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:59:54,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:59:55,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:59:55,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 01:00:00,858 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 01:00:00,858 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 01:00:00,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:00:00 BoogieIcfgContainer [2019-01-12 01:00:00,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 01:00:00,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 01:00:00,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 01:00:00,864 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 01:00:00,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:59:53" (1/3) ... [2019-01-12 01:00:00,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e1ed3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:00:00, skipping insertion in model container [2019-01-12 01:00:00,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:59:54" (2/3) ... [2019-01-12 01:00:00,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e1ed3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 01:00:00, skipping insertion in model container [2019-01-12 01:00:00,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:00:00" (3/3) ... [2019-01-12 01:00:00,868 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label14_true-unreach-call.c [2019-01-12 01:00:00,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 01:00:00,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 01:00:00,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 01:00:00,939 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 01:00:00,940 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 01:00:00,940 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 01:00:00,940 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 01:00:00,941 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 01:00:00,941 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 01:00:00,941 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 01:00:00,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 01:00:00,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 01:00:00,970 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-01-12 01:00:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-12 01:00:00,989 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:00,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:00,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:01,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash 294910218, now seen corresponding path program 1 times [2019-01-12 01:00:01,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:01,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:01,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:01,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:01,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:01,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:01,946 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-01-12 01:00:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:05,636 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-01-12 01:00:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:05,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-01-12 01:00:05,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:05,662 INFO L225 Difference]: With dead ends: 1068 [2019-01-12 01:00:05,662 INFO L226 Difference]: Without dead ends: 670 [2019-01-12 01:00:05,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-01-12 01:00:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-01-12 01:00:05,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-01-12 01:00:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-01-12 01:00:05,760 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 170 [2019-01-12 01:00:05,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:05,762 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-01-12 01:00:05,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:05,762 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-01-12 01:00:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-12 01:00:05,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:05,768 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:05,768 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash -429687334, now seen corresponding path program 1 times [2019-01-12 01:00:05,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:05,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:05,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:05,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:06,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:06,062 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-01-12 01:00:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:08,824 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-01-12 01:00:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:08,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-01-12 01:00:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:08,833 INFO L225 Difference]: With dead ends: 1762 [2019-01-12 01:00:08,833 INFO L226 Difference]: Without dead ends: 1308 [2019-01-12 01:00:08,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-01-12 01:00:08,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-01-12 01:00:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-01-12 01:00:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-01-12 01:00:08,896 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 175 [2019-01-12 01:00:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:08,899 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-01-12 01:00:08,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-01-12 01:00:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-12 01:00:08,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:08,905 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:08,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1109940201, now seen corresponding path program 1 times [2019-01-12 01:00:08,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:08,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:08,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:09,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:09,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:00:09,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:09,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:09,022 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-01-12 01:00:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:11,166 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-01-12 01:00:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:11,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-01-12 01:00:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:11,177 INFO L225 Difference]: With dead ends: 2567 [2019-01-12 01:00:11,177 INFO L226 Difference]: Without dead ends: 1700 [2019-01-12 01:00:11,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-01-12 01:00:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-01-12 01:00:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-01-12 01:00:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2433 transitions. [2019-01-12 01:00:11,224 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2433 transitions. Word has length 178 [2019-01-12 01:00:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:11,225 INFO L480 AbstractCegarLoop]: Abstraction has 1683 states and 2433 transitions. [2019-01-12 01:00:11,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2433 transitions. [2019-01-12 01:00:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-12 01:00:11,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:11,231 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:11,231 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash 151177408, now seen corresponding path program 1 times [2019-01-12 01:00:11,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 01:00:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:11,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:00:11,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:11,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:11,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:11,421 INFO L87 Difference]: Start difference. First operand 1683 states and 2433 transitions. Second operand 3 states. [2019-01-12 01:00:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:12,719 INFO L93 Difference]: Finished difference Result 4189 states and 6035 transitions. [2019-01-12 01:00:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:12,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-01-12 01:00:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:12,734 INFO L225 Difference]: With dead ends: 4189 [2019-01-12 01:00:12,735 INFO L226 Difference]: Without dead ends: 2508 [2019-01-12 01:00:12,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-01-12 01:00:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 2507. [2019-01-12 01:00:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2507 states. [2019-01-12 01:00:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3546 transitions. [2019-01-12 01:00:12,785 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3546 transitions. Word has length 185 [2019-01-12 01:00:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:12,786 INFO L480 AbstractCegarLoop]: Abstraction has 2507 states and 3546 transitions. [2019-01-12 01:00:12,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3546 transitions. [2019-01-12 01:00:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-12 01:00:12,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:12,792 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:12,792 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:12,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1497770160, now seen corresponding path program 1 times [2019-01-12 01:00:12,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:12,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:12,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:12,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 01:00:12,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:12,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:00:12,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:12,919 INFO L87 Difference]: Start difference. First operand 2507 states and 3546 transitions. Second operand 3 states. [2019-01-12 01:00:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:13,400 INFO L93 Difference]: Finished difference Result 7497 states and 10609 transitions. [2019-01-12 01:00:13,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:13,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-01-12 01:00:13,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:13,420 INFO L225 Difference]: With dead ends: 7497 [2019-01-12 01:00:13,421 INFO L226 Difference]: Without dead ends: 4992 [2019-01-12 01:00:13,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2019-01-12 01:00:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 4989. [2019-01-12 01:00:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-01-12 01:00:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 7044 transitions. [2019-01-12 01:00:13,522 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 7044 transitions. Word has length 190 [2019-01-12 01:00:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:13,523 INFO L480 AbstractCegarLoop]: Abstraction has 4989 states and 7044 transitions. [2019-01-12 01:00:13,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 7044 transitions. [2019-01-12 01:00:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 01:00:13,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:13,532 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:13,532 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:13,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1140931236, now seen corresponding path program 1 times [2019-01-12 01:00:13,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:13,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:13,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-12 01:00:13,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:00:13,858 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:00:13,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:13,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:00:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-12 01:00:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:00:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 01:00:14,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:14,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:14,151 INFO L87 Difference]: Start difference. First operand 4989 states and 7044 transitions. Second operand 4 states. [2019-01-12 01:00:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:16,175 INFO L93 Difference]: Finished difference Result 19911 states and 28122 transitions. [2019-01-12 01:00:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:16,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-01-12 01:00:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:16,240 INFO L225 Difference]: With dead ends: 19911 [2019-01-12 01:00:16,240 INFO L226 Difference]: Without dead ends: 14924 [2019-01-12 01:00:16,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:16,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14924 states. [2019-01-12 01:00:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14924 to 9941. [2019-01-12 01:00:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9941 states. [2019-01-12 01:00:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 14011 transitions. [2019-01-12 01:00:16,486 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 14011 transitions. Word has length 199 [2019-01-12 01:00:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:16,486 INFO L480 AbstractCegarLoop]: Abstraction has 9941 states and 14011 transitions. [2019-01-12 01:00:16,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 14011 transitions. [2019-01-12 01:00:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-12 01:00:16,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:16,510 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:16,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2064135474, now seen corresponding path program 1 times [2019-01-12 01:00:16,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:16,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:16,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:16,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:16,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:00:16,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 01:00:16,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 01:00:16,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:00:16,917 INFO L87 Difference]: Start difference. First operand 9941 states and 14011 transitions. Second operand 5 states. [2019-01-12 01:00:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:20,103 INFO L93 Difference]: Finished difference Result 22383 states and 31798 transitions. [2019-01-12 01:00:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 01:00:20,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-01-12 01:00:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:20,140 INFO L225 Difference]: With dead ends: 22383 [2019-01-12 01:00:20,141 INFO L226 Difference]: Without dead ends: 12444 [2019-01-12 01:00:20,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 01:00:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12444 states. [2019-01-12 01:00:20,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12444 to 10753. [2019-01-12 01:00:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10753 states. [2019-01-12 01:00:20,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10753 states to 10753 states and 15161 transitions. [2019-01-12 01:00:20,443 INFO L78 Accepts]: Start accepts. Automaton has 10753 states and 15161 transitions. Word has length 208 [2019-01-12 01:00:20,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:20,445 INFO L480 AbstractCegarLoop]: Abstraction has 10753 states and 15161 transitions. [2019-01-12 01:00:20,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 01:00:20,445 INFO L276 IsEmpty]: Start isEmpty. Operand 10753 states and 15161 transitions. [2019-01-12 01:00:20,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-12 01:00:20,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:20,468 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:20,469 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:20,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:20,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1228512291, now seen corresponding path program 1 times [2019-01-12 01:00:20,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:20,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:20,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:20,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:20,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:00:20,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:20,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:20,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:20,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:20,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:20,654 INFO L87 Difference]: Start difference. First operand 10753 states and 15161 transitions. Second operand 3 states. [2019-01-12 01:00:22,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:22,333 INFO L93 Difference]: Finished difference Result 21528 states and 30366 transitions. [2019-01-12 01:00:22,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:22,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-01-12 01:00:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:22,359 INFO L225 Difference]: With dead ends: 21528 [2019-01-12 01:00:22,359 INFO L226 Difference]: Without dead ends: 10777 [2019-01-12 01:00:22,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10777 states. [2019-01-12 01:00:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10777 to 10753. [2019-01-12 01:00:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10753 states. [2019-01-12 01:00:22,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10753 states to 10753 states and 14375 transitions. [2019-01-12 01:00:22,521 INFO L78 Accepts]: Start accepts. Automaton has 10753 states and 14375 transitions. Word has length 208 [2019-01-12 01:00:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:22,521 INFO L480 AbstractCegarLoop]: Abstraction has 10753 states and 14375 transitions. [2019-01-12 01:00:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10753 states and 14375 transitions. [2019-01-12 01:00:22,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-12 01:00:22,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:22,540 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:22,540 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash 703981814, now seen corresponding path program 1 times [2019-01-12 01:00:22,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:22,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:22,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:22,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 01:00:22,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:22,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:22,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:22,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:22,762 INFO L87 Difference]: Start difference. First operand 10753 states and 14375 transitions. Second operand 4 states. [2019-01-12 01:00:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:24,427 INFO L93 Difference]: Finished difference Result 39422 states and 52598 transitions. [2019-01-12 01:00:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:24,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-01-12 01:00:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:24,492 INFO L225 Difference]: With dead ends: 39422 [2019-01-12 01:00:24,492 INFO L226 Difference]: Without dead ends: 28671 [2019-01-12 01:00:24,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28671 states. [2019-01-12 01:00:24,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28671 to 20102. [2019-01-12 01:00:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20102 states. [2019-01-12 01:00:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20102 states to 20102 states and 25989 transitions. [2019-01-12 01:00:24,869 INFO L78 Accepts]: Start accepts. Automaton has 20102 states and 25989 transitions. Word has length 208 [2019-01-12 01:00:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:24,870 INFO L480 AbstractCegarLoop]: Abstraction has 20102 states and 25989 transitions. [2019-01-12 01:00:24,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20102 states and 25989 transitions. [2019-01-12 01:00:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-12 01:00:24,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:24,911 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:24,912 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1211626453, now seen corresponding path program 1 times [2019-01-12 01:00:24,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:24,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:24,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:24,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 01:00:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:25,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:25,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:25,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:25,117 INFO L87 Difference]: Start difference. First operand 20102 states and 25989 transitions. Second operand 3 states. [2019-01-12 01:00:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:26,837 INFO L93 Difference]: Finished difference Result 55435 states and 71367 transitions. [2019-01-12 01:00:26,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:26,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-01-12 01:00:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:26,900 INFO L225 Difference]: With dead ends: 55435 [2019-01-12 01:00:26,900 INFO L226 Difference]: Without dead ends: 35335 [2019-01-12 01:00:26,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35335 states. [2019-01-12 01:00:27,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35335 to 35327. [2019-01-12 01:00:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35327 states. [2019-01-12 01:00:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35327 states to 35327 states and 41602 transitions. [2019-01-12 01:00:27,645 INFO L78 Accepts]: Start accepts. Automaton has 35327 states and 41602 transitions. Word has length 214 [2019-01-12 01:00:27,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:27,645 INFO L480 AbstractCegarLoop]: Abstraction has 35327 states and 41602 transitions. [2019-01-12 01:00:27,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:27,645 INFO L276 IsEmpty]: Start isEmpty. Operand 35327 states and 41602 transitions. [2019-01-12 01:00:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-12 01:00:27,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:27,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:27,681 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash -155694673, now seen corresponding path program 1 times [2019-01-12 01:00:27,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:27,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:27,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:27,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:27,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:27,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:27,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:27,883 INFO L87 Difference]: Start difference. First operand 35327 states and 41602 transitions. Second operand 4 states. [2019-01-12 01:00:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:29,528 INFO L93 Difference]: Finished difference Result 83855 states and 99991 transitions. [2019-01-12 01:00:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:29,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-01-12 01:00:29,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:29,622 INFO L225 Difference]: With dead ends: 83855 [2019-01-12 01:00:29,622 INFO L226 Difference]: Without dead ends: 48530 [2019-01-12 01:00:29,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48530 states. [2019-01-12 01:00:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48530 to 48522. [2019-01-12 01:00:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48522 states. [2019-01-12 01:00:30,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48522 states to 48522 states and 55715 transitions. [2019-01-12 01:00:30,447 INFO L78 Accepts]: Start accepts. Automaton has 48522 states and 55715 transitions. Word has length 225 [2019-01-12 01:00:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:30,447 INFO L480 AbstractCegarLoop]: Abstraction has 48522 states and 55715 transitions. [2019-01-12 01:00:30,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 48522 states and 55715 transitions. [2019-01-12 01:00:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-01-12 01:00:30,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:30,468 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:30,468 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:30,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1528433560, now seen corresponding path program 1 times [2019-01-12 01:00:30,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:30,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 01:00:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 01:00:30,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:30,662 INFO L87 Difference]: Start difference. First operand 48522 states and 55715 transitions. Second operand 3 states. [2019-01-12 01:00:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:31,896 INFO L93 Difference]: Finished difference Result 95951 states and 110133 transitions. [2019-01-12 01:00:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:31,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-01-12 01:00:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:31,942 INFO L225 Difference]: With dead ends: 95951 [2019-01-12 01:00:31,943 INFO L226 Difference]: Without dead ends: 47431 [2019-01-12 01:00:31,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47431 states. [2019-01-12 01:00:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47431 to 47431. [2019-01-12 01:00:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47431 states. [2019-01-12 01:00:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47431 states to 47431 states and 53920 transitions. [2019-01-12 01:00:33,024 INFO L78 Accepts]: Start accepts. Automaton has 47431 states and 53920 transitions. Word has length 257 [2019-01-12 01:00:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:33,024 INFO L480 AbstractCegarLoop]: Abstraction has 47431 states and 53920 transitions. [2019-01-12 01:00:33,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:00:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47431 states and 53920 transitions. [2019-01-12 01:00:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-12 01:00:33,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:33,038 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:33,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:33,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash 503909962, now seen corresponding path program 1 times [2019-01-12 01:00:33,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:33,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:33,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-12 01:00:33,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:33,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:33,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:33,465 INFO L87 Difference]: Start difference. First operand 47431 states and 53920 transitions. Second operand 4 states. [2019-01-12 01:00:35,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:35,548 INFO L93 Difference]: Finished difference Result 129032 states and 147124 transitions. [2019-01-12 01:00:35,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:35,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 300 [2019-01-12 01:00:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:35,620 INFO L225 Difference]: With dead ends: 129032 [2019-01-12 01:00:35,620 INFO L226 Difference]: Without dead ends: 81603 [2019-01-12 01:00:35,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81603 states. [2019-01-12 01:00:36,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81603 to 59205. [2019-01-12 01:00:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59205 states. [2019-01-12 01:00:36,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59205 states to 59205 states and 67867 transitions. [2019-01-12 01:00:36,725 INFO L78 Accepts]: Start accepts. Automaton has 59205 states and 67867 transitions. Word has length 300 [2019-01-12 01:00:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:36,726 INFO L480 AbstractCegarLoop]: Abstraction has 59205 states and 67867 transitions. [2019-01-12 01:00:36,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 59205 states and 67867 transitions. [2019-01-12 01:00:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-12 01:00:36,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:36,747 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:36,747 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1954295262, now seen corresponding path program 1 times [2019-01-12 01:00:36,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:36,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:36,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-01-12 01:00:36,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:36,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:00:36,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:36,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:36,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:36,996 INFO L87 Difference]: Start difference. First operand 59205 states and 67867 transitions. Second operand 4 states. [2019-01-12 01:00:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:38,747 INFO L93 Difference]: Finished difference Result 120052 states and 137535 transitions. [2019-01-12 01:00:38,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:38,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2019-01-12 01:00:38,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:38,803 INFO L225 Difference]: With dead ends: 120052 [2019-01-12 01:00:38,803 INFO L226 Difference]: Without dead ends: 60849 [2019-01-12 01:00:38,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60849 states. [2019-01-12 01:00:39,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60849 to 59611. [2019-01-12 01:00:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59611 states. [2019-01-12 01:00:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59611 states to 59611 states and 68108 transitions. [2019-01-12 01:00:39,897 INFO L78 Accepts]: Start accepts. Automaton has 59611 states and 68108 transitions. Word has length 310 [2019-01-12 01:00:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:39,897 INFO L480 AbstractCegarLoop]: Abstraction has 59611 states and 68108 transitions. [2019-01-12 01:00:39,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 59611 states and 68108 transitions. [2019-01-12 01:00:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-12 01:00:39,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:39,922 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:39,923 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 950105946, now seen corresponding path program 1 times [2019-01-12 01:00:39,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:39,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:39,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:39,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:00:40,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:40,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 01:00:40,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:40,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:40,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:40,369 INFO L87 Difference]: Start difference. First operand 59611 states and 68108 transitions. Second operand 4 states. [2019-01-12 01:00:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:41,704 INFO L93 Difference]: Finished difference Result 221957 states and 253697 transitions. [2019-01-12 01:00:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:41,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-01-12 01:00:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:41,852 INFO L225 Difference]: With dead ends: 221957 [2019-01-12 01:00:41,852 INFO L226 Difference]: Without dead ends: 162348 [2019-01-12 01:00:41,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162348 states. [2019-01-12 01:00:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162348 to 109443. [2019-01-12 01:00:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109443 states. [2019-01-12 01:00:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109443 states to 109443 states and 125156 transitions. [2019-01-12 01:00:43,575 INFO L78 Accepts]: Start accepts. Automaton has 109443 states and 125156 transitions. Word has length 311 [2019-01-12 01:00:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:43,575 INFO L480 AbstractCegarLoop]: Abstraction has 109443 states and 125156 transitions. [2019-01-12 01:00:43,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 109443 states and 125156 transitions. [2019-01-12 01:00:43,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-12 01:00:43,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:43,597 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:43,598 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:43,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:43,598 INFO L82 PathProgramCache]: Analyzing trace with hash -63783409, now seen corresponding path program 1 times [2019-01-12 01:00:43,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:43,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:43,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:43,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:43,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-01-12 01:00:43,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:43,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:43,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:00:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:00:43,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:43,942 INFO L87 Difference]: Start difference. First operand 109443 states and 125156 transitions. Second operand 4 states. [2019-01-12 01:00:47,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:47,157 INFO L93 Difference]: Finished difference Result 310913 states and 353734 transitions. [2019-01-12 01:00:47,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:00:47,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-01-12 01:00:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:47,357 INFO L225 Difference]: With dead ends: 310913 [2019-01-12 01:00:47,357 INFO L226 Difference]: Without dead ends: 201472 [2019-01-12 01:00:47,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:00:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201472 states. [2019-01-12 01:00:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201472 to 201462. [2019-01-12 01:00:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201462 states. [2019-01-12 01:00:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201462 states to 201462 states and 228401 transitions. [2019-01-12 01:00:50,286 INFO L78 Accepts]: Start accepts. Automaton has 201462 states and 228401 transitions. Word has length 315 [2019-01-12 01:00:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:00:50,287 INFO L480 AbstractCegarLoop]: Abstraction has 201462 states and 228401 transitions. [2019-01-12 01:00:50,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:00:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 201462 states and 228401 transitions. [2019-01-12 01:00:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-01-12 01:00:50,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:00:50,316 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:00:50,316 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:00:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:00:50,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1376081344, now seen corresponding path program 1 times [2019-01-12 01:00:50,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:00:50,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:00:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:00:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:00:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:00:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 01:00:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:00:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:00:50,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:00:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:00:50,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:50,683 INFO L87 Difference]: Start difference. First operand 201462 states and 228401 transitions. Second operand 3 states. [2019-01-12 01:00:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:00:53,968 INFO L93 Difference]: Finished difference Result 407046 states and 460546 transitions. [2019-01-12 01:00:53,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:00:53,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 317 [2019-01-12 01:00:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:00:54,195 INFO L225 Difference]: With dead ends: 407046 [2019-01-12 01:00:54,195 INFO L226 Difference]: Without dead ends: 205586 [2019-01-12 01:00:54,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:00:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205586 states. [2019-01-12 01:00:56,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205586 to 205522. [2019-01-12 01:00:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205522 states. [2019-01-12 01:01:03,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205522 states to 205522 states and 229342 transitions. [2019-01-12 01:01:03,277 INFO L78 Accepts]: Start accepts. Automaton has 205522 states and 229342 transitions. Word has length 317 [2019-01-12 01:01:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:01:03,277 INFO L480 AbstractCegarLoop]: Abstraction has 205522 states and 229342 transitions. [2019-01-12 01:01:03,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:01:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 205522 states and 229342 transitions. [2019-01-12 01:01:03,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-12 01:01:03,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:01:03,308 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:01:03,308 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:01:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:01:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2095705146, now seen corresponding path program 1 times [2019-01-12 01:01:03,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:01:03,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:01:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:01:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:01:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 01:01:03,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:01:03,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:01:03,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 01:01:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 01:01:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:01:03,558 INFO L87 Difference]: Start difference. First operand 205522 states and 229342 transitions. Second operand 3 states. [2019-01-12 01:01:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:01:05,790 INFO L93 Difference]: Finished difference Result 416983 states and 465898 transitions. [2019-01-12 01:01:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 01:01:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-01-12 01:01:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:01:06,022 INFO L225 Difference]: With dead ends: 416983 [2019-01-12 01:01:06,022 INFO L226 Difference]: Without dead ends: 211463 [2019-01-12 01:01:06,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 01:01:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211463 states. [2019-01-12 01:01:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211463 to 211459. [2019-01-12 01:01:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211459 states. [2019-01-12 01:01:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211459 states to 211459 states and 234788 transitions. [2019-01-12 01:01:09,202 INFO L78 Accepts]: Start accepts. Automaton has 211459 states and 234788 transitions. Word has length 321 [2019-01-12 01:01:09,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:01:09,202 INFO L480 AbstractCegarLoop]: Abstraction has 211459 states and 234788 transitions. [2019-01-12 01:01:09,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 01:01:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 211459 states and 234788 transitions. [2019-01-12 01:01:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-01-12 01:01:09,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:01:09,247 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:01:09,249 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:01:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:01:09,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1878310930, now seen corresponding path program 1 times [2019-01-12 01:01:09,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:01:09,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:01:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:09,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:01:09,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:01:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-12 01:01:09,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 01:01:09,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 01:01:09,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 01:01:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 01:01:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:01:09,563 INFO L87 Difference]: Start difference. First operand 211459 states and 234788 transitions. Second operand 4 states. [2019-01-12 01:01:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:01:12,370 INFO L93 Difference]: Finished difference Result 439440 states and 488457 transitions. [2019-01-12 01:01:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 01:01:12,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 327 [2019-01-12 01:01:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:01:12,597 INFO L225 Difference]: With dead ends: 439440 [2019-01-12 01:01:12,597 INFO L226 Difference]: Without dead ends: 227983 [2019-01-12 01:01:12,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 01:01:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227983 states. [2019-01-12 01:01:15,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227983 to 227929. [2019-01-12 01:01:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227929 states. [2019-01-12 01:01:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227929 states to 227929 states and 252579 transitions. [2019-01-12 01:01:16,207 INFO L78 Accepts]: Start accepts. Automaton has 227929 states and 252579 transitions. Word has length 327 [2019-01-12 01:01:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:01:16,207 INFO L480 AbstractCegarLoop]: Abstraction has 227929 states and 252579 transitions. [2019-01-12 01:01:16,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 01:01:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 227929 states and 252579 transitions. [2019-01-12 01:01:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-01-12 01:01:16,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 01:01:16,239 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 01:01:16,239 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 01:01:16,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 01:01:16,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1148442132, now seen corresponding path program 1 times [2019-01-12 01:01:16,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 01:01:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 01:01:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:16,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:01:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 01:01:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:01:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-01-12 01:01:16,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 01:01:16,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 01:01:16,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 01:01:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 01:01:16,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 01:01:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-01-12 01:01:16,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 01:01:16,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 01:01:16,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 01:01:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 01:01:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 01:01:16,654 INFO L87 Difference]: Start difference. First operand 227929 states and 252579 transitions. Second operand 6 states. [2019-01-12 01:01:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 01:01:23,447 INFO L93 Difference]: Finished difference Result 663584 states and 735658 transitions. [2019-01-12 01:01:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 01:01:23,448 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2019-01-12 01:01:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 01:01:23,448 INFO L225 Difference]: With dead ends: 663584 [2019-01-12 01:01:23,448 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 01:01:23,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-12 01:01:23,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 01:01:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 01:01:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 01:01:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 01:01:23,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2019-01-12 01:01:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 01:01:23,606 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 01:01:23,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 01:01:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 01:01:23,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 01:01:23,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 01:01:30,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:30,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:31,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,412 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:32,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:33,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:33,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:33,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:34,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:35,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:35,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:35,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:35,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:36,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:36,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:36,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:36,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:37,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:38,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:38,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:38,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:38,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:39,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:39,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:40,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:41,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:41,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:41,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:42,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:42,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:42,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:43,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:44,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:45,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:45,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:46,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:46,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:47,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:48,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:49,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:49,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:49,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:50,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:50,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:50,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:52,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:54,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:54,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:55,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:01:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:00,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:00,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:01,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:02,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:07,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:08,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:09,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:10,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:11,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:11,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:13,166 WARN L181 SmtUtils]: Spent 49.53 s on a formula simplification. DAG size of input: 3167 DAG size of output: 2018 [2019-01-12 01:02:18,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:18,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:19,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,606 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:20,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:21,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:21,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:21,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:21,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:22,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:22,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:22,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:22,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:22,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:23,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:23,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:23,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:23,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:24,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:24,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:24,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:24,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:24,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:25,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:25,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:25,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:26,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:27,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:27,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:27,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:28,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:28,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:28,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:29,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:30,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:31,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:31,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:31,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:32,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:33,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:33,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:34,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:35,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:36,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:36,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:37,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:39,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:40,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:41,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:44,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:47,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:47,462 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:48,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:49,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:54,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:55,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:56,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:57,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:58,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:02:58,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 01:03:00,035 WARN L181 SmtUtils]: Spent 46.86 s on a formula simplification. DAG size of input: 3167 DAG size of output: 2018 [2019-01-12 01:03:57,608 WARN L181 SmtUtils]: Spent 57.55 s on a formula simplification. DAG size of input: 1954 DAG size of output: 111 [2019-01-12 01:04:55,838 WARN L181 SmtUtils]: Spent 58.22 s on a formula simplification. DAG size of input: 1954 DAG size of output: 111 [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,842 INFO L448 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,843 INFO L448 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,844 INFO L448 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1545) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,845 INFO L448 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-01-12 01:04:55,846 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,847 INFO L448 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-01-12 01:04:55,848 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-01-12 01:04:55,849 INFO L448 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-01-12 01:04:55,850 INFO L448 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,851 INFO L448 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,852 INFO L448 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-01-12 01:04:55,853 INFO L448 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-01-12 01:04:55,854 INFO L448 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-01-12 01:04:55,854 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,854 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,854 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L444 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse12 (= ~a27~0 1)) (.cse0 (= ~a12~0 1))) (let ((.cse1 (= ~a6~0 1)) (.cse11 (not .cse0)) (.cse22 (not .cse12)) (.cse17 (= ~a16~0 1))) (let ((.cse4 (not (= ~a11~0 1))) (.cse19 (not (= ~a20~0 1))) (.cse3 (= ~a5~0 1)) (.cse24 (and .cse11 .cse22 .cse17)) (.cse13 (not .cse1))) (let ((.cse14 (and .cse24 .cse13)) (.cse8 (and .cse19 .cse12 .cse3 .cse17)) (.cse21 (and .cse22 .cse17 .cse4)) (.cse2 (<= ~a26~0 0)) (.cse6 (<= 2 ~a3~0)) (.cse9 (= ~a29~0 1)) (.cse16 (and .cse11 .cse4)) (.cse23 (<= ~a17~0 0)) (.cse15 (<= ~a27~0 0)) (.cse10 (<= ~a3~0 0)) (.cse20 (not (= ~a17~0 1))) (.cse7 (= ~a26~0 1)) (.cse18 (= ~a15~0 1)) (.cse5 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8) (and .cse9 (and .cse10 (and .cse11 .cse12 .cse13 .cse3))) (and (and .cse3 .cse5 .cse14) .cse7) (and (<= ~a6~0 0) .cse0 .cse3 .cse7 .cse15) (and .cse12 .cse16 .cse3 .cse17) (and .cse3 .cse9 .cse7 .cse18 .cse14 .cse15) (and (and .cse19 .cse12 .cse16 .cse3) .cse20) (and .cse10 .cse0 .cse3 .cse7) (and .cse21 .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse5 (and .cse22 .cse17)) (and (and .cse20 .cse8) .cse7 .cse18) (and .cse11 .cse6 .cse3 .cse7) (and .cse6 (and .cse2 .cse3 (and .cse12 .cse13 .cse4) .cse20)) (and (and .cse16 .cse3) .cse6) (and (and .cse3 (and (and .cse11 .cse19 .cse12) .cse13)) .cse20) (and .cse13 .cse23 (and .cse3 (and .cse16 .cse17) .cse5) .cse15) (and .cse11 .cse12 .cse3 .cse7) (and .cse6 .cse18 (and .cse13 (and .cse11 .cse19 .cse12 .cse3))) (and .cse3 .cse7 .cse4) (and .cse6 .cse12 .cse2 .cse3 .cse9 .cse4) (and .cse3 .cse7 .cse18 .cse5 (and .cse11 .cse19)) (and (and .cse10 .cse3 .cse20) .cse7) (and .cse10 .cse12 .cse0 .cse3 .cse17 .cse20) (and .cse12 .cse1 .cse16 .cse3 .cse9) (and (and .cse11 .cse12 .cse13 .cse17) .cse3) (and .cse10 .cse0 .cse13 .cse2 .cse3 .cse4 .cse15) (and .cse6 .cse3 .cse9 .cse7 (and .cse12 .cse13)) (and .cse21 .cse10 .cse0 .cse2 .cse3) (and .cse11 .cse6 .cse12 .cse1 .cse2 .cse3) (and (not .cse7) .cse6 .cse12 .cse0 .cse1 .cse23 .cse3 .cse17) (and .cse6 (and .cse11 .cse13) .cse2 .cse3 .cse15) (and .cse6 .cse9 (and .cse12 .cse3 .cse17 .cse4)) (and (and .cse12 .cse13 .cse17) .cse23 .cse3 .cse9 .cse7) (and (and .cse3 (and (and .cse19 .cse16) .cse13) .cse5) .cse23 .cse15) (and (and .cse10 (and .cse19 .cse12) .cse3) .cse20) (and .cse24 .cse3 .cse7 .cse18 .cse5)))))) [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,855 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L451 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-01-12 01:04:55,856 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-01-12 01:04:55,857 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,858 INFO L448 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,858 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:04:55,858 INFO L448 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-01-12 01:04:55,858 INFO L448 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,858 INFO L444 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse12 (= ~a27~0 1)) (.cse0 (= ~a12~0 1))) (let ((.cse1 (= ~a6~0 1)) (.cse11 (not .cse0)) (.cse22 (not .cse12)) (.cse17 (= ~a16~0 1))) (let ((.cse4 (not (= ~a11~0 1))) (.cse19 (not (= ~a20~0 1))) (.cse3 (= ~a5~0 1)) (.cse24 (and .cse11 .cse22 .cse17)) (.cse13 (not .cse1))) (let ((.cse14 (and .cse24 .cse13)) (.cse8 (and .cse19 .cse12 .cse3 .cse17)) (.cse21 (and .cse22 .cse17 .cse4)) (.cse2 (<= ~a26~0 0)) (.cse6 (<= 2 ~a3~0)) (.cse9 (= ~a29~0 1)) (.cse16 (and .cse11 .cse4)) (.cse23 (<= ~a17~0 0)) (.cse15 (<= ~a27~0 0)) (.cse10 (<= ~a3~0 0)) (.cse20 (not (= ~a17~0 1))) (.cse7 (= ~a26~0 1)) (.cse18 (= ~a15~0 1)) (.cse5 (= ~a3~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8) (and .cse9 (and .cse10 (and .cse11 .cse12 .cse13 .cse3))) (and (and .cse3 .cse5 .cse14) .cse7) (and (<= ~a6~0 0) .cse0 .cse3 .cse7 .cse15) (and .cse12 .cse16 .cse3 .cse17) (and .cse3 .cse9 .cse7 .cse18 .cse14 .cse15) (and (and .cse19 .cse12 .cse16 .cse3) .cse20) (and .cse10 .cse0 .cse3 .cse7) (and .cse21 .cse6 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse5 (and .cse22 .cse17)) (and (and .cse20 .cse8) .cse7 .cse18) (and .cse11 .cse6 .cse3 .cse7) (and .cse6 (and .cse2 .cse3 (and .cse12 .cse13 .cse4) .cse20)) (and (and .cse16 .cse3) .cse6) (and (and .cse3 (and (and .cse11 .cse19 .cse12) .cse13)) .cse20) (and .cse13 .cse23 (and .cse3 (and .cse16 .cse17) .cse5) .cse15) (and .cse11 .cse12 .cse3 .cse7) (and .cse6 .cse18 (and .cse13 (and .cse11 .cse19 .cse12 .cse3))) (and .cse3 .cse7 .cse4) (and .cse6 .cse12 .cse2 .cse3 .cse9 .cse4) (and .cse3 .cse7 .cse18 .cse5 (and .cse11 .cse19)) (and (and .cse10 .cse3 .cse20) .cse7) (and .cse10 .cse12 .cse0 .cse3 .cse17 .cse20) (and .cse12 .cse1 .cse16 .cse3 .cse9) (and (and .cse11 .cse12 .cse13 .cse17) .cse3) (and .cse10 .cse0 .cse13 .cse2 .cse3 .cse4 .cse15) (and .cse6 .cse3 .cse9 .cse7 (and .cse12 .cse13)) (and .cse21 .cse10 .cse0 .cse2 .cse3) (and .cse11 .cse6 .cse12 .cse1 .cse2 .cse3) (and (not .cse7) .cse6 .cse12 .cse0 .cse1 .cse23 .cse3 .cse17) (and .cse6 (and .cse11 .cse13) .cse2 .cse3 .cse15) (and .cse6 .cse9 (and .cse12 .cse3 .cse17 .cse4)) (and (and .cse12 .cse13 .cse17) .cse23 .cse3 .cse9 .cse7) (and (and .cse3 (and (and .cse19 .cse16) .cse13) .cse5) .cse23 .cse15) (and (and .cse10 (and .cse19 .cse12) .cse3) .cse20) (and .cse24 .cse3 .cse7 .cse18 .cse5)))))) [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,859 INFO L448 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,860 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-01-12 01:04:55,861 INFO L448 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-01-12 01:04:55,862 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,863 INFO L448 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,864 INFO L448 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,865 INFO L448 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,866 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-01-12 01:04:55,867 INFO L448 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,868 INFO L448 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-01-12 01:04:55,869 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,870 INFO L448 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-01-12 01:04:55,870 INFO L448 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-01-12 01:04:55,870 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,870 INFO L448 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-01-12 01:04:55,870 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-01-12 01:04:55,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 01:04:55 BoogieIcfgContainer [2019-01-12 01:04:55,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 01:04:55,947 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 01:04:55,947 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 01:04:55,947 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 01:04:55,948 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 01:00:00" (3/4) ... [2019-01-12 01:04:55,958 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 01:04:56,029 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 01:04:56,033 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 01:04:56,339 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 01:04:56,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 01:04:56,341 INFO L168 Benchmark]: Toolchain (without parser) took 303151.58 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 935.3 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,342 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 01:04:56,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1476.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 935.3 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 158.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,343 INFO L168 Benchmark]: Boogie Preprocessor took 120.98 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: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,343 INFO L168 Benchmark]: RCFGBuilder took 5912.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 254.5 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,344 INFO L168 Benchmark]: TraceAbstraction took 295085.75 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 873.6 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,344 INFO L168 Benchmark]: Witness Printer took 392.70 ms. Allocated memory is still 6.1 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 73.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. [2019-01-12 01:04:56,347 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1476.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 935.3 MB in the beginning and 1.2 GB in the end (delta: -224.1 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 158.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 120.98 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: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5912.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.2 MB in the end (delta: 254.5 MB). Peak memory consumption was 254.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 295085.75 ms. Allocated memory was 1.2 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 873.6 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. * Witness Printer took 392.70 ms. Allocated memory is still 6.1 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 73.7 MB). Peak memory consumption was 73.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1545]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((a12 == 1 && a6 == 1) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a3 == 1) || ((2 <= a3 && a26 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (a29 == 1 && a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1)) || (((a5 == 1 && a3 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1)) && a26 == 1)) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && a16 == 1)) || (((((a5 == 1 && a29 == 1) && a26 == 1) && a15 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1)) && a27 <= 0)) || ((((!(a20 == 1) && a27 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && !(a17 == 1))) || (((a3 <= 0 && a12 == 1) && a5 == 1) && a26 == 1)) || ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && 2 <= a3) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((a12 == 1 && a6 == 1) && a26 <= 0) && a5 == 1) && a3 == 1) && !(a27 == 1) && a16 == 1)) || (((!(a17 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1)) || (((!(a12 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (2 <= a3 && ((a26 <= 0 && a5 == 1) && (a27 == 1 && !(a6 == 1)) && !(a11 == 1)) && !(a17 == 1))) || (((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && 2 <= a3)) || ((a5 == 1 && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && !(a6 == 1)) && !(a17 == 1))) || (((!(a6 == 1) && a17 <= 0) && (a5 == 1 && (!(a12 == 1) && !(a11 == 1)) && a16 == 1) && a3 == 1) && a27 <= 0)) || (((!(a12 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((2 <= a3 && a15 == 1) && !(a6 == 1) && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && a5 == 1)) || ((a5 == 1 && a26 == 1) && !(a11 == 1))) || (((((2 <= a3 && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1) && !(a11 == 1))) || ((((a5 == 1 && a26 == 1) && a15 == 1) && a3 == 1) && !(a12 == 1) && !(a20 == 1))) || (((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1) && !(a17 == 1))) || ((((a27 == 1 && a6 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && a29 == 1)) || ((((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && a5 == 1)) || ((((((a3 <= 0 && a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || ((((2 <= a3 && a5 == 1) && a29 == 1) && a26 == 1) && a27 == 1 && !(a6 == 1))) || ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && a3 <= 0) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((!(a12 == 1) && 2 <= a3) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((((!(a26 == 1) && 2 <= a3) && a27 == 1) && a12 == 1) && a6 == 1) && a17 <= 0) && a5 == 1) && a16 == 1)) || ((((2 <= a3 && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && a27 <= 0)) || ((2 <= a3 && a29 == 1) && ((a27 == 1 && a5 == 1) && a16 == 1) && !(a11 == 1))) || ((((((a27 == 1 && !(a6 == 1)) && a16 == 1) && a17 <= 0) && a5 == 1) && a29 == 1) && a26 == 1)) || ((((a5 == 1 && (!(a20 == 1) && !(a12 == 1) && !(a11 == 1)) && !(a6 == 1)) && a3 == 1) && a17 <= 0) && a27 <= 0)) || (((a3 <= 0 && !(a20 == 1) && a27 == 1) && a5 == 1) && !(a17 == 1))) || ((((((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a3 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((a12 == 1 && a6 == 1) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a3 == 1) || ((2 <= a3 && a26 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1)) || (a29 == 1 && a3 <= 0 && ((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a5 == 1)) || (((a5 == 1 && a3 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1)) && a26 == 1)) || ((((a6 <= 0 && a12 == 1) && a5 == 1) && a26 == 1) && a27 <= 0)) || (((a27 == 1 && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && a16 == 1)) || (((((a5 == 1 && a29 == 1) && a26 == 1) && a15 == 1) && ((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && !(a6 == 1)) && a27 <= 0)) || ((((!(a20 == 1) && a27 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && !(a17 == 1))) || (((a3 <= 0 && a12 == 1) && a5 == 1) && a26 == 1)) || ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && 2 <= a3) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((a12 == 1 && a6 == 1) && a26 <= 0) && a5 == 1) && a3 == 1) && !(a27 == 1) && a16 == 1)) || (((!(a17 == 1) && ((!(a20 == 1) && a27 == 1) && a5 == 1) && a16 == 1) && a26 == 1) && a15 == 1)) || (((!(a12 == 1) && 2 <= a3) && a5 == 1) && a26 == 1)) || (2 <= a3 && ((a26 <= 0 && a5 == 1) && (a27 == 1 && !(a6 == 1)) && !(a11 == 1)) && !(a17 == 1))) || (((!(a12 == 1) && !(a11 == 1)) && a5 == 1) && 2 <= a3)) || ((a5 == 1 && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && !(a6 == 1)) && !(a17 == 1))) || (((!(a6 == 1) && a17 <= 0) && (a5 == 1 && (!(a12 == 1) && !(a11 == 1)) && a16 == 1) && a3 == 1) && a27 <= 0)) || (((!(a12 == 1) && a27 == 1) && a5 == 1) && a26 == 1)) || ((2 <= a3 && a15 == 1) && !(a6 == 1) && ((!(a12 == 1) && !(a20 == 1)) && a27 == 1) && a5 == 1)) || ((a5 == 1 && a26 == 1) && !(a11 == 1))) || (((((2 <= a3 && a27 == 1) && a26 <= 0) && a5 == 1) && a29 == 1) && !(a11 == 1))) || ((((a5 == 1 && a26 == 1) && a15 == 1) && a3 == 1) && !(a12 == 1) && !(a20 == 1))) || (((a3 <= 0 && a5 == 1) && !(a17 == 1)) && a26 == 1)) || (((((a3 <= 0 && a27 == 1) && a12 == 1) && a5 == 1) && a16 == 1) && !(a17 == 1))) || ((((a27 == 1 && a6 == 1) && !(a12 == 1) && !(a11 == 1)) && a5 == 1) && a29 == 1)) || ((((!(a12 == 1) && a27 == 1) && !(a6 == 1)) && a16 == 1) && a5 == 1)) || ((((((a3 <= 0 && a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && !(a11 == 1)) && a27 <= 0)) || ((((2 <= a3 && a5 == 1) && a29 == 1) && a26 == 1) && a27 == 1 && !(a6 == 1))) || ((((((!(a27 == 1) && a16 == 1) && !(a11 == 1)) && a3 <= 0) && a12 == 1) && a26 <= 0) && a5 == 1)) || (((((!(a12 == 1) && 2 <= a3) && a27 == 1) && a6 == 1) && a26 <= 0) && a5 == 1)) || (((((((!(a26 == 1) && 2 <= a3) && a27 == 1) && a12 == 1) && a6 == 1) && a17 <= 0) && a5 == 1) && a16 == 1)) || ((((2 <= a3 && !(a12 == 1) && !(a6 == 1)) && a26 <= 0) && a5 == 1) && a27 <= 0)) || ((2 <= a3 && a29 == 1) && ((a27 == 1 && a5 == 1) && a16 == 1) && !(a11 == 1))) || ((((((a27 == 1 && !(a6 == 1)) && a16 == 1) && a17 <= 0) && a5 == 1) && a29 == 1) && a26 == 1)) || ((((a5 == 1 && (!(a20 == 1) && !(a12 == 1) && !(a11 == 1)) && !(a6 == 1)) && a3 == 1) && a17 <= 0) && a27 <= 0)) || (((a3 <= 0 && !(a20 == 1) && a27 == 1) && a5 == 1) && !(a17 == 1))) || ((((((!(a12 == 1) && !(a27 == 1)) && a16 == 1) && a5 == 1) && a26 == 1) && a15 == 1) && a3 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. SAFE Result, 294.9s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 49.5s AutomataDifference, 0.0s DeadEndRemovalTime, 212.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 4005 SDtfs, 9840 SDslu, 2460 SDs, 0 SdLazy, 16618 SolverSat, 2996 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 603 GetRequests, 559 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227929occurred in iteration=19, 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: 26.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 92630 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 3884 NumberOfFragments, 1641 HoareAnnotationTreeSize, 3 FomulaSimplifications, 212820 FormulaSimplificationTreeSizeReduction, 96.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 505838 FormulaSimplificationTreeSizeReductionInter, 115.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 5483 NumberOfCodeBlocks, 5483 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 5461 ConstructedInterpolants, 0 QuantifiedInterpolants, 2575120 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 2520/2531 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...