./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label52_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label52_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5cfaf62e1cdcc975c66b2a0c66e609c8cf7f16b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:42:53,408 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:42:53,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:42:53,425 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:42:53,425 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:42:53,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:42:53,428 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:42:53,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:42:53,432 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:42:53,433 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:42:53,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:42:53,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:42:53,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:42:53,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:42:53,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:42:53,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:42:53,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:42:53,441 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:42:53,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:42:53,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:42:53,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:42:53,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:42:53,451 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:42:53,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:42:53,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:42:53,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:42:53,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:42:53,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:42:53,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:42:53,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:42:53,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:42:53,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:42:53,458 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:42:53,458 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:42:53,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:42:53,460 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:42:53,461 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:42:53,482 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:42:53,483 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:42:53,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:42:53,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:42:53,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:42:53,486 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:42:53,486 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:42:53,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:42:53,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:42:53,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:42:53,487 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:42:53,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:42:53,489 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:42:53,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:42:53,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:42:53,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:42:53,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:42:53,490 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:42:53,491 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:42:53,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:42:53,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:42:53,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:42:53,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:42:53,493 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 -> 5cfaf62e1cdcc975c66b2a0c66e609c8cf7f16b1 [2019-01-12 03:42:53,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:42:53,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:42:53,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:42:53,582 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:42:53,582 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:42:53,583 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label52_true-unreach-call.c [2019-01-12 03:42:53,636 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380ba56e6/a6f7a672eb554787a789ff572881ea0d/FLAG993f6cac0 [2019-01-12 03:42:54,247 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:42:54,248 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label52_true-unreach-call.c [2019-01-12 03:42:54,260 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380ba56e6/a6f7a672eb554787a789ff572881ea0d/FLAG993f6cac0 [2019-01-12 03:42:54,488 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380ba56e6/a6f7a672eb554787a789ff572881ea0d [2019-01-12 03:42:54,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:42:54,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:42:54,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:42:54,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:42:54,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:42:54,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:42:54" (1/1) ... [2019-01-12 03:42:54,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8b5888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:54, skipping insertion in model container [2019-01-12 03:42:54,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:42:54" (1/1) ... [2019-01-12 03:42:54,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:42:54,575 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:42:55,200 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:42:55,205 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:42:55,449 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:42:55,467 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:42:55,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55 WrapperNode [2019-01-12 03:42:55,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:42:55,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:42:55,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:42:55,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:42:55,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:42:55,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:42:55,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:42:55,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:42:55,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... [2019-01-12 03:42:55,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:42:55,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:42:55,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:42:55,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:42:55,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:42:55,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:42:55,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:42:59,767 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:42:59,767 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:42:59,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:42:59 BoogieIcfgContainer [2019-01-12 03:42:59,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:42:59,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:42:59,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:42:59,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:42:59,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:42:54" (1/3) ... [2019-01-12 03:42:59,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d9c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:42:59, skipping insertion in model container [2019-01-12 03:42:59,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:42:55" (2/3) ... [2019-01-12 03:42:59,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a4d9c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:42:59, skipping insertion in model container [2019-01-12 03:42:59,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:42:59" (3/3) ... [2019-01-12 03:42:59,780 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label52_true-unreach-call.c [2019-01-12 03:42:59,791 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:42:59,800 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:42:59,817 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:42:59,864 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:42:59,865 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:42:59,865 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:42:59,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:42:59,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:42:59,866 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:42:59,867 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:42:59,867 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:42:59,867 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:42:59,903 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:42:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 03:42:59,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:42:59,914 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] [2019-01-12 03:42:59,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:42:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:42:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-01-12 03:42:59,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:42:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:42:59,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:42:59,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:42:59,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:00,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:00,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:00,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:00,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:00,412 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:43:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:04,161 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-01-12 03:43:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:04,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-01-12 03:43:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:04,197 INFO L225 Difference]: With dead ends: 966 [2019-01-12 03:43:04,198 INFO L226 Difference]: Without dead ends: 616 [2019-01-12 03:43:04,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:04,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-01-12 03:43:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-01-12 03:43:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-01-12 03:43:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-01-12 03:43:04,286 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 52 [2019-01-12 03:43:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:04,286 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-01-12 03:43:04,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-01-12 03:43:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 03:43:04,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:04,293 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:04,293 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2042685591, now seen corresponding path program 1 times [2019-01-12 03:43:04,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:04,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:04,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:04,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:04,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:04,586 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-01-12 03:43:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:07,564 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-01-12 03:43:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:07,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-01-12 03:43:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:07,581 INFO L225 Difference]: With dead ends: 2309 [2019-01-12 03:43:07,581 INFO L226 Difference]: Without dead ends: 1711 [2019-01-12 03:43:07,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-01-12 03:43:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-01-12 03:43:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-01-12 03:43:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-01-12 03:43:07,782 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 123 [2019-01-12 03:43:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:07,783 INFO L480 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-01-12 03:43:07,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-01-12 03:43:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 03:43:07,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:07,790 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:07,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:07,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:07,794 INFO L82 PathProgramCache]: Analyzing trace with hash -222846350, now seen corresponding path program 1 times [2019-01-12 03:43:07,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:07,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:07,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:08,138 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:08,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:08,140 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-01-12 03:43:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:10,636 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-01-12 03:43:10,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:10,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-01-12 03:43:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:10,657 INFO L225 Difference]: With dead ends: 5088 [2019-01-12 03:43:10,657 INFO L226 Difference]: Without dead ends: 3563 [2019-01-12 03:43:10,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-01-12 03:43:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-01-12 03:43:10,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-01-12 03:43:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-01-12 03:43:10,725 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 136 [2019-01-12 03:43:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:10,728 INFO L480 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-01-12 03:43:10,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-01-12 03:43:10,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-01-12 03:43:10,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:10,733 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:10,733 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1804040649, now seen corresponding path program 1 times [2019-01-12 03:43:10,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:10,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:10,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:11,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:11,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:11,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:11,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:11,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:11,033 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 4 states. [2019-01-12 03:43:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:12,772 INFO L93 Difference]: Finished difference Result 6938 states and 9010 transitions. [2019-01-12 03:43:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:12,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-01-12 03:43:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:12,794 INFO L225 Difference]: With dead ends: 6938 [2019-01-12 03:43:12,794 INFO L226 Difference]: Without dead ends: 4677 [2019-01-12 03:43:12,799 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 03:43:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2019-01-12 03:43:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 3548. [2019-01-12 03:43:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3548 states. [2019-01-12 03:43:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 4409 transitions. [2019-01-12 03:43:12,875 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 4409 transitions. Word has length 179 [2019-01-12 03:43:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:12,876 INFO L480 AbstractCegarLoop]: Abstraction has 3548 states and 4409 transitions. [2019-01-12 03:43:12,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 4409 transitions. [2019-01-12 03:43:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-12 03:43:12,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:12,885 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:12,886 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -686623931, now seen corresponding path program 1 times [2019-01-12 03:43:12,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:13,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:13,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:13,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:13,393 INFO L87 Difference]: Start difference. First operand 3548 states and 4409 transitions. Second operand 4 states. [2019-01-12 03:43:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:18,195 INFO L93 Difference]: Finished difference Result 8578 states and 10723 transitions. [2019-01-12 03:43:18,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:18,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-01-12 03:43:18,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:18,217 INFO L225 Difference]: With dead ends: 8578 [2019-01-12 03:43:18,217 INFO L226 Difference]: Without dead ends: 5216 [2019-01-12 03:43:18,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-01-12 03:43:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5020. [2019-01-12 03:43:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-01-12 03:43:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 6043 transitions. [2019-01-12 03:43:18,381 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 6043 transitions. Word has length 315 [2019-01-12 03:43:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:18,382 INFO L480 AbstractCegarLoop]: Abstraction has 5020 states and 6043 transitions. [2019-01-12 03:43:18,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 6043 transitions. [2019-01-12 03:43:18,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-12 03:43:18,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:18,394 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:18,394 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1959018245, now seen corresponding path program 1 times [2019-01-12 03:43:18,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:18,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:18,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:18,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:18,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-01-12 03:43:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:43:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:43:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:43:18,721 INFO L87 Difference]: Start difference. First operand 5020 states and 6043 transitions. Second operand 3 states. [2019-01-12 03:43:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:20,171 INFO L93 Difference]: Finished difference Result 10957 states and 13202 transitions. [2019-01-12 03:43:20,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:43:20,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-01-12 03:43:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:20,196 INFO L225 Difference]: With dead ends: 10957 [2019-01-12 03:43:20,197 INFO L226 Difference]: Without dead ends: 6123 [2019-01-12 03:43:20,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:43:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2019-01-12 03:43:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 4095. [2019-01-12 03:43:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4095 states. [2019-01-12 03:43:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 4972 transitions. [2019-01-12 03:43:20,285 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 4972 transitions. Word has length 316 [2019-01-12 03:43:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 4095 states and 4972 transitions. [2019-01-12 03:43:20,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:43:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 4972 transitions. [2019-01-12 03:43:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-01-12 03:43:20,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:20,300 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:43:20,300 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:20,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1398734134, now seen corresponding path program 1 times [2019-01-12 03:43:20,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:20,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 50 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:20,684 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:43:20,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:20,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 50 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:43:21,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:21,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-12 03:43:21,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:43:21,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:43:21,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:43:21,242 INFO L87 Difference]: Start difference. First operand 4095 states and 4972 transitions. Second operand 6 states. [2019-01-12 03:43:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:26,568 INFO L93 Difference]: Finished difference Result 14652 states and 18028 transitions. [2019-01-12 03:43:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 03:43:26,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 357 [2019-01-12 03:43:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:26,619 INFO L225 Difference]: With dead ends: 14652 [2019-01-12 03:43:26,619 INFO L226 Difference]: Without dead ends: 10743 [2019-01-12 03:43:26,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10743 states. [2019-01-12 03:43:26,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10743 to 6858. [2019-01-12 03:43:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6858 states. [2019-01-12 03:43:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6858 states to 6858 states and 8378 transitions. [2019-01-12 03:43:26,786 INFO L78 Accepts]: Start accepts. Automaton has 6858 states and 8378 transitions. Word has length 357 [2019-01-12 03:43:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:26,787 INFO L480 AbstractCegarLoop]: Abstraction has 6858 states and 8378 transitions. [2019-01-12 03:43:26,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:43:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 6858 states and 8378 transitions. [2019-01-12 03:43:26,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-01-12 03:43:26,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:26,812 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:26,812 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:26,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1353131440, now seen corresponding path program 1 times [2019-01-12 03:43:26,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:26,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:26,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:26,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:26,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:27,392 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 03:43:27,852 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-12 03:43:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 421 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:28,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:28,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:43:28,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:28,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 325 proven. 104 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:29,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:29,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-01-12 03:43:29,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:43:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:43:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:43:29,638 INFO L87 Difference]: Start difference. First operand 6858 states and 8378 transitions. Second operand 10 states. [2019-01-12 03:43:29,779 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-01-12 03:43:34,342 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-12 03:43:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:42,921 INFO L93 Difference]: Finished difference Result 19857 states and 24243 transitions. [2019-01-12 03:43:42,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-12 03:43:42,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 441 [2019-01-12 03:43:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:42,950 INFO L225 Difference]: With dead ends: 19857 [2019-01-12 03:43:42,951 INFO L226 Difference]: Without dead ends: 13185 [2019-01-12 03:43:42,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=281, Invalid=649, Unknown=0, NotChecked=0, Total=930 [2019-01-12 03:43:42,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13185 states. [2019-01-12 03:43:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13185 to 7039. [2019-01-12 03:43:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7039 states. [2019-01-12 03:43:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 8377 transitions. [2019-01-12 03:43:43,098 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 8377 transitions. Word has length 441 [2019-01-12 03:43:43,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:43,098 INFO L480 AbstractCegarLoop]: Abstraction has 7039 states and 8377 transitions. [2019-01-12 03:43:43,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:43:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 8377 transitions. [2019-01-12 03:43:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-01-12 03:43:43,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:43,118 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:43,119 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:43,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:43,119 INFO L82 PathProgramCache]: Analyzing trace with hash -943551714, now seen corresponding path program 1 times [2019-01-12 03:43:43,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:43,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:43,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:43,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:43,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:43:43,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:43:43,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:43:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:43,713 INFO L87 Difference]: Start difference. First operand 7039 states and 8377 transitions. Second operand 5 states. [2019-01-12 03:43:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:45,581 INFO L93 Difference]: Finished difference Result 15388 states and 18383 transitions. [2019-01-12 03:43:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:43:45,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 446 [2019-01-12 03:43:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:45,597 INFO L225 Difference]: With dead ends: 15388 [2019-01-12 03:43:45,598 INFO L226 Difference]: Without dead ends: 8535 [2019-01-12 03:43:45,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:43:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2019-01-12 03:43:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 7966. [2019-01-12 03:43:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7966 states. [2019-01-12 03:43:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 9456 transitions. [2019-01-12 03:43:45,719 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 9456 transitions. Word has length 446 [2019-01-12 03:43:45,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:45,720 INFO L480 AbstractCegarLoop]: Abstraction has 7966 states and 9456 transitions. [2019-01-12 03:43:45,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:43:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 9456 transitions. [2019-01-12 03:43:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-01-12 03:43:45,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:45,748 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:45,750 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:45,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:45,750 INFO L82 PathProgramCache]: Analyzing trace with hash 240248700, now seen corresponding path program 1 times [2019-01-12 03:43:45,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:45,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:45,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:45,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:45,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 447 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:46,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:46,237 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:43:46,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:46,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-01-12 03:43:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:43:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 03:43:46,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:43:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:43:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:43:46,736 INFO L87 Difference]: Start difference. First operand 7966 states and 9456 transitions. Second operand 7 states. [2019-01-12 03:43:51,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:51,325 INFO L93 Difference]: Finished difference Result 22563 states and 26474 transitions. [2019-01-12 03:43:51,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:43:51,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 462 [2019-01-12 03:43:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:51,359 INFO L225 Difference]: With dead ends: 22563 [2019-01-12 03:43:51,359 INFO L226 Difference]: Without dead ends: 14599 [2019-01-12 03:43:51,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:43:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14599 states. [2019-01-12 03:43:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14599 to 6676. [2019-01-12 03:43:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6676 states. [2019-01-12 03:43:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6676 states to 6676 states and 7611 transitions. [2019-01-12 03:43:51,521 INFO L78 Accepts]: Start accepts. Automaton has 6676 states and 7611 transitions. Word has length 462 [2019-01-12 03:43:51,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:51,521 INFO L480 AbstractCegarLoop]: Abstraction has 6676 states and 7611 transitions. [2019-01-12 03:43:51,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:43:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 6676 states and 7611 transitions. [2019-01-12 03:43:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-01-12 03:43:51,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:51,538 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:51,539 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:51,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:51,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1546704829, now seen corresponding path program 1 times [2019-01-12 03:43:51,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:51,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:51,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:51,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:51,944 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 03:43:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-01-12 03:43:52,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:43:52,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:43:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:43:52,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:52,151 INFO L87 Difference]: Start difference. First operand 6676 states and 7611 transitions. Second operand 4 states. [2019-01-12 03:43:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:53,653 INFO L93 Difference]: Finished difference Result 14285 states and 16273 transitions. [2019-01-12 03:43:53,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:43:53,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 511 [2019-01-12 03:43:53,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:53,666 INFO L225 Difference]: With dead ends: 14285 [2019-01-12 03:43:53,667 INFO L226 Difference]: Without dead ends: 7611 [2019-01-12 03:43:53,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:43:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7611 states. [2019-01-12 03:43:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7611 to 6860. [2019-01-12 03:43:53,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-01-12 03:43:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 7742 transitions. [2019-01-12 03:43:53,780 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 7742 transitions. Word has length 511 [2019-01-12 03:43:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:53,781 INFO L480 AbstractCegarLoop]: Abstraction has 6860 states and 7742 transitions. [2019-01-12 03:43:53,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:43:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 7742 transitions. [2019-01-12 03:43:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-01-12 03:43:53,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:53,798 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:53,798 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:53,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -579572158, now seen corresponding path program 1 times [2019-01-12 03:43:53,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:53,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:53,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 568 proven. 155 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:43:54,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:54,857 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:43:54,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:55,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 251 proven. 472 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-01-12 03:43:55,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:55,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-12 03:43:55,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:43:55,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:43:55,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:55,681 INFO L87 Difference]: Start difference. First operand 6860 states and 7742 transitions. Second operand 8 states. [2019-01-12 03:44:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:01,132 INFO L93 Difference]: Finished difference Result 16309 states and 18289 transitions. [2019-01-12 03:44:01,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 03:44:01,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 538 [2019-01-12 03:44:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:01,135 INFO L225 Difference]: With dead ends: 16309 [2019-01-12 03:44:01,136 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:44:01,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 545 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-01-12 03:44:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:44:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:44:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:44:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:44:01,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 538 [2019-01-12 03:44:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:01,147 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:44:01,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:44:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:44:01,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:44:01,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:44:01,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:01,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:01,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:01,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:01,821 WARN L181 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 399 DAG size of output: 327 [2019-01-12 03:44:02,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:02,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:02,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:02,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:02,371 WARN L181 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 399 DAG size of output: 327 [2019-01-12 03:44:05,424 WARN L181 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 323 DAG size of output: 90 [2019-01-12 03:44:07,779 WARN L181 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 323 DAG size of output: 90 [2019-01-12 03:44:07,782 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:44:07,782 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,783 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,784 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse3 (= ~a25~0 13)) (.cse12 (= ~a25~0 12))) (let ((.cse21 (not .cse12)) (.cse16 (= ~a8~0 15)) (.cse19 (<= 312 ~a23~0)) (.cse15 (<= 130 ~a29~0)) (.cse17 (= ~a3~0 1)) (.cse13 (<= (+ ~a29~0 22) 0)) (.cse20 (not .cse3)) (.cse14 (<= ~a29~0 140)) (.cse10 (not (= ~a4~0 1)))) (let ((.cse11 (= ~a25~0 10)) (.cse4 (<= ~a29~0 599998)) (.cse6 (or (and .cse10 .cse13) (and .cse20 (and .cse14 .cse10)))) (.cse0 (or (and .cse20 .cse21 .cse15) (and .cse16 (and .cse20 .cse19) .cse15 .cse17))) (.cse7 (< 0 (+ ~a23~0 43))) (.cse2 (<= ~a29~0 599999)) (.cse9 (= ~a25~0 11)) (.cse8 (<= ~a29~0 245)) (.cse18 (<= (+ ~a29~0 21) 0)) (.cse1 (= 1 ~a4~0)) (.cse5 (< 138 ~a23~0))) (or (and (and .cse0 (<= ~a25~0 9) .cse1) .cse2) (and .cse3 (and .cse4 .cse5) .cse1) (and .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse2 .cse11 .cse1) (and (= ~a25~0 9) .cse7 .cse4) (or (and .cse12 .cse13) (and .cse11 .cse14)) (and .cse10 .cse4 .cse15) (and .cse16 (and .cse12 (< 306 ~a23~0)) (<= ~a29~0 277) .cse15 .cse17) (and (and .cse4 .cse15) .cse9) (and .cse6 .cse18) (or (and .cse12 (and .cse19 .cse14)) (and .cse20 (and .cse21 .cse5 .cse14))) (and (and .cse0 .cse7 .cse1) .cse2 .cse9) (and (and .cse8 .cse15) .cse3) (and .cse18 .cse1 .cse5))))) [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,785 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:44:07,786 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:44:07,787 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,788 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:44:07,789 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,790 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:44:07,791 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-01-12 03:44:07,792 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,793 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,794 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,795 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:44:07,796 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,797 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,798 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,799 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,800 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:44:07,801 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,802 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,803 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:44:07,804 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,805 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse3 (= ~a25~0 13)) (.cse12 (= ~a25~0 12))) (let ((.cse21 (not .cse12)) (.cse16 (= ~a8~0 15)) (.cse19 (<= 312 ~a23~0)) (.cse15 (<= 130 ~a29~0)) (.cse17 (= ~a3~0 1)) (.cse13 (<= (+ ~a29~0 22) 0)) (.cse20 (not .cse3)) (.cse14 (<= ~a29~0 140)) (.cse10 (not (= ~a4~0 1)))) (let ((.cse11 (= ~a25~0 10)) (.cse4 (<= ~a29~0 599998)) (.cse6 (or (and .cse10 .cse13) (and .cse20 (and .cse14 .cse10)))) (.cse0 (or (and .cse20 .cse21 .cse15) (and .cse16 (and .cse20 .cse19) .cse15 .cse17))) (.cse7 (< 0 (+ ~a23~0 43))) (.cse2 (<= ~a29~0 599999)) (.cse9 (= ~a25~0 11)) (.cse8 (<= ~a29~0 245)) (.cse18 (<= (+ ~a29~0 21) 0)) (.cse1 (= 1 ~a4~0)) (.cse5 (< 138 ~a23~0))) (or (and (and .cse0 (<= ~a25~0 9) .cse1) .cse2) (and .cse3 (and .cse4 .cse5) .cse1) (and .cse6 .cse7) (and .cse8 .cse9 .cse10) (and .cse2 .cse11 .cse1) (and (= ~a25~0 9) .cse7 .cse4) (or (and .cse12 .cse13) (and .cse11 .cse14)) (and .cse10 .cse4 .cse15) (and .cse16 (and .cse12 (< 306 ~a23~0)) (<= ~a29~0 277) .cse15 .cse17) (and (and .cse4 .cse15) .cse9) (and .cse6 .cse18) (or (and .cse12 (and .cse19 .cse14)) (and .cse20 (and .cse21 .cse5 .cse14))) (and (and .cse0 .cse7 .cse1) .cse2 .cse9) (and (and .cse8 .cse15) .cse3) (and .cse18 .cse1 .cse5))))) [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:44:07,806 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,807 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,807 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:44:07,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:44:07 BoogieIcfgContainer [2019-01-12 03:44:07,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:44:07,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:44:07,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:44:07,833 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:44:07,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:42:59" (3/4) ... [2019-01-12 03:44:07,841 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:44:07,904 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:44:07,906 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:44:08,127 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:44:08,127 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:44:08,128 INFO L168 Benchmark]: Toolchain (without parser) took 73634.78 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 947.3 MB in the beginning and 1.5 GB in the end (delta: -553.1 MB). Peak memory consumption was 642.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,128 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:44:08,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 972.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,132 INFO L168 Benchmark]: Boogie Preprocessor took 146.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,132 INFO L168 Benchmark]: RCFGBuilder took 3998.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 847.2 MB in the end (delta: 169.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,133 INFO L168 Benchmark]: TraceAbstraction took 68062.69 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 847.2 MB in the beginning and 1.6 GB in the end (delta: -709.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,133 INFO L168 Benchmark]: Witness Printer took 293.79 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:44:08,138 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 972.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -104.8 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 156.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 146.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3998.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 847.2 MB in the end (delta: 169.3 MB). Peak memory consumption was 169.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68062.69 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 847.2 MB in the beginning and 1.6 GB in the end (delta: -709.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 293.79 ms. Allocated memory is still 2.2 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a25 == 13) && !(a25 == 12)) && 130 <= a29) || (((a8 == 15 && !(a25 == 13) && 312 <= a23) && 130 <= a29) && a3 == 1)) && a25 <= 9) && 1 == a4) && a29 <= 599999) || ((a25 == 13 && a29 <= 599998 && 138 < a23) && 1 == a4)) || (((!(a4 == 1) && a29 + 22 <= 0) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && 0 < a23 + 43)) || ((a29 <= 245 && a25 == 11) && !(a4 == 1))) || ((a29 <= 599999 && a25 == 10) && 1 == a4)) || ((a25 == 9 && 0 < a23 + 43) && a29 <= 599998)) || (a25 == 12 && a29 + 22 <= 0) || (a25 == 10 && a29 <= 140)) || ((!(a4 == 1) && a29 <= 599998) && 130 <= a29)) || ((((a8 == 15 && a25 == 12 && 306 < a23) && a29 <= 277) && 130 <= a29) && a3 == 1)) || ((a29 <= 599998 && 130 <= a29) && a25 == 11)) || (((!(a4 == 1) && a29 + 22 <= 0) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && a29 + 21 <= 0)) || (a25 == 12 && 312 <= a23 && a29 <= 140) || (!(a25 == 13) && (!(a25 == 12) && 138 < a23) && a29 <= 140)) || (((((((!(a25 == 13) && !(a25 == 12)) && 130 <= a29) || (((a8 == 15 && !(a25 == 13) && 312 <= a23) && 130 <= a29) && a3 == 1)) && 0 < a23 + 43) && 1 == a4) && a29 <= 599999) && a25 == 11)) || ((a29 <= 245 && 130 <= a29) && a25 == 13)) || ((a29 + 21 <= 0 && 1 == a4) && 138 < a23) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(a25 == 13) && !(a25 == 12)) && 130 <= a29) || (((a8 == 15 && !(a25 == 13) && 312 <= a23) && 130 <= a29) && a3 == 1)) && a25 <= 9) && 1 == a4) && a29 <= 599999) || ((a25 == 13 && a29 <= 599998 && 138 < a23) && 1 == a4)) || (((!(a4 == 1) && a29 + 22 <= 0) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && 0 < a23 + 43)) || ((a29 <= 245 && a25 == 11) && !(a4 == 1))) || ((a29 <= 599999 && a25 == 10) && 1 == a4)) || ((a25 == 9 && 0 < a23 + 43) && a29 <= 599998)) || (a25 == 12 && a29 + 22 <= 0) || (a25 == 10 && a29 <= 140)) || ((!(a4 == 1) && a29 <= 599998) && 130 <= a29)) || ((((a8 == 15 && a25 == 12 && 306 < a23) && a29 <= 277) && 130 <= a29) && a3 == 1)) || ((a29 <= 599998 && 130 <= a29) && a25 == 11)) || (((!(a4 == 1) && a29 + 22 <= 0) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && a29 + 21 <= 0)) || (a25 == 12 && 312 <= a23 && a29 <= 140) || (!(a25 == 13) && (!(a25 == 12) && 138 < a23) && a29 <= 140)) || (((((((!(a25 == 13) && !(a25 == 12)) && 130 <= a29) || (((a8 == 15 && !(a25 == 13) && 312 <= a23) && 130 <= a29) && a3 == 1)) && 0 < a23 + 43) && 1 == a4) && a29 <= 599999) && a25 == 11)) || ((a29 <= 245 && 130 <= a29) && a25 == 13)) || ((a29 + 21 <= 0 && 1 == a4) && 138 < a23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 67.9s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 49.6s AutomataDifference, 0.0s DeadEndRemovalTime, 6.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 1678 SDtfs, 8537 SDslu, 845 SDs, 0 SdLazy, 22136 SolverSat, 4037 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1893 GetRequests, 1813 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7966occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 23943 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 110 NumberOfFragments, 615 HoareAnnotationTreeSize, 3 FomulaSimplifications, 70698 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 71688 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 5674 NumberOfCodeBlocks, 5674 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 5658 ConstructedInterpolants, 105 QuantifiedInterpolants, 8916833 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2297 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 5075/6199 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...