./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19252d9b977a1b2caf6b350b292ab440fef944ce ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:27:44,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:27:44,485 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:27:44,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:27:44,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:27:44,504 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:27:44,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:27:44,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:27:44,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:27:44,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:27:44,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:27:44,516 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:27:44,517 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:27:44,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:27:44,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:27:44,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:27:44,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:27:44,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:27:44,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:27:44,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:27:44,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:27:44,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:27:44,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:27:44,532 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:27:44,532 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:27:44,533 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:27:44,534 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:27:44,535 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:27:44,536 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:27:44,537 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:27:44,537 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:27:44,538 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:27:44,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:27:44,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:27:44,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:27:44,541 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:27:44,541 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:27:44,561 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:27:44,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:27:44,566 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:27:44,566 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:27:44,566 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:27:44,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:27:44,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:27:44,568 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:27:44,568 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:27:44,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:27:44,568 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:27:44,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:27:44,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:27:44,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:27:44,572 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:27:44,572 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:27:44,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:27:44,572 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:27:44,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:27:44,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:27:44,573 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:27:44,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:27:44,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:27:44,573 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 -> 19252d9b977a1b2caf6b350b292ab440fef944ce [2019-01-12 04:27:44,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:27:44,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:27:44,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:27:44,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:27:44,628 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:27:44,628 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c [2019-01-12 04:27:44,692 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad37284c/6fbeef2b1bd94213bfa0655d3b37845d/FLAG195f69ac8 [2019-01-12 04:27:45,299 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:27:45,302 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem14_label49_true-unreach-call_false-termination.c [2019-01-12 04:27:45,319 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad37284c/6fbeef2b1bd94213bfa0655d3b37845d/FLAG195f69ac8 [2019-01-12 04:27:45,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad37284c/6fbeef2b1bd94213bfa0655d3b37845d [2019-01-12 04:27:45,540 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:27:45,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:27:45,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:45,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:27:45,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:27:45,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:45" (1/1) ... [2019-01-12 04:27:45,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1944673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:45, skipping insertion in model container [2019-01-12 04:27:45,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:27:45" (1/1) ... [2019-01-12 04:27:45,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:27:45,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:27:46,136 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:46,141 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:27:46,298 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:27:46,316 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:27:46,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46 WrapperNode [2019-01-12 04:27:46,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:27:46,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:46,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:27:46,319 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:27:46,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:27:46,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:27:46,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:27:46,563 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:27:46,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (1/1) ... [2019-01-12 04:27:46,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:27:46,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:27:46,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:27:46,694 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:27:46,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (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 04:27:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:27:46,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:27:49,883 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:27:49,883 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 04:27:49,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:49 BoogieIcfgContainer [2019-01-12 04:27:49,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:27:49,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:27:49,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:27:49,889 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:27:49,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:27:45" (1/3) ... [2019-01-12 04:27:49,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a03d306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:27:49, skipping insertion in model container [2019-01-12 04:27:49,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:27:46" (2/3) ... [2019-01-12 04:27:49,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a03d306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:27:49, skipping insertion in model container [2019-01-12 04:27:49,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:49" (3/3) ... [2019-01-12 04:27:49,893 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label49_true-unreach-call_false-termination.c [2019-01-12 04:27:49,903 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:27:49,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:27:49,927 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:27:49,962 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:27:49,963 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:27:49,963 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:27:49,963 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:27:49,963 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:27:49,963 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:27:49,964 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:27:49,964 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:27:49,964 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:27:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-01-12 04:27:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 04:27:50,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:50,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:50,005 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:50,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2019-01-12 04:27:50,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:50,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:50,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:50,498 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 04:27:50,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:50,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:50,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:50,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:50,523 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-01-12 04:27:53,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:53,484 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-01-12 04:27:53,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:53,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-01-12 04:27:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:53,509 INFO L225 Difference]: With dead ends: 850 [2019-01-12 04:27:53,509 INFO L226 Difference]: Without dead ends: 538 [2019-01-12 04:27:53,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:53,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-12 04:27:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-01-12 04:27:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-01-12 04:27:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-01-12 04:27:53,586 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 59 [2019-01-12 04:27:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:53,587 INFO L480 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-01-12 04:27:53,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:53,587 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-01-12 04:27:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 04:27:53,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:53,593 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:53,593 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1848862609, now seen corresponding path program 1 times [2019-01-12 04:27:53,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:53,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:53,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:53,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:27:53,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:53,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:53,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:53,787 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-01-12 04:27:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:55,546 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-01-12 04:27:55,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:55,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-01-12 04:27:55,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:55,561 INFO L225 Difference]: With dead ends: 2142 [2019-01-12 04:27:55,562 INFO L226 Difference]: Without dead ends: 1606 [2019-01-12 04:27:55,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:55,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-01-12 04:27:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1250. [2019-01-12 04:27:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-01-12 04:27:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1743 transitions. [2019-01-12 04:27:55,617 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1743 transitions. Word has length 125 [2019-01-12 04:27:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:55,618 INFO L480 AbstractCegarLoop]: Abstraction has 1250 states and 1743 transitions. [2019-01-12 04:27:55,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1743 transitions. [2019-01-12 04:27:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-12 04:27:55,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:55,623 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:55,623 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash 764460886, now seen corresponding path program 1 times [2019-01-12 04:27:55,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:55,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:55,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:55,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:55,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:27:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:27:55,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:27:55,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:27:55,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:27:55,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:27:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:55,859 INFO L87 Difference]: Start difference. First operand 1250 states and 1743 transitions. Second operand 4 states. [2019-01-12 04:27:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:27:59,461 INFO L93 Difference]: Finished difference Result 4100 states and 5634 transitions. [2019-01-12 04:27:59,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:27:59,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-01-12 04:27:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:27:59,480 INFO L225 Difference]: With dead ends: 4100 [2019-01-12 04:27:59,480 INFO L226 Difference]: Without dead ends: 2852 [2019-01-12 04:27:59,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:27:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-01-12 04:27:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2019-01-12 04:27:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2496 states. [2019-01-12 04:27:59,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3193 transitions. [2019-01-12 04:27:59,549 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3193 transitions. Word has length 127 [2019-01-12 04:27:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:27:59,552 INFO L480 AbstractCegarLoop]: Abstraction has 2496 states and 3193 transitions. [2019-01-12 04:27:59,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:27:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3193 transitions. [2019-01-12 04:27:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-12 04:27:59,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:27:59,568 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:27:59,569 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:27:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:27:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -365851958, now seen corresponding path program 1 times [2019-01-12 04:27:59,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:27:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:27:59,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:59,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:27:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:27:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:00,109 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 04:28:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 257 proven. 4 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-01-12 04:28:00,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:00,232 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 04:28:00,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:00,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-01-12 04:28:00,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:00,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:28:00,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:28:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:28:00,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:28:00,556 INFO L87 Difference]: Start difference. First operand 2496 states and 3193 transitions. Second operand 6 states. [2019-01-12 04:28:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:06,715 INFO L93 Difference]: Finished difference Result 6501 states and 8280 transitions. [2019-01-12 04:28:06,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:06,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 316 [2019-01-12 04:28:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:06,733 INFO L225 Difference]: With dead ends: 6501 [2019-01-12 04:28:06,734 INFO L226 Difference]: Without dead ends: 3742 [2019-01-12 04:28:06,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-01-12 04:28:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2674. [2019-01-12 04:28:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2674 states. [2019-01-12 04:28:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2935 transitions. [2019-01-12 04:28:06,804 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2935 transitions. Word has length 316 [2019-01-12 04:28:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:06,804 INFO L480 AbstractCegarLoop]: Abstraction has 2674 states and 2935 transitions. [2019-01-12 04:28:06,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:28:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2935 transitions. [2019-01-12 04:28:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2019-01-12 04:28:06,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:06,819 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, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-01-12 04:28:06,819 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1156668894, now seen corresponding path program 1 times [2019-01-12 04:28:06,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:07,254 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 04:28:07,420 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-01-12 04:28:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 587 proven. 4 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-01-12 04:28:07,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:07,923 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 04:28:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:08,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 775 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2019-01-12 04:28:08,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:08,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 04:28:08,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:28:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:28:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:28:08,271 INFO L87 Difference]: Start difference. First operand 2674 states and 2935 transitions. Second operand 7 states. [2019-01-12 04:28:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:13,111 INFO L93 Difference]: Finished difference Result 6242 states and 6834 transitions. [2019-01-12 04:28:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:28:13,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 539 [2019-01-12 04:28:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:13,129 INFO L225 Difference]: With dead ends: 6242 [2019-01-12 04:28:13,130 INFO L226 Difference]: Without dead ends: 3570 [2019-01-12 04:28:13,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:28:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-01-12 04:28:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2852. [2019-01-12 04:28:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-01-12 04:28:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3111 transitions. [2019-01-12 04:28:13,189 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3111 transitions. Word has length 539 [2019-01-12 04:28:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:13,190 INFO L480 AbstractCegarLoop]: Abstraction has 2852 states and 3111 transitions. [2019-01-12 04:28:13,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:28:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3111 transitions. [2019-01-12 04:28:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-01-12 04:28:13,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:13,215 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 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] [2019-01-12 04:28:13,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:13,216 INFO L82 PathProgramCache]: Analyzing trace with hash -671647113, now seen corresponding path program 1 times [2019-01-12 04:28:13,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:13,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:13,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:13,718 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:28:14,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1748 backedges. 1212 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-01-12 04:28:14,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:28:14,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:28:14,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:28:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:14,124 INFO L87 Difference]: Start difference. First operand 2852 states and 3111 transitions. Second operand 3 states. [2019-01-12 04:28:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:14,939 INFO L93 Difference]: Finished difference Result 6236 states and 6853 transitions. [2019-01-12 04:28:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:28:14,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-01-12 04:28:14,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:14,955 INFO L225 Difference]: With dead ends: 6236 [2019-01-12 04:28:14,955 INFO L226 Difference]: Without dead ends: 3386 [2019-01-12 04:28:14,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:28:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2019-01-12 04:28:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3030. [2019-01-12 04:28:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-01-12 04:28:15,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3259 transitions. [2019-01-12 04:28:15,012 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3259 transitions. Word has length 683 [2019-01-12 04:28:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:15,013 INFO L480 AbstractCegarLoop]: Abstraction has 3030 states and 3259 transitions. [2019-01-12 04:28:15,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:28:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3259 transitions. [2019-01-12 04:28:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2019-01-12 04:28:15,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:15,025 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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 04:28:15,025 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:15,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1796888930, now seen corresponding path program 1 times [2019-01-12 04:28:15,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:15,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:15,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:15,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 1639 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2019-01-12 04:28:15,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:15,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:15,812 INFO L87 Difference]: Start difference. First operand 3030 states and 3259 transitions. Second operand 4 states. [2019-01-12 04:28:16,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:16,890 INFO L93 Difference]: Finished difference Result 7482 states and 8118 transitions. [2019-01-12 04:28:16,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:16,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 908 [2019-01-12 04:28:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:16,912 INFO L225 Difference]: With dead ends: 7482 [2019-01-12 04:28:16,913 INFO L226 Difference]: Without dead ends: 4632 [2019-01-12 04:28:16,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-01-12 04:28:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2019-01-12 04:28:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4276 states. [2019-01-12 04:28:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4562 transitions. [2019-01-12 04:28:16,993 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4562 transitions. Word has length 908 [2019-01-12 04:28:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:16,996 INFO L480 AbstractCegarLoop]: Abstraction has 4276 states and 4562 transitions. [2019-01-12 04:28:16,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4562 transitions. [2019-01-12 04:28:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2019-01-12 04:28:17,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:17,008 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:28:17,009 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:17,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1198470737, now seen corresponding path program 1 times [2019-01-12 04:28:17,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:17,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:17,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:17,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2531 backedges. 1779 proven. 199 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2019-01-12 04:28:18,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:28:18,810 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 04:28:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:19,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:28:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2531 backedges. 982 proven. 0 refuted. 0 times theorem prover too weak. 1549 trivial. 0 not checked. [2019-01-12 04:28:19,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:28:19,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:28:19,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:28:19,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:28:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:28:19,539 INFO L87 Difference]: Start difference. First operand 4276 states and 4562 transitions. Second operand 8 states. [2019-01-12 04:28:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:22,146 INFO L93 Difference]: Finished difference Result 9621 states and 10257 transitions. [2019-01-12 04:28:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:28:22,147 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 926 [2019-01-12 04:28:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:22,167 INFO L225 Difference]: With dead ends: 9621 [2019-01-12 04:28:22,167 INFO L226 Difference]: Without dead ends: 5525 [2019-01-12 04:28:22,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 926 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:28:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2019-01-12 04:28:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 4098. [2019-01-12 04:28:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4098 states. [2019-01-12 04:28:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4274 transitions. [2019-01-12 04:28:22,253 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4274 transitions. Word has length 926 [2019-01-12 04:28:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:22,254 INFO L480 AbstractCegarLoop]: Abstraction has 4098 states and 4274 transitions. [2019-01-12 04:28:22,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:28:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4274 transitions. [2019-01-12 04:28:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2019-01-12 04:28:22,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:28:22,267 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 04:28:22,267 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:28:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:28:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash 736702413, now seen corresponding path program 1 times [2019-01-12 04:28:22,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:28:22,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:28:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:22,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:28:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:28:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:28:22,838 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:28:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3297 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 2062 trivial. 0 not checked. [2019-01-12 04:28:23,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:28:23,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:28:23,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:28:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:28:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:28:23,221 INFO L87 Difference]: Start difference. First operand 4098 states and 4274 transitions. Second operand 4 states. [2019-01-12 04:28:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:28:23,983 INFO L93 Difference]: Finished difference Result 8018 states and 8354 transitions. [2019-01-12 04:28:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:28:23,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1024 [2019-01-12 04:28:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:28:23,985 INFO L225 Difference]: With dead ends: 8018 [2019-01-12 04:28:23,985 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:28:23,991 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 04:28:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:28:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:28:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:28:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:28:23,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1024 [2019-01-12 04:28:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:28:23,994 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:28:23,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:28:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:28:23,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:28:24,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:28:24,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:28:24,117 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-01-12 04:28:24,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:28:25,690 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2019-01-12 04:28:25,987 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 30 [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 181) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-01-12 04:28:25,992 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,993 INFO L448 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,994 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:25,995 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-01-12 04:28:25,995 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-01-12 04:28:25,998 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-01-12 04:28:25,999 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,000 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,000 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,000 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-01-12 04:28:26,000 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-01-12 04:28:26,001 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:28:26,002 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:28:26,002 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,003 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,004 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-01-12 04:28:26,005 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,006 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,007 INFO L448 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-01-12 04:28:26,008 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-01-12 04:28:26,008 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:28:26,008 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:28:26,008 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,010 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,011 INFO L448 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-01-12 04:28:26,012 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-01-12 04:28:26,014 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,015 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,016 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,020 INFO L444 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse3 (not (= ~a21~0 9))) (.cse0 (not (= ~a21~0 6))) (.cse1 (< 11 ~a12~0)) (.cse2 (= ~a24~0 1))) (or (and .cse0 .cse1 .cse2) (and (= ~a15~0 8) .cse2) (and .cse3 .cse2 (and (<= ~a12~0 11) (<= ~a15~0 8))) (<= ~a15~0 6) (and .cse3 .cse0 .cse2) (and .cse1 .cse2 (<= 9 ~a15~0)) (and .cse2 (< 80 ~a12~0)))) [2019-01-12 04:28:26,020 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-01-12 04:28:26,020 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-01-12 04:28:26,020 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:28:26,020 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:28:26,020 INFO L448 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L451 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-01-12 04:28:26,021 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,022 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L444 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse3 (not (= ~a21~0 9))) (.cse0 (not (= ~a21~0 6))) (.cse1 (< 11 ~a12~0)) (.cse2 (= ~a24~0 1))) (or (and .cse0 .cse1 .cse2) (and (= ~a15~0 8) .cse2) (and .cse3 .cse2 (and (<= ~a12~0 11) (<= ~a15~0 8))) (<= ~a15~0 6) (and .cse3 .cse0 .cse2) (and .cse1 .cse2 (<= 9 ~a15~0)) (and .cse2 (< 80 ~a12~0)))) [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 04:28:26,023 INFO L448 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-01-12 04:28:26,024 INFO L448 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-01-12 04:28:26,025 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:28:26,026 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-01-12 04:28:26,027 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:28:26,028 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-01-12 04:28:26,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:28:26 BoogieIcfgContainer [2019-01-12 04:28:26,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:28:26,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:28:26,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:28:26,058 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:28:26,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:27:49" (3/4) ... [2019-01-12 04:28:26,064 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:28:26,088 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 04:28:26,090 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:28:26,355 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:28:26,355 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:28:26,356 INFO L168 Benchmark]: Toolchain (without parser) took 40815.28 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 947.3 MB in the beginning and 1.3 GB in the end (delta: -393.1 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,358 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:28:26,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.87 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 243.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,359 INFO L168 Benchmark]: Boogie Preprocessor took 131.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,359 INFO L168 Benchmark]: RCFGBuilder took 3191.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 133.6 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,360 INFO L168 Benchmark]: TraceAbstraction took 36171.17 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 966.0 MB in the beginning and 1.4 GB in the end (delta: -406.7 MB). Peak memory consumption was 883.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,362 INFO L168 Benchmark]: Witness Printer took 297.79 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:28:26,365 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 771.87 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 915.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 243.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3191.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 966.0 MB in the end (delta: 133.6 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36171.17 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 966.0 MB in the beginning and 1.4 GB in the end (delta: -406.7 MB). Peak memory consumption was 883.5 MB. Max. memory is 11.5 GB. * Witness Printer took 297.79 ms. Allocated memory is still 2.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 181]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((!(a21 == 6) && 11 < a12) && a24 == 1) || (a15 == 8 && a24 == 1)) || ((!(a21 == 9) && a24 == 1) && a12 <= 11 && a15 <= 8)) || a15 <= 6) || ((!(a21 == 9) && !(a21 == 6)) && a24 == 1)) || ((11 < a12 && a24 == 1) && 9 <= a15)) || (a24 == 1 && 80 < a12) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((((!(a21 == 6) && 11 < a12) && a24 == 1) || (a15 == 8 && a24 == 1)) || ((!(a21 == 9) && a24 == 1) && a12 <= 11 && a15 <= 8)) || a15 <= 6) || ((!(a21 == 9) && !(a21 == 6)) && a24 == 1)) || ((11 < a12 && a24 == 1) && 9 <= a15)) || (a24 == 1 && 80 < a12) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. SAFE Result, 36.0s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 24.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 713 SDtfs, 3097 SDslu, 151 SDs, 0 SdLazy, 11470 SolverSat, 1290 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 1792 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4276occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 4637 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 68 NumberOfFragments, 133 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4464 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1128 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 6488 NumberOfCodeBlocks, 6488 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 6476 ConstructedInterpolants, 0 QuantifiedInterpolants, 13435627 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2213 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 14847/15054 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...