/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label59.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:31:47,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:31:47,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:31:47,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:31:47,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:31:47,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:31:47,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:31:47,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:31:47,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:31:47,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:31:47,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:31:47,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:31:47,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:31:47,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:31:47,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:31:47,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:31:47,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:31:47,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:31:47,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:31:47,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:31:47,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:31:47,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:31:47,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:31:47,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:31:47,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:31:47,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:31:47,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:31:47,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:31:47,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:31:47,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:31:47,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:31:47,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:31:47,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:31:47,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:31:47,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:31:47,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:31:47,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:31:47,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:31:47,235 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:31:47,235 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:31:47,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:31:47,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-23 23:31:47,272 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:31:47,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:31:47,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:31:47,274 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:31:47,274 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:31:47,274 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:31:47,274 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:31:47,275 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:31:47,275 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:31:47,275 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:31:47,275 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:31:47,275 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:31:47,275 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:31:47,276 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:31:47,276 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:31:47,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:31:47,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:31:47,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:31:47,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:31:47,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:31:47,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:31:47,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:31:47,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:31:47,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:31:47,280 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:31:47,280 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:31:47,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:31:47,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:31:47,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:31:47,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:31:47,282 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:31:47,282 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:31:47,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:31:47,283 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:31:47,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:31:47,283 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:31:47,283 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:31:47,284 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:31:47,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:31:47,573 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:31:47,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:31:47,578 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:31:47,578 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:31:47,579 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label59.c [2019-11-23 23:31:47,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23625097/0018f5d8c6d94c29ab7814ed45134419/FLAGd772c21c8 [2019-11-23 23:31:48,269 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:31:48,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label59.c [2019-11-23 23:31:48,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23625097/0018f5d8c6d94c29ab7814ed45134419/FLAGd772c21c8 [2019-11-23 23:31:48,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e23625097/0018f5d8c6d94c29ab7814ed45134419 [2019-11-23 23:31:48,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:31:48,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:31:48,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:48,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:31:48,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:31:48,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:48" (1/1) ... [2019-11-23 23:31:48,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@182f03c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:48, skipping insertion in model container [2019-11-23 23:31:48,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:31:48" (1/1) ... [2019-11-23 23:31:48,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:31:48,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:31:49,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:49,110 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:31:49,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:31:49,289 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:31:49,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49 WrapperNode [2019-11-23 23:31:49,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:31:49,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:49,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:31:49,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:31:49,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:31:49,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:31:49,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:31:49,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:31:49,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (1/1) ... [2019-11-23 23:31:49,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:31:49,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:31:49,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:31:49,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:31:49,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (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-11-23 23:31:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:31:49,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:31:51,446 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:31:51,447 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:31:51,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:51 BoogieIcfgContainer [2019-11-23 23:31:51,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:31:51,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:31:51,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:31:51,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:31:51,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:31:48" (1/3) ... [2019-11-23 23:31:51,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb36a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:51, skipping insertion in model container [2019-11-23 23:31:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:31:49" (2/3) ... [2019-11-23 23:31:51,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb36a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:31:51, skipping insertion in model container [2019-11-23 23:31:51,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:31:51" (3/3) ... [2019-11-23 23:31:51,460 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label59.c [2019-11-23 23:31:51,467 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:31:51,474 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:31:51,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:31:51,512 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:31:51,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:31:51,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:31:51,513 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:31:51,513 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:31:51,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:31:51,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:31:51,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:31:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:31:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:31:51,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:51,540 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:51,541 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:51,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1323245343, now seen corresponding path program 1 times [2019-11-23 23:31:51,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:51,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456725947] [2019-11-23 23:31:51,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:51,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:51,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456725947] [2019-11-23 23:31:51,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:51,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:51,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298053415] [2019-11-23 23:31:52,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:52,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:52,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:52,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:52,019 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-23 23:31:52,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:52,800 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-23 23:31:52,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:52,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-23 23:31:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:52,817 INFO L225 Difference]: With dead ends: 297 [2019-11-23 23:31:52,817 INFO L226 Difference]: Without dead ends: 216 [2019-11-23 23:31:52,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-23 23:31:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-23 23:31:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-23 23:31:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-23 23:31:52,878 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-23 23:31:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:52,879 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-23 23:31:52,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-23 23:31:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-23 23:31:52,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:52,884 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:52,884 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:52,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2123302636, now seen corresponding path program 1 times [2019-11-23 23:31:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:52,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240152421] [2019-11-23 23:31:52,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:52,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240152421] [2019-11-23 23:31:52,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:52,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:52,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708052636] [2019-11-23 23:31:52,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:52,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:52,982 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 3 states. [2019-11-23 23:31:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:53,438 INFO L93 Difference]: Finished difference Result 644 states and 1113 transitions. [2019-11-23 23:31:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:53,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-23 23:31:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:53,444 INFO L225 Difference]: With dead ends: 644 [2019-11-23 23:31:53,444 INFO L226 Difference]: Without dead ends: 429 [2019-11-23 23:31:53,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-23 23:31:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-11-23 23:31:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-23 23:31:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-23 23:31:53,472 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-23 23:31:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:53,473 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-23 23:31:53,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-23 23:31:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-23 23:31:53,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:53,479 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:53,479 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:53,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1265514425, now seen corresponding path program 1 times [2019-11-23 23:31:53,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:53,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288757593] [2019-11-23 23:31:53,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:31:53,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288757593] [2019-11-23 23:31:53,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:53,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:53,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877299178] [2019-11-23 23:31:53,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:53,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:53,574 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-23 23:31:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:54,016 INFO L93 Difference]: Finished difference Result 1070 states and 1647 transitions. [2019-11-23 23:31:54,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:54,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-23 23:31:54,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:54,021 INFO L225 Difference]: With dead ends: 1070 [2019-11-23 23:31:54,021 INFO L226 Difference]: Without dead ends: 642 [2019-11-23 23:31:54,024 INFO L630 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-11-23 23:31:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-23 23:31:54,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-11-23 23:31:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-23 23:31:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 944 transitions. [2019-11-23 23:31:54,061 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 944 transitions. Word has length 84 [2019-11-23 23:31:54,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:54,063 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 944 transitions. [2019-11-23 23:31:54,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 944 transitions. [2019-11-23 23:31:54,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:31:54,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:54,072 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:31:54,073 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1088771838, now seen corresponding path program 1 times [2019-11-23 23:31:54,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:54,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311023131] [2019-11-23 23:31:54,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:54,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311023131] [2019-11-23 23:31:54,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:54,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:31:54,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598742837] [2019-11-23 23:31:54,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:54,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:54,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:54,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:54,176 INFO L87 Difference]: Start difference. First operand 642 states and 944 transitions. Second operand 3 states. [2019-11-23 23:31:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:54,604 INFO L93 Difference]: Finished difference Result 1638 states and 2440 transitions. [2019-11-23 23:31:54,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:54,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-11-23 23:31:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:54,609 INFO L225 Difference]: With dead ends: 1638 [2019-11-23 23:31:54,609 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:54,611 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:31:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1000 transitions. [2019-11-23 23:31:54,661 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1000 transitions. Word has length 86 [2019-11-23 23:31:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:54,662 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1000 transitions. [2019-11-23 23:31:54,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1000 transitions. [2019-11-23 23:31:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-23 23:31:54,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:54,665 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:54,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:54,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:54,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1624306670, now seen corresponding path program 1 times [2019-11-23 23:31:54,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:54,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161484158] [2019-11-23 23:31:54,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:54,813 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 23:31:54,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161484158] [2019-11-23 23:31:54,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:54,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:54,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734186201] [2019-11-23 23:31:54,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:54,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:54,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:54,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:54,816 INFO L87 Difference]: Start difference. First operand 784 states and 1000 transitions. Second operand 4 states. [2019-11-23 23:31:55,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:55,299 INFO L93 Difference]: Finished difference Result 1661 states and 2104 transitions. [2019-11-23 23:31:55,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:55,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-23 23:31:55,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:55,305 INFO L225 Difference]: With dead ends: 1661 [2019-11-23 23:31:55,306 INFO L226 Difference]: Without dead ends: 878 [2019-11-23 23:31:55,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 23:31:55,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2019-11-23 23:31:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2019-11-23 23:31:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:31:55,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1074 transitions. [2019-11-23 23:31:55,335 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1074 transitions. Word has length 94 [2019-11-23 23:31:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:55,335 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1074 transitions. [2019-11-23 23:31:55,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:55,336 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1074 transitions. [2019-11-23 23:31:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 23:31:55,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:55,343 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:55,344 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:55,344 INFO L82 PathProgramCache]: Analyzing trace with hash -161616202, now seen corresponding path program 1 times [2019-11-23 23:31:55,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:55,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298901512] [2019-11-23 23:31:55,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:55,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:55,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298901512] [2019-11-23 23:31:55,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:55,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:55,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288241812] [2019-11-23 23:31:55,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:55,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:55,448 INFO L87 Difference]: Start difference. First operand 855 states and 1074 transitions. Second operand 4 states. [2019-11-23 23:31:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:56,010 INFO L93 Difference]: Finished difference Result 2064 states and 2638 transitions. [2019-11-23 23:31:56,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:56,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 23:31:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:56,019 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:31:56,019 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:56,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 926. [2019-11-23 23:31:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-23 23:31:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1096 transitions. [2019-11-23 23:31:56,047 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1096 transitions. Word has length 98 [2019-11-23 23:31:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:56,048 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1096 transitions. [2019-11-23 23:31:56,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1096 transitions. [2019-11-23 23:31:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-23 23:31:56,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:56,051 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 23:31:56,052 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:56,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2113447653, now seen corresponding path program 1 times [2019-11-23 23:31:56,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:56,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780027135] [2019-11-23 23:31:56,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:56,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780027135] [2019-11-23 23:31:56,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:56,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 23:31:56,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074484052] [2019-11-23 23:31:56,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 23:31:56,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:56,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 23:31:56,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:56,282 INFO L87 Difference]: Start difference. First operand 926 states and 1096 transitions. Second operand 8 states. [2019-11-23 23:31:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:57,019 INFO L93 Difference]: Finished difference Result 2035 states and 2413 transitions. [2019-11-23 23:31:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 23:31:57,019 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-23 23:31:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:57,026 INFO L225 Difference]: With dead ends: 2035 [2019-11-23 23:31:57,026 INFO L226 Difference]: Without dead ends: 1181 [2019-11-23 23:31:57,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 23:31:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-11-23 23:31:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 997. [2019-11-23 23:31:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-23 23:31:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1168 transitions. [2019-11-23 23:31:57,090 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1168 transitions. Word has length 104 [2019-11-23 23:31:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:57,091 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1168 transitions. [2019-11-23 23:31:57,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 23:31:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1168 transitions. [2019-11-23 23:31:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 23:31:57,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:57,095 INFO L410 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:57,095 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash 646845970, now seen corresponding path program 1 times [2019-11-23 23:31:57,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:57,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282283784] [2019-11-23 23:31:57,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:57,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282283784] [2019-11-23 23:31:57,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:57,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446134432] [2019-11-23 23:31:57,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:57,260 INFO L87 Difference]: Start difference. First operand 997 states and 1168 transitions. Second operand 4 states. [2019-11-23 23:31:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:57,624 INFO L93 Difference]: Finished difference Result 2064 states and 2433 transitions. [2019-11-23 23:31:57,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:57,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-23 23:31:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:57,631 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:31:57,631 INFO L226 Difference]: Without dead ends: 1139 [2019-11-23 23:31:57,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:57,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-23 23:31:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1139. [2019-11-23 23:31:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-23 23:31:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1299 transitions. [2019-11-23 23:31:57,658 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1299 transitions. Word has length 130 [2019-11-23 23:31:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:57,659 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1299 transitions. [2019-11-23 23:31:57,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1299 transitions. [2019-11-23 23:31:57,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 23:31:57,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:57,662 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-23 23:31:57,663 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:57,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:57,663 INFO L82 PathProgramCache]: Analyzing trace with hash -730919693, now seen corresponding path program 1 times [2019-11-23 23:31:57,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:57,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812265337] [2019-11-23 23:31:57,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:58,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812265337] [2019-11-23 23:31:58,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:58,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 23:31:58,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242871280] [2019-11-23 23:31:58,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 23:31:58,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 23:31:58,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:31:58,205 INFO L87 Difference]: Start difference. First operand 1139 states and 1299 transitions. Second operand 12 states. [2019-11-23 23:31:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:59,218 INFO L93 Difference]: Finished difference Result 2403 states and 2749 transitions. [2019-11-23 23:31:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 23:31:59,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2019-11-23 23:31:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:59,228 INFO L225 Difference]: With dead ends: 2403 [2019-11-23 23:31:59,228 INFO L226 Difference]: Without dead ends: 1319 [2019-11-23 23:31:59,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-11-23 23:31:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-23 23:31:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1174. [2019-11-23 23:31:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-23 23:31:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1337 transitions. [2019-11-23 23:31:59,279 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1337 transitions. Word has length 143 [2019-11-23 23:31:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:59,280 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1337 transitions. [2019-11-23 23:31:59,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 23:31:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1337 transitions. [2019-11-23 23:31:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-23 23:31:59,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:59,286 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-23 23:31:59,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -665613853, now seen corresponding path program 1 times [2019-11-23 23:31:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:59,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525336679] [2019-11-23 23:31:59,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:59,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525336679] [2019-11-23 23:31:59,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:59,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 23:31:59,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138309047] [2019-11-23 23:31:59,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 23:31:59,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 23:31:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:59,482 INFO L87 Difference]: Start difference. First operand 1174 states and 1337 transitions. Second operand 6 states. [2019-11-23 23:31:59,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:59,982 INFO L93 Difference]: Finished difference Result 2291 states and 2614 transitions. [2019-11-23 23:31:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:59,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-11-23 23:31:59,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:59,987 INFO L225 Difference]: With dead ends: 2291 [2019-11-23 23:31:59,987 INFO L226 Difference]: Without dead ends: 1189 [2019-11-23 23:31:59,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-23 23:31:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2019-11-23 23:32:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1174. [2019-11-23 23:32:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-23 23:32:00,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1312 transitions. [2019-11-23 23:32:00,014 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1312 transitions. Word has length 145 [2019-11-23 23:32:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:00,014 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1312 transitions. [2019-11-23 23:32:00,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 23:32:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1312 transitions. [2019-11-23 23:32:00,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-23 23:32:00,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:32:00,018 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-23 23:32:00,018 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:32:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:32:00,019 INFO L82 PathProgramCache]: Analyzing trace with hash 604338175, now seen corresponding path program 1 times [2019-11-23 23:32:00,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:32:00,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051343890] [2019-11-23 23:32:00,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:32:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:32:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-23 23:32:00,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051343890] [2019-11-23 23:32:00,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:32:00,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:32:00,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692236031] [2019-11-23 23:32:00,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:32:00,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:32:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:32:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:00,180 INFO L87 Difference]: Start difference. First operand 1174 states and 1312 transitions. Second operand 4 states. [2019-11-23 23:32:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:32:00,714 INFO L93 Difference]: Finished difference Result 2700 states and 3025 transitions. [2019-11-23 23:32:00,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:32:00,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-23 23:32:00,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:32:00,727 INFO L225 Difference]: With dead ends: 2700 [2019-11-23 23:32:00,727 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:32:00,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:32:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:32:00,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:32:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:32:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:32:00,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2019-11-23 23:32:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:32:00,731 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:32:00,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:32:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:32:00,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:32:00,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:32:00,866 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 84 [2019-11-23 23:32:00,984 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 81 [2019-11-23 23:32:01,474 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-11-23 23:32:01,940 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 52 [2019-11-23 23:32:01,945 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:32:01,945 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:32:01,945 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:32:01,946 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:32:01,947 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:32:01,947 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:32:01,947 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:32:01,947 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:32:01,948 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:32:01,948 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:32:01,948 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:32:01,948 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:32:01,949 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 15 ~a8~0)) (.cse5 (= ~a20~0 1))) (let ((.cse2 (= ~a16~0 5)) (.cse3 (= 13 ~a8~0)) (.cse11 (not .cse5)) (.cse0 (= 1 ~a7~0)) (.cse8 (= ~a16~0 4)) (.cse9 (not .cse1)) (.cse4 (= ~a17~0 1)) (.cse10 (= ~a12~0 8)) (.cse7 (<= ~a17~0 0)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse2) (and .cse8 .cse9 .cse7) (and .cse4 .cse10 .cse6 (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse1 .cse2) (and .cse0 .cse4 .cse6) (and .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse10 .cse4 .cse6 .cse1) (and .cse0 .cse3) (and .cse0 .cse9 .cse7) (and .cse11 .cse4 .cse10 .cse6 .cse1 (not .cse8)) (and .cse8 .cse7 (not .cse0) .cse5) (and .cse8 .cse9 .cse4 .cse6 .cse5) (and .cse10 .cse7 .cse6 .cse1)))) [2019-11-23 23:32:01,950 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:32:01,950 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:32:01,950 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 23:32:01,950 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:32:01,950 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:32:01,951 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:32:01,952 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:32:01,952 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:32:01,952 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:32:01,952 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:32:01,952 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:32:01,952 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:32:01,953 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:32:01,954 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:32:01,954 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:32:01,954 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:32:01,954 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:32:01,954 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:32:01,955 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 15 ~a8~0)) (.cse7 (= ~a20~0 1))) (let ((.cse4 (= ~a16~0 5)) (.cse6 (= 13 ~a8~0)) (.cse11 (not .cse7)) (.cse5 (= 1 ~a7~0)) (.cse9 (= ~a16~0 4)) (.cse10 (not .cse3)) (.cse0 (= ~a17~0 1)) (.cse1 (= ~a12~0 8)) (.cse8 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse3 .cse4) (and .cse6 .cse0 .cse7 .cse2) (and .cse8 .cse4) (and .cse9 .cse10 .cse8) (and .cse5 .cse0 .cse2) (and .cse11 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse1 .cse0 .cse2 .cse3) (and .cse5 .cse6) (and .cse5 .cse10 .cse8) (and .cse11 .cse0 .cse1 .cse2 .cse3 (not .cse9)) (and .cse9 .cse8 (not .cse5) .cse7) (and .cse9 .cse10 .cse0 .cse2 .cse7) (and .cse1 .cse8 .cse2 .cse3)))) [2019-11-23 23:32:01,955 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:32:01,955 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:32:01,955 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:32:01,955 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:32:01,956 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:32:01,957 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:32:01,958 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:32:01,958 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:32:01,958 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:32:01,958 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:32:01,958 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:32:01,959 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2019-11-23 23:32:01,959 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:32:01,959 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:32:01,959 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:32:01,960 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:32:01,960 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:32:01,960 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:32:01,961 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:32:02,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:32:02 BoogieIcfgContainer [2019-11-23 23:32:02,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:32:02,017 INFO L168 Benchmark]: Toolchain (without parser) took 13493.11 ms. Allocated memory was 147.3 MB in the beginning and 429.4 MB in the end (delta: 282.1 MB). Free memory was 102.0 MB in the beginning and 133.7 MB in the end (delta: -31.7 MB). Peak memory consumption was 250.4 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,020 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.71 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 165.1 MB in the end (delta: -63.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.33 ms. Allocated memory is still 205.0 MB. Free memory was 165.1 MB in the beginning and 159.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,028 INFO L168 Benchmark]: Boogie Preprocessor took 84.89 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 154.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,029 INFO L168 Benchmark]: RCFGBuilder took 1974.74 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 154.7 MB in the beginning and 189.3 MB in the end (delta: -34.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,031 INFO L168 Benchmark]: TraceAbstraction took 10565.22 ms. Allocated memory was 247.5 MB in the beginning and 429.4 MB in the end (delta: 181.9 MB). Free memory was 187.6 MB in the beginning and 133.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 235.8 MB. Max. memory is 7.1 GB. [2019-11-23 23:32:02,040 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.3 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.71 ms. Allocated memory was 147.3 MB in the beginning and 205.0 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 165.1 MB in the end (delta: -63.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.33 ms. Allocated memory is still 205.0 MB. Free memory was 165.1 MB in the beginning and 159.2 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.89 ms. Allocated memory is still 205.0 MB. Free memory was 159.2 MB in the beginning and 154.7 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1974.74 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 154.7 MB in the beginning and 189.3 MB in the end (delta: -34.7 MB). Peak memory consumption was 103.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10565.22 ms. Allocated memory was 247.5 MB in the beginning and 429.4 MB in the end (delta: 181.9 MB). Free memory was 187.6 MB in the beginning and 133.7 MB in the end (delta: 53.9 MB). Peak memory consumption was 235.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((1 == a7 && 15 == a8) && a16 == 5) || (((13 == a8 && a17 == 1) && a20 == 1) && a21 == 1)) || (a17 <= 0 && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || (((((a17 == 1 && a12 == 8) && a21 == 1) && !(1 == input)) && 15 == a8) && a16 == 5)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a12 == 8) && a17 == 1) && a21 == 1) && 15 == a8)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((a16 == 4 && a17 <= 0) && !(1 == a7)) && a20 == 1)) || ((((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((a17 == 1 && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 5) || ((1 == a7 && 15 == a8) && a16 == 5)) || (((13 == a8 && a17 == 1) && a20 == 1) && a21 == 1)) || (a17 <= 0 && a16 == 5)) || ((a16 == 4 && !(15 == a8)) && a17 <= 0)) || ((1 == a7 && a17 == 1) && a21 == 1)) || (((((!(a20 == 1) && (((2 == input || 3 == input) || 6 == input) || 5 == input)) && a12 == 8) && a17 == 1) && a21 == 1) && 15 == a8)) || (1 == a7 && 13 == a8)) || ((1 == a7 && !(15 == a8)) && a17 <= 0)) || (((((!(a20 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((a16 == 4 && a17 <= 0) && !(1 == a7)) && a20 == 1)) || ((((a16 == 4 && !(15 == a8)) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a12 == 8 && a17 <= 0) && a21 == 1) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 622 SDtfs, 1613 SDslu, 110 SDs, 0 SdLazy, 4316 SolverSat, 738 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1174occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 935 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 56 NumberOfFragments, 367 HoareAnnotationTreeSize, 3 FomulaSimplifications, 8142 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1076 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1227 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 744142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 627/627 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...