./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.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/Problem01_label27_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1af67db67a88433de1a31e57b46e50dcbb6e7d8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:52:41,391 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:52:41,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:52:41,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:52:41,412 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:52:41,414 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:52:41,417 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:52:41,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:52:41,421 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:52:41,422 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:52:41,423 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:52:41,423 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:52:41,424 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:52:41,425 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:52:41,426 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:52:41,428 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:52:41,428 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:52:41,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:52:41,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:52:41,435 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:52:41,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:52:41,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:52:41,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:52:41,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:52:41,441 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:52:41,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:52:41,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:52:41,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:52:41,445 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:52:41,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:52:41,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:52:41,448 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:52:41,448 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:52:41,448 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:52:41,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:52:41,450 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:52:41,451 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:52:41,476 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:52:41,477 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:52:41,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:52:41,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:52:41,479 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:52:41,479 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:52:41,479 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:52:41,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:52:41,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:52:41,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:52:41,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:52:41,481 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:52:41,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:52:41,482 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:52:41,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:52:41,482 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:52:41,482 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:52:41,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:52:41,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:52:41,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:52:41,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:52:41,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:52:41,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:52:41,485 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:52:41,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:52:41,486 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:52:41,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:52:41,486 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:52:41,486 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 -> e1af67db67a88433de1a31e57b46e50dcbb6e7d8 [2019-01-12 00:52:41,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:52:41,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:52:41,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:52:41,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:52:41,587 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:52:41,588 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2019-01-12 00:52:41,665 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1712bbeb/51ead98f2785470eab02c8f8ff81137c/FLAGba1d3ee37 [2019-01-12 00:52:42,186 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:52:42,187 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label27_true-unreach-call_false-termination.c [2019-01-12 00:52:42,198 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1712bbeb/51ead98f2785470eab02c8f8ff81137c/FLAGba1d3ee37 [2019-01-12 00:52:42,436 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1712bbeb/51ead98f2785470eab02c8f8ff81137c [2019-01-12 00:52:42,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:52:42,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:52:42,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:42,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:52:42,447 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:52:42,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:42" (1/1) ... [2019-01-12 00:52:42,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fc82f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:42, skipping insertion in model container [2019-01-12 00:52:42,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:52:42" (1/1) ... [2019-01-12 00:52:42,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:52:42,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:52:42,989 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:42,994 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:52:43,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:52:43,159 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:52:43,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43 WrapperNode [2019-01-12 00:52:43,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:52:43,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:43,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:52:43,161 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:52:43,175 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:52:43" (1/1) ... [2019-01-12 00:52:43,287 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:52:43" (1/1) ... [2019-01-12 00:52:43,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:52:43,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:52:43,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:52:43,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:52:43,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (1/1) ... [2019-01-12 00:52:43,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:52:43,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:52:43,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:52:43,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:52:43,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (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:52:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:52:43,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:52:46,411 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:52:46,411 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:52:46,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:46 BoogieIcfgContainer [2019-01-12 00:52:46,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:52:46,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:52:46,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:52:46,418 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:52:46,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:52:42" (1/3) ... [2019-01-12 00:52:46,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734de7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:46, skipping insertion in model container [2019-01-12 00:52:46,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:52:43" (2/3) ... [2019-01-12 00:52:46,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@734de7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:52:46, skipping insertion in model container [2019-01-12 00:52:46,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:46" (3/3) ... [2019-01-12 00:52:46,422 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label27_true-unreach-call_false-termination.c [2019-01-12 00:52:46,433 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:52:46,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:52:46,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:52:46,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:52:46,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:52:46,495 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:52:46,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:52:46,496 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:52:46,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:52:46,496 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:52:46,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:52:46,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:52:46,518 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:52:46,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-12 00:52:46,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:46,535 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] [2019-01-12 00:52:46,542 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:46,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:46,550 INFO L82 PathProgramCache]: Analyzing trace with hash 857291087, now seen corresponding path program 1 times [2019-01-12 00:52:46,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:46,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:46,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:46,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:46,965 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 00:52:46,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:46,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:46,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:46,994 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-01-12 00:52:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:48,680 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-01-12 00:52:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:48,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-01-12 00:52:48,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:48,698 INFO L225 Difference]: With dead ends: 528 [2019-01-12 00:52:48,698 INFO L226 Difference]: Without dead ends: 266 [2019-01-12 00:52:48,703 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 00:52:48,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-12 00:52:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-01-12 00:52:48,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:52:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-01-12 00:52:48,766 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 88 [2019-01-12 00:52:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:48,767 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-01-12 00:52:48,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-01-12 00:52:48,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 00:52:48,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:48,772 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] [2019-01-12 00:52:48,772 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:48,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1648492327, now seen corresponding path program 1 times [2019-01-12 00:52:48,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:48,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:48,888 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 00:52:48,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:48,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:48,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:48,892 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-01-12 00:52:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:49,994 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-01-12 00:52:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:49,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-01-12 00:52:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:50,000 INFO L225 Difference]: With dead ends: 792 [2019-01-12 00:52:50,001 INFO L226 Difference]: Without dead ends: 528 [2019-01-12 00:52:50,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-12 00:52:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-01-12 00:52:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-12 00:52:50,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-01-12 00:52:50,045 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 93 [2019-01-12 00:52:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:50,046 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-01-12 00:52:50,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-01-12 00:52:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 00:52:50,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:50,051 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:52:50,052 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:50,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:50,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1380296349, now seen corresponding path program 1 times [2019-01-12 00:52:50,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:50,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:50,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:50,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:50,162 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-01-12 00:52:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:51,638 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-01-12 00:52:51,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:52:51,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-01-12 00:52:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:51,648 INFO L225 Difference]: With dead ends: 2102 [2019-01-12 00:52:51,648 INFO L226 Difference]: Without dead ends: 1576 [2019-01-12 00:52:51,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-01-12 00:52:51,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-01-12 00:52:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:52:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2049 transitions. [2019-01-12 00:52:51,720 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2049 transitions. Word has length 97 [2019-01-12 00:52:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:51,720 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 2049 transitions. [2019-01-12 00:52:51,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2049 transitions. [2019-01-12 00:52:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-12 00:52:51,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:51,728 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:52:51,728 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 406434676, now seen corresponding path program 1 times [2019-01-12 00:52:51,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:51,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:51,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-12 00:52:51,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:51,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:51,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:51,847 INFO L87 Difference]: Start difference. First operand 1576 states and 2049 transitions. Second operand 3 states. [2019-01-12 00:52:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:54,276 INFO L93 Difference]: Finished difference Result 3412 states and 4461 transitions. [2019-01-12 00:52:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:54,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-01-12 00:52:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:54,287 INFO L225 Difference]: With dead ends: 3412 [2019-01-12 00:52:54,287 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:52:54,290 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 00:52:54,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:52:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-01-12 00:52:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-01-12 00:52:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1702 transitions. [2019-01-12 00:52:54,330 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1702 transitions. Word has length 100 [2019-01-12 00:52:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:54,330 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1702 transitions. [2019-01-12 00:52:54,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1702 transitions. [2019-01-12 00:52:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-12 00:52:54,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:54,334 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:52:54,334 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:54,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2015967182, now seen corresponding path program 1 times [2019-01-12 00:52:54,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:54,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:54,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:54,705 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:52:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:54,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:54,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:54,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:54,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:54,731 INFO L87 Difference]: Start difference. First operand 1314 states and 1702 transitions. Second operand 4 states. [2019-01-12 00:52:54,878 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 00:52:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:55,599 INFO L93 Difference]: Finished difference Result 2762 states and 3556 transitions. [2019-01-12 00:52:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:52:55,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-01-12 00:52:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:55,608 INFO L225 Difference]: With dead ends: 2762 [2019-01-12 00:52:55,609 INFO L226 Difference]: Without dead ends: 1450 [2019-01-12 00:52:55,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-01-12 00:52:55,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-01-12 00:52:55,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1839 transitions. [2019-01-12 00:52:55,647 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1839 transitions. Word has length 103 [2019-01-12 00:52:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:55,648 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1839 transitions. [2019-01-12 00:52:55,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:52:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1839 transitions. [2019-01-12 00:52:55,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-12 00:52:55,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:55,654 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:55,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:55,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:55,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2265750, now seen corresponding path program 1 times [2019-01-12 00:52:55,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:55,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:55,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:55,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:55,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:52:55,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:52:55,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:52:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:55,818 INFO L87 Difference]: Start difference. First operand 1445 states and 1839 transitions. Second operand 5 states. [2019-01-12 00:52:57,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:57,032 INFO L93 Difference]: Finished difference Result 2757 states and 3539 transitions. [2019-01-12 00:52:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:52:57,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-01-12 00:52:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:57,042 INFO L225 Difference]: With dead ends: 2757 [2019-01-12 00:52:57,042 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:52:57,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:52:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:52:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:52:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1809 transitions. [2019-01-12 00:52:57,076 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1809 transitions. Word has length 107 [2019-01-12 00:52:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:57,077 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1809 transitions. [2019-01-12 00:52:57,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:52:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1809 transitions. [2019-01-12 00:52:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-12 00:52:57,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:57,081 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:57,081 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 68334944, now seen corresponding path program 1 times [2019-01-12 00:52:57,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:52:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:52:57,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:57,217 INFO L87 Difference]: Start difference. First operand 1445 states and 1809 transitions. Second operand 3 states. [2019-01-12 00:52:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:58,003 INFO L93 Difference]: Finished difference Result 2757 states and 3479 transitions. [2019-01-12 00:52:58,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:58,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-01-12 00:52:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:58,010 INFO L225 Difference]: With dead ends: 2757 [2019-01-12 00:52:58,010 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:52:58,013 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 00:52:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:52:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:52:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:52:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1803 transitions. [2019-01-12 00:52:58,041 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1803 transitions. Word has length 108 [2019-01-12 00:52:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:58,042 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1803 transitions. [2019-01-12 00:52:58,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1803 transitions. [2019-01-12 00:52:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-12 00:52:58,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:58,046 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:52:58,046 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:58,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:58,047 INFO L82 PathProgramCache]: Analyzing trace with hash -69619749, now seen corresponding path program 1 times [2019-01-12 00:52:58,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:58,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:58,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:58,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:58,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:52:58,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:52:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:52:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:52:58,128 INFO L87 Difference]: Start difference. First operand 1445 states and 1803 transitions. Second operand 3 states. [2019-01-12 00:52:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:52:58,693 INFO L93 Difference]: Finished difference Result 3150 states and 3946 transitions. [2019-01-12 00:52:58,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:52:58,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-01-12 00:52:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:52:58,702 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:52:58,703 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:52:58,706 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 00:52:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:52:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-01-12 00:52:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:52:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1741 transitions. [2019-01-12 00:52:58,744 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1741 transitions. Word has length 110 [2019-01-12 00:52:58,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:52:58,745 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1741 transitions. [2019-01-12 00:52:58,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:52:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1741 transitions. [2019-01-12 00:52:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 00:52:58,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:52:58,749 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:58,750 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:52:58,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:52:58,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1256717015, now seen corresponding path program 1 times [2019-01-12 00:52:58,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:52:58,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:52:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:58,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:52:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:52:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:52:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:52:58,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:52:58,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:52:58,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:52:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:52:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:52:58,953 INFO L87 Difference]: Start difference. First operand 1576 states and 1741 transitions. Second operand 4 states. [2019-01-12 00:53:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:00,053 INFO L93 Difference]: Finished difference Result 3150 states and 3502 transitions. [2019-01-12 00:53:00,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:00,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-01-12 00:53:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:00,060 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:53:00,060 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:53:00,062 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 00:53:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:53:00,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-01-12 00:53:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:53:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1545 transitions. [2019-01-12 00:53:00,089 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1545 transitions. Word has length 125 [2019-01-12 00:53:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:00,090 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1545 transitions. [2019-01-12 00:53:00,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1545 transitions. [2019-01-12 00:53:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-12 00:53:00,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:00,095 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:00,095 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:00,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:00,095 INFO L82 PathProgramCache]: Analyzing trace with hash 144240950, now seen corresponding path program 1 times [2019-01-12 00:53:00,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:00,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:00,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:00,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:00,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:01,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 00:53:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 00:53:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 00:53:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2019-01-12 00:53:01,100 INFO L87 Difference]: Start difference. First operand 1445 states and 1545 transitions. Second operand 13 states. [2019-01-12 00:53:03,215 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-01-12 00:53:04,213 WARN L181 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-01-12 00:53:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:05,468 INFO L93 Difference]: Finished difference Result 3936 states and 4248 transitions. [2019-01-12 00:53:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 00:53:05,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-01-12 00:53:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:05,479 INFO L225 Difference]: With dead ends: 3936 [2019-01-12 00:53:05,479 INFO L226 Difference]: Without dead ends: 2624 [2019-01-12 00:53:05,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=193, Unknown=0, NotChecked=0, Total=342 [2019-01-12 00:53:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-01-12 00:53:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1771. [2019-01-12 00:53:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-01-12 00:53:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1899 transitions. [2019-01-12 00:53:05,516 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1899 transitions. Word has length 138 [2019-01-12 00:53:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:05,517 INFO L480 AbstractCegarLoop]: Abstraction has 1771 states and 1899 transitions. [2019-01-12 00:53:05,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 00:53:05,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1899 transitions. [2019-01-12 00:53:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-12 00:53:05,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:05,523 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:53:05,523 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1039496222, now seen corresponding path program 1 times [2019-01-12 00:53:05,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:05,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:05,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:05,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:06,050 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2019-01-12 00:53:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 00:53:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:06,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:06,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:06,078 INFO L87 Difference]: Start difference. First operand 1771 states and 1899 transitions. Second operand 4 states. [2019-01-12 00:53:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:07,005 INFO L93 Difference]: Finished difference Result 3671 states and 3960 transitions. [2019-01-12 00:53:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:07,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-01-12 00:53:07,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:07,014 INFO L225 Difference]: With dead ends: 3671 [2019-01-12 00:53:07,015 INFO L226 Difference]: Without dead ends: 1902 [2019-01-12 00:53:07,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:07,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-01-12 00:53:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1771. [2019-01-12 00:53:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2019-01-12 00:53:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1876 transitions. [2019-01-12 00:53:07,052 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1876 transitions. Word has length 181 [2019-01-12 00:53:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:07,053 INFO L480 AbstractCegarLoop]: Abstraction has 1771 states and 1876 transitions. [2019-01-12 00:53:07,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1876 transitions. [2019-01-12 00:53:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-12 00:53:07,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:07,060 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:07,061 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 293882658, now seen corresponding path program 1 times [2019-01-12 00:53:07,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:07,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-01-12 00:53:07,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:07,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:07,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:07,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:07,347 INFO L87 Difference]: Start difference. First operand 1771 states and 1876 transitions. Second operand 4 states. [2019-01-12 00:53:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:08,220 INFO L93 Difference]: Finished difference Result 4652 states and 4929 transitions. [2019-01-12 00:53:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:08,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-01-12 00:53:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:08,233 INFO L225 Difference]: With dead ends: 4652 [2019-01-12 00:53:08,233 INFO L226 Difference]: Without dead ends: 2883 [2019-01-12 00:53:08,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-01-12 00:53:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2295. [2019-01-12 00:53:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2295 states. [2019-01-12 00:53:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2406 transitions. [2019-01-12 00:53:08,295 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2406 transitions. Word has length 230 [2019-01-12 00:53:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:08,295 INFO L480 AbstractCegarLoop]: Abstraction has 2295 states and 2406 transitions. [2019-01-12 00:53:08,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2406 transitions. [2019-01-12 00:53:08,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-12 00:53:08,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:08,304 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:08,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:08,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:08,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1503326134, now seen corresponding path program 1 times [2019-01-12 00:53:08,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:08,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:08,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:08,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:08,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-01-12 00:53:08,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:08,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:08,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:08,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:08,847 INFO L87 Difference]: Start difference. First operand 2295 states and 2406 transitions. Second operand 4 states. [2019-01-12 00:53:10,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:10,047 INFO L93 Difference]: Finished difference Result 5110 states and 5357 transitions. [2019-01-12 00:53:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:10,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-01-12 00:53:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:10,049 INFO L225 Difference]: With dead ends: 5110 [2019-01-12 00:53:10,049 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:10,052 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 00:53:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:10,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 233 [2019-01-12 00:53:10,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:10,053 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:10,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:10,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:10,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:10,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:10,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:10,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:11,208 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-01-12 00:53:11,987 WARN L181 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-01-12 00:53:11,991 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:11,991 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:11,991 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:11,992 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:11,993 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:11,994 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:11,995 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:11,996 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:11,996 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:11,996 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:11,996 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a16~0 4)) (.cse3 (= ~a21~0 1)) (.cse4 (= ~a17~0 1)) (.cse11 (= ~a8~0 15)) (.cse6 (= ~a16~0 6)) (.cse8 (= ~a7~0 1))) (let ((.cse2 (<= ~a17~0 0)) (.cse14 (= ~a8~0 14)) (.cse10 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse13 (= ~a16~0 5)) (.cse9 (not .cse6)) (.cse15 (not (= 5 ~a16~0))) (.cse5 (not .cse11)) (.cse12 (<= ~a20~0 0)) (.cse7 (and .cse0 .cse3 (not .cse4))) (.cse16 (not (= ~a20~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse5) (and .cse8 .cse9 .cse4 .cse3) (and .cse10 .cse11 .cse1 .cse3 .cse6) (and .cse8 .cse3 .cse12 .cse13) (and .cse8 .cse0 .cse2 .cse3) (and .cse14 .cse3 .cse12 .cse13) (and (and .cse8 .cse15) .cse5) (and .cse16 .cse11 .cse1 .cse3 .cse6) (and .cse8 .cse14 .cse3) (and .cse10 .cse11 .cse1 .cse3 .cse13) (and .cse9 .cse4 .cse15 .cse3) (and .cse8 .cse4 .cse5) (and .cse4 .cse3 .cse6 .cse12) (and .cse7 .cse16)))) [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:11,997 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,998 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:11,999 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:12,000 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:12,001 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a16~0 4)) (.cse3 (= ~a21~0 1)) (.cse4 (= ~a17~0 1)) (.cse11 (= ~a8~0 15)) (.cse6 (= ~a16~0 6)) (.cse8 (= ~a7~0 1))) (let ((.cse2 (<= ~a17~0 0)) (.cse14 (= ~a8~0 14)) (.cse10 (not .cse8)) (.cse1 (= ~a12~0 8)) (.cse13 (= ~a16~0 5)) (.cse9 (not .cse6)) (.cse15 (not (= 5 ~a16~0))) (.cse5 (not .cse11)) (.cse12 (<= ~a20~0 0)) (.cse7 (and .cse0 .cse3 (not .cse4))) (.cse16 (not (= ~a20~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse3 .cse6) (and .cse7 .cse5) (and .cse8 .cse9 .cse4 .cse3) (and .cse10 .cse11 .cse1 .cse3 .cse6) (and .cse8 .cse3 .cse12 .cse13) (and .cse8 .cse0 .cse2 .cse3) (and .cse14 .cse3 .cse12 .cse13) (and (and .cse8 .cse15) .cse5) (and .cse16 .cse11 .cse1 .cse3 .cse6) (and .cse8 .cse14 .cse3) (and .cse10 .cse11 .cse1 .cse3 .cse13) (and .cse9 .cse4 .cse15 .cse3) (and .cse8 .cse4 .cse5) (and .cse4 .cse3 .cse6 .cse12) (and .cse7 .cse16)))) [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:12,002 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:12,003 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,004 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:12,005 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 440) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,006 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:12,007 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,008 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:12,009 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:12,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:12 BoogieIcfgContainer [2019-01-12 00:53:12,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:12,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:12,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:12,052 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:12,052 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:52:46" (3/4) ... [2019-01-12 00:53:12,062 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:12,108 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:12,113 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:12,314 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:12,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:12,316 INFO L168 Benchmark]: Toolchain (without parser) took 29875.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 952.7 MB in the beginning and 928.3 MB in the end (delta: 24.4 MB). Peak memory consumption was 408.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,317 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:53:12,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.60 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,318 INFO L168 Benchmark]: Boogie Preprocessor took 110.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,320 INFO L168 Benchmark]: RCFGBuilder took 2947.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,320 INFO L168 Benchmark]: TraceAbstraction took 25636.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 998.7 MB in the beginning and 952.1 MB in the end (delta: 46.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,320 INFO L168 Benchmark]: Witness Printer took 263.50 ms. Allocated memory is still 1.4 GB. Free memory was 952.1 MB in the beginning and 928.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:12,324 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.60 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 194.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -193.2 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2947.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 106.9 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25636.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.9 MB). Free memory was 998.7 MB in the beginning and 952.1 MB in the end (delta: 46.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 11.5 GB. * Witness Printer took 263.50 ms. Allocated memory is still 1.4 GB. Free memory was 952.1 MB in the beginning and 928.3 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 440]: 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: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) || (((a17 == 1 && !(a8 == 15)) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(a8 == 15))) || (((a7 == 1 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a8 == 14 && a21 == 1) && a20 <= 0) && a16 == 5)) || ((a7 == 1 && !(5 == a16)) && !(a8 == 15))) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || (((!(a16 == 6) && a17 == 1) && !(5 == a16)) && a21 == 1)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(a20 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) || (((a17 == 1 && !(a8 == 15)) && a21 == 1) && a16 == 6)) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(a8 == 15))) || (((a7 == 1 && !(a16 == 6)) && a17 == 1) && a21 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || (((a7 == 1 && a21 == 1) && a20 <= 0) && a16 == 5)) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a8 == 14 && a21 == 1) && a20 <= 0) && a16 == 5)) || ((a7 == 1 && !(5 == a16)) && !(a8 == 15))) || ((((!(a20 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 6)) || ((a7 == 1 && a8 == 14) && a21 == 1)) || ((((!(a7 == 1) && a8 == 15) && a12 == 8) && a21 == 1) && a16 == 5)) || (((!(a16 == 6) && a17 == 1) && !(5 == a16)) && a21 == 1)) || ((a7 == 1 && a17 == 1) && !(a8 == 15))) || (((a17 == 1 && a21 == 1) && a16 == 6) && a20 <= 0)) || (((a16 == 4 && a21 == 1) && !(a17 == 1)) && !(a20 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 25.5s OverallTime, 13 OverallIterations, 6 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1188 SDtfs, 3694 SDslu, 158 SDs, 0 SdLazy, 7286 SolverSat, 949 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2295occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2494 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 57 NumberOfFragments, 453 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4932 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1128 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1713 NumberOfCodeBlocks, 1713 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1700 ConstructedInterpolants, 0 QuantifiedInterpolants, 913999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 945/945 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...