/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_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 23:30:52,435 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 23:30:52,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 23:30:52,457 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 23:30:52,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 23:30:52,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 23:30:52,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 23:30:52,470 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 23:30:52,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 23:30:52,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 23:30:52,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 23:30:52,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 23:30:52,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 23:30:52,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 23:30:52,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 23:30:52,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 23:30:52,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 23:30:52,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 23:30:52,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 23:30:52,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 23:30:52,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 23:30:52,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 23:30:52,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 23:30:52,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 23:30:52,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 23:30:52,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 23:30:52,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 23:30:52,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 23:30:52,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 23:30:52,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 23:30:52,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 23:30:52,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 23:30:52,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 23:30:52,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 23:30:52,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 23:30:52,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 23:30:52,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 23:30:52,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 23:30:52,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 23:30:52,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 23:30:52,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 23:30:52,525 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:30:52,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 23:30:52,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 23:30:52,545 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-23 23:30:52,545 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-23 23:30:52,546 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-23 23:30:52,546 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-23 23:30:52,546 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-23 23:30:52,546 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-23 23:30:52,546 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-23 23:30:52,547 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-23 23:30:52,547 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-23 23:30:52,547 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-23 23:30:52,547 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-23 23:30:52,547 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-23 23:30:52,548 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-23 23:30:52,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 23:30:52,548 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 23:30:52,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 23:30:52,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 23:30:52,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 23:30:52,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 23:30:52,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 23:30:52,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 23:30:52,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 23:30:52,550 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 23:30:52,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 23:30:52,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 23:30:52,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 23:30:52,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 23:30:52,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:52,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 23:30:52,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 23:30:52,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 23:30:52,552 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-23 23:30:52,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 23:30:52,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 23:30:52,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 23:30:52,552 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-23 23:30:52,831 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 23:30:52,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 23:30:52,854 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 23:30:52,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 23:30:52,856 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 23:30:52,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28.c [2019-11-23 23:30:52,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e4c372/e7285028e257430eb03d988566ab6dff/FLAG52554af71 [2019-11-23 23:30:53,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 23:30:53,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label28.c [2019-11-23 23:30:53,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e4c372/e7285028e257430eb03d988566ab6dff/FLAG52554af71 [2019-11-23 23:30:53,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b3e4c372/e7285028e257430eb03d988566ab6dff [2019-11-23 23:30:53,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 23:30:53,804 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 23:30:53,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:53,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 23:30:53,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 23:30:53,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1445bf1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53, skipping insertion in model container [2019-11-23 23:30:53,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:53" (1/1) ... [2019-11-23 23:30:53,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 23:30:53,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 23:30:54,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:54,371 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 23:30:54,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 23:30:54,547 INFO L208 MainTranslator]: Completed translation [2019-11-23 23:30:54,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54 WrapperNode [2019-11-23 23:30:54,548 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 23:30:54,548 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:54,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 23:30:54,549 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 23:30:54,557 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:30:54" (1/1) ... [2019-11-23 23:30:54,578 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:30:54" (1/1) ... [2019-11-23 23:30:54,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 23:30:54,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 23:30:54,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 23:30:54,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 23:30:54,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2019-11-23 23:30:54,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 23:30:54,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 23:30:54,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 23:30:54,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 23:30:54,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 23:30:54,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 23:30:54,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 23:30:56,827 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 23:30:56,827 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 23:30:56,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:56 BoogieIcfgContainer [2019-11-23 23:30:56,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 23:30:56,830 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 23:30:56,830 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 23:30:56,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 23:30:56,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:53" (1/3) ... [2019-11-23 23:30:56,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb2701d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:56, skipping insertion in model container [2019-11-23 23:30:56,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (2/3) ... [2019-11-23 23:30:56,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb2701d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:56, skipping insertion in model container [2019-11-23 23:30:56,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:56" (3/3) ... [2019-11-23 23:30:56,837 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-23 23:30:56,847 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 23:30:56,854 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 23:30:56,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 23:30:56,892 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 23:30:56,892 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 23:30:56,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 23:30:56,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 23:30:56,893 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 23:30:56,893 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 23:30:56,893 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 23:30:56,893 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 23:30:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 23:30:56,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-23 23:30:56,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:56,921 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:30:56,922 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:56,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1323244319, now seen corresponding path program 1 times [2019-11-23 23:30:56,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:56,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562511044] [2019-11-23 23:30:56,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:57,368 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:30:57,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562511044] [2019-11-23 23:30:57,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:57,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:57,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392115667] [2019-11-23 23:30:57,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:57,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:57,396 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 23:30:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:57,996 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-11-23 23:30:57,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:57,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-23 23:30:57,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,012 INFO L225 Difference]: With dead ends: 224 [2019-11-23 23:30:58,013 INFO L226 Difference]: Without dead ends: 145 [2019-11-23 23:30:58,016 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:30:58,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-23 23:30:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-23 23:30:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-23 23:30:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-23 23:30:58,075 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-23 23:30:58,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,077 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-23 23:30:58,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:58,077 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-23 23:30:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-23 23:30:58,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,085 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:58,085 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,086 INFO L82 PathProgramCache]: Analyzing trace with hash 585773401, now seen corresponding path program 1 times [2019-11-23 23:30:58,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327440731] [2019-11-23 23:30:58,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:58,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327440731] [2019-11-23 23:30:58,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:58,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254320268] [2019-11-23 23:30:58,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:58,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:58,213 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-23 23:30:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:58,629 INFO L93 Difference]: Finished difference Result 431 states and 774 transitions. [2019-11-23 23:30:58,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:58,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-23 23:30:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:58,632 INFO L225 Difference]: With dead ends: 431 [2019-11-23 23:30:58,633 INFO L226 Difference]: Without dead ends: 287 [2019-11-23 23:30:58,634 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:30:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-23 23:30:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-11-23 23:30:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-23 23:30:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 480 transitions. [2019-11-23 23:30:58,671 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 480 transitions. Word has length 76 [2019-11-23 23:30:58,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:58,671 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 480 transitions. [2019-11-23 23:30:58,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:58,671 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 480 transitions. [2019-11-23 23:30:58,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 23:30:58,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:58,684 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:58,684 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:58,685 INFO L82 PathProgramCache]: Analyzing trace with hash 919985359, now seen corresponding path program 1 times [2019-11-23 23:30:58,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:58,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37435582] [2019-11-23 23:30:58,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:30:58,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37435582] [2019-11-23 23:30:58,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:58,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:30:58,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10375467] [2019-11-23 23:30:58,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:30:58,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:58,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:30:58,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:30:58,806 INFO L87 Difference]: Start difference. First operand 287 states and 480 transitions. Second operand 4 states. [2019-11-23 23:30:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,406 INFO L93 Difference]: Finished difference Result 1141 states and 1915 transitions. [2019-11-23 23:30:59,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:30:59,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-23 23:30:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,411 INFO L225 Difference]: With dead ends: 1141 [2019-11-23 23:30:59,411 INFO L226 Difference]: Without dead ends: 855 [2019-11-23 23:30:59,413 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:30:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-23 23:30:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-11-23 23:30:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-23 23:30:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1324 transitions. [2019-11-23 23:30:59,444 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1324 transitions. Word has length 80 [2019-11-23 23:30:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,445 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1324 transitions. [2019-11-23 23:30:59,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:30:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1324 transitions. [2019-11-23 23:30:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-23 23:30:59,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:30:59,448 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:30:59,449 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:30:59,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:30:59,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1341145350, now seen corresponding path program 1 times [2019-11-23 23:30:59,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:30:59,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551503104] [2019-11-23 23:30:59,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:30:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:30:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 23:30:59,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551503104] [2019-11-23 23:30:59,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:30:59,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 23:30:59,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818151223] [2019-11-23 23:30:59,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:30:59,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:30:59,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:30:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:30:59,495 INFO L87 Difference]: Start difference. First operand 855 states and 1324 transitions. Second operand 3 states. [2019-11-23 23:30:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:30:59,953 INFO L93 Difference]: Finished difference Result 1851 states and 2891 transitions. [2019-11-23 23:30:59,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:30:59,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-23 23:30:59,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:30:59,959 INFO L225 Difference]: With dead ends: 1851 [2019-11-23 23:30:59,959 INFO L226 Difference]: Without dead ends: 997 [2019-11-23 23:30:59,962 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:30:59,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-23 23:30:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 713. [2019-11-23 23:30:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:30:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1098 transitions. [2019-11-23 23:30:59,987 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1098 transitions. Word has length 83 [2019-11-23 23:30:59,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:30:59,988 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1098 transitions. [2019-11-23 23:30:59,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:30:59,988 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1098 transitions. [2019-11-23 23:31:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-23 23:31:00,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,023 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:00,024 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1986458624, now seen corresponding path program 1 times [2019-11-23 23:31:00,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090238049] [2019-11-23 23:31:00,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:00,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090238049] [2019-11-23 23:31:00,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:00,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914710768] [2019-11-23 23:31:00,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:00,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:00,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:00,160 INFO L87 Difference]: Start difference. First operand 713 states and 1098 transitions. Second operand 4 states. [2019-11-23 23:31:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:00,693 INFO L93 Difference]: Finished difference Result 1516 states and 2304 transitions. [2019-11-23 23:31:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 23:31:00,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-23 23:31:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:00,699 INFO L225 Difference]: With dead ends: 1516 [2019-11-23 23:31:00,699 INFO L226 Difference]: Without dead ends: 804 [2019-11-23 23:31:00,700 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:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-11-23 23:31:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 784. [2019-11-23 23:31:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1175 transitions. [2019-11-23 23:31:00,720 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1175 transitions. Word has length 86 [2019-11-23 23:31:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1175 transitions. [2019-11-23 23:31:00,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1175 transitions. [2019-11-23 23:31:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-23 23:31:00,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:00,723 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:00,723 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:00,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1981860152, now seen corresponding path program 1 times [2019-11-23 23:31:00,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:00,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909656429] [2019-11-23 23:31:00,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:00,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909656429] [2019-11-23 23:31:00,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:00,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:00,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815761308] [2019-11-23 23:31:00,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:00,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:00,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:00,793 INFO L87 Difference]: Start difference. First operand 784 states and 1175 transitions. Second operand 4 states. [2019-11-23 23:31:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,353 INFO L93 Difference]: Finished difference Result 1496 states and 2272 transitions. [2019-11-23 23:31:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:01,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-23 23:31:01,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,358 INFO L225 Difference]: With dead ends: 1496 [2019-11-23 23:31:01,358 INFO L226 Difference]: Without dead ends: 784 [2019-11-23 23:31:01,360 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:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-23 23:31:01,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2019-11-23 23:31:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:01,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1157 transitions. [2019-11-23 23:31:01,378 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1157 transitions. Word has length 90 [2019-11-23 23:31:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,378 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1157 transitions. [2019-11-23 23:31:01,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:01,378 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1157 transitions. [2019-11-23 23:31:01,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 23:31:01,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,380 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 23:31:01,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1728901267, now seen corresponding path program 1 times [2019-11-23 23:31:01,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473370196] [2019-11-23 23:31:01,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:01,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473370196] [2019-11-23 23:31:01,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:01,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839377740] [2019-11-23 23:31:01,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:01,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:01,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:01,429 INFO L87 Difference]: Start difference. First operand 784 states and 1157 transitions. Second operand 3 states. [2019-11-23 23:31:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:01,774 INFO L93 Difference]: Finished difference Result 1709 states and 2539 transitions. [2019-11-23 23:31:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:01,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 23:31:01,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:01,779 INFO L225 Difference]: With dead ends: 1709 [2019-11-23 23:31:01,779 INFO L226 Difference]: Without dead ends: 926 [2019-11-23 23:31:01,781 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:01,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-23 23:31:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 784. [2019-11-23 23:31:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-23 23:31:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1014 transitions. [2019-11-23 23:31:01,799 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1014 transitions. Word has length 93 [2019-11-23 23:31:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:01,799 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1014 transitions. [2019-11-23 23:31:01,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1014 transitions. [2019-11-23 23:31:01,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-23 23:31:01,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:01,801 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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:01,802 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:01,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:01,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1603156545, now seen corresponding path program 1 times [2019-11-23 23:31:01,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:01,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86559769] [2019-11-23 23:31:01,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 23:31:01,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86559769] [2019-11-23 23:31:01,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:01,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 23:31:01,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951417035] [2019-11-23 23:31:01,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 23:31:01,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:01,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 23:31:01,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 23:31:01,862 INFO L87 Difference]: Start difference. First operand 784 states and 1014 transitions. Second operand 4 states. [2019-11-23 23:31:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,480 INFO L93 Difference]: Finished difference Result 2064 states and 2702 transitions. [2019-11-23 23:31:02,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 23:31:02,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-23 23:31:02,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,488 INFO L225 Difference]: With dead ends: 2064 [2019-11-23 23:31:02,488 INFO L226 Difference]: Without dead ends: 1281 [2019-11-23 23:31:02,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states. [2019-11-23 23:31:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 713. [2019-11-23 23:31:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-23 23:31:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 919 transitions. [2019-11-23 23:31:02,513 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 919 transitions. Word has length 101 [2019-11-23 23:31:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,513 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 919 transitions. [2019-11-23 23:31:02,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 23:31:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 919 transitions. [2019-11-23 23:31:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 23:31:02,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 23:31:02,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,516 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 23:31:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 23:31:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2105520887, now seen corresponding path program 1 times [2019-11-23 23:31:02,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-23 23:31:02,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752812678] [2019-11-23 23:31:02,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 23:31:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 23:31:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 23:31:02,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752812678] [2019-11-23 23:31:02,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 23:31:02,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 23:31:02,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399395780] [2019-11-23 23:31:02,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 23:31:02,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-23 23:31:02,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 23:31:02,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 23:31:02,607 INFO L87 Difference]: Start difference. First operand 713 states and 919 transitions. Second operand 3 states. [2019-11-23 23:31:02,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 23:31:02,886 INFO L93 Difference]: Finished difference Result 784 states and 994 transitions. [2019-11-23 23:31:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 23:31:02,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-11-23 23:31:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 23:31:02,888 INFO L225 Difference]: With dead ends: 784 [2019-11-23 23:31:02,888 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 23:31:02,890 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:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 23:31:02,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 23:31:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 23:31:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 23:31:02,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-11-23 23:31:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 23:31:02,891 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 23:31:02,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 23:31:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 23:31:02,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 23:31:02,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 23:31:03,111 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-23 23:31:03,238 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 22 [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 23:31:03,242 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 23:31:03,243 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 23:31:03,244 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 23:31:03,244 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 23:31:03,244 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 23:31:03,244 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 23:31:03,246 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0))) (let ((.cse2 (not .cse1)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and .cse2 .cse0 (= 15 ~a8~0)) (and .cse2 (= ~a17~0 1) .cse0)))) [2019-11-23 23:31:03,246 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 23:31:03,247 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 23:31:03,247 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 23:31:03,247 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 23:31:03,253 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 23:31:03,253 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 23:31:03,253 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 23:31:03,253 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 23:31:03,253 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 23:31:03,254 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 23:31:03,255 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 23:31:03,257 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 23:31:03,279 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 23:31:03,279 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 23:31:03,279 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 23:31:03,279 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 23:31:03,279 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= 1 ~a7~0))) (let ((.cse2 (not .cse1)) (.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= 13 ~a8~0)) (and .cse2 .cse0 (= 15 ~a8~0)) (and .cse2 (= ~a17~0 1) .cse0)))) [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 23:31:03,280 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 23:31:03,281 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 23:31:03,282 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 23:31:03,283 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 23:31:03,284 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-23 23:31:03,284 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 23:31:03,284 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 23:31:03,285 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 23:31:03,285 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 23:31:03,285 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 23:31:03,285 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 23:31:03,285 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 23:31:03,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:31:03 BoogieIcfgContainer [2019-11-23 23:31:03,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 23:31:03,317 INFO L168 Benchmark]: Toolchain (without parser) took 9512.82 ms. Allocated memory was 146.8 MB in the beginning and 357.6 MB in the end (delta: 210.8 MB). Free memory was 102.7 MB in the beginning and 317.7 MB in the end (delta: -214.9 MB). Peak memory consumption was 186.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,319 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.04 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 165.7 MB in the end (delta: -63.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.64 ms. Allocated memory is still 205.5 MB. Free memory was 165.7 MB in the beginning and 159.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,325 INFO L168 Benchmark]: Boogie Preprocessor took 100.00 ms. Allocated memory is still 205.5 MB. Free memory was 159.7 MB in the beginning and 155.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,326 INFO L168 Benchmark]: RCFGBuilder took 2089.15 ms. Allocated memory was 205.5 MB in the beginning and 245.9 MB in the end (delta: 40.4 MB). Free memory was 155.0 MB in the beginning and 189.7 MB in the end (delta: -34.8 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,328 INFO L168 Benchmark]: TraceAbstraction took 6485.07 ms. Allocated memory was 245.9 MB in the beginning and 357.6 MB in the end (delta: 111.7 MB). Free memory was 188.0 MB in the beginning and 317.7 MB in the end (delta: -129.6 MB). Peak memory consumption was 172.3 MB. Max. memory is 7.1 GB. [2019-11-23 23:31:03,343 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.29 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 743.04 ms. Allocated memory was 146.8 MB in the beginning and 205.5 MB in the end (delta: 58.7 MB). Free memory was 102.5 MB in the beginning and 165.7 MB in the end (delta: -63.2 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 90.64 ms. Allocated memory is still 205.5 MB. Free memory was 165.7 MB in the beginning and 159.7 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.00 ms. Allocated memory is still 205.5 MB. Free memory was 159.7 MB in the beginning and 155.0 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2089.15 ms. Allocated memory was 205.5 MB in the beginning and 245.9 MB in the end (delta: 40.4 MB). Free memory was 155.0 MB in the beginning and 189.7 MB in the end (delta: -34.8 MB). Peak memory consumption was 103.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6485.07 ms. Allocated memory was 245.9 MB in the beginning and 357.6 MB in the end (delta: 111.7 MB). Free memory was 188.0 MB in the beginning and 317.7 MB in the end (delta: -129.6 MB). Peak memory consumption was 172.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (1 == a7 && 13 == a8)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 6.3s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 478 SDtfs, 933 SDslu, 56 SDs, 0 SdLazy, 2529 SolverSat, 623 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=855occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 1014 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 31 NumberOfFragments, 77 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3750 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 368 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 788 NumberOfCodeBlocks, 788 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 140631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 174/174 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...