java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 10:05:39,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 10:05:39,044 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 10:05:39,055 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 10:05:39,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 10:05:39,057 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 10:05:39,058 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 10:05:39,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 10:05:39,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 10:05:39,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 10:05:39,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 10:05:39,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 10:05:39,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 10:05:39,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 10:05:39,067 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 10:05:39,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 10:05:39,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 10:05:39,071 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 10:05:39,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 10:05:39,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 10:05:39,076 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 10:05:39,077 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 10:05:39,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 10:05:39,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 10:05:39,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 10:05:39,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 10:05:39,082 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 10:05:39,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 10:05:39,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 10:05:39,086 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 10:05:39,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 10:05:39,087 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 10:05:39,087 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 10:05:39,087 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 10:05:39,088 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 10:05:39,091 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 10:05:39,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 10:05:39,124 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 10:05:39,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 10:05:39,127 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 10:05:39,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 10:05:39,128 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 10:05:39,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 10:05:39,128 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 10:05:39,129 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 10:05:39,129 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 10:05:39,129 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 10:05:39,129 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 10:05:39,129 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 10:05:39,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 10:05:39,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 10:05:39,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 10:05:39,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 10:05:39,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 10:05:39,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 10:05:39,132 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 10:05:39,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 10:05:39,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 10:05:39,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 10:05:39,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 10:05:39,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 10:05:39,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 10:05:39,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 10:05:39,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 10:05:39,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 10:05:39,135 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 10:05:39,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 10:05:39,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 10:05:39,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 10:05:39,136 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 10:05:39,136 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 10:05:39,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 10:05:39,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 10:05:39,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 10:05:39,218 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 10:05:39,218 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 10:05:39,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-10-23 10:05:39,289 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aca062c33/03963a0aad144f10a76838bbf5c84797/FLAG26ad510cb [2018-10-23 10:05:39,822 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 10:05:39,823 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-10-23 10:05:39,836 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aca062c33/03963a0aad144f10a76838bbf5c84797/FLAG26ad510cb [2018-10-23 10:05:39,854 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/aca062c33/03963a0aad144f10a76838bbf5c84797 [2018-10-23 10:05:39,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 10:05:39,869 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 10:05:39,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 10:05:39,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 10:05:39,876 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 10:05:39,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:05:39" (1/1) ... [2018-10-23 10:05:39,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f98923e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:39, skipping insertion in model container [2018-10-23 10:05:39,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:05:39" (1/1) ... [2018-10-23 10:05:39,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 10:05:39,943 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 10:05:40,303 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:05:40,308 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 10:05:40,423 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:05:40,446 INFO L193 MainTranslator]: Completed translation [2018-10-23 10:05:40,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40 WrapperNode [2018-10-23 10:05:40,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 10:05:40,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 10:05:40,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 10:05:40,448 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 10:05:40,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 10:05:40,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 10:05:40,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 10:05:40,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 10:05:40,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... [2018-10-23 10:05:40,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 10:05:40,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 10:05:40,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 10:05:40,539 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 10:05:40,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-23 10:05:40,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 10:05:40,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 10:05:40,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 10:05:40,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 10:05:40,696 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 10:05:40,696 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 10:05:42,087 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 10:05:42,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:05:42 BoogieIcfgContainer [2018-10-23 10:05:42,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 10:05:42,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 10:05:42,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 10:05:42,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 10:05:42,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:05:39" (1/3) ... [2018-10-23 10:05:42,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b47cf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:05:42, skipping insertion in model container [2018-10-23 10:05:42,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:05:40" (2/3) ... [2018-10-23 10:05:42,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b47cf03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:05:42, skipping insertion in model container [2018-10-23 10:05:42,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:05:42" (3/3) ... [2018-10-23 10:05:42,095 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call.c.i.p+nlh-reducer.c [2018-10-23 10:05:42,105 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 10:05:42,114 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 10:05:42,128 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 10:05:42,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 10:05:42,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 10:05:42,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 10:05:42,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 10:05:42,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 10:05:42,164 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 10:05:42,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 10:05:42,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 10:05:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-10-23 10:05:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:42,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:42,207 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:42,209 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:42,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:42,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2018-10-23 10:05:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:42,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:42,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:42,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:42,263 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:42,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:42,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:05:42,493 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:42,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:05:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:05:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:05:42,520 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-10-23 10:05:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:43,740 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2018-10-23 10:05:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:05:43,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-23 10:05:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:43,758 INFO L225 Difference]: With dead ends: 290 [2018-10-23 10:05:43,758 INFO L226 Difference]: Without dead ends: 145 [2018-10-23 10:05:43,762 INFO L605 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 [2018-10-23 10:05:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-23 10:05:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-10-23 10:05:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-23 10:05:43,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2018-10-23 10:05:43,814 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2018-10-23 10:05:43,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:43,815 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2018-10-23 10:05:43,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:05:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2018-10-23 10:05:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:43,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:43,819 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:43,819 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:43,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2018-10-23 10:05:43,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:43,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:43,822 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:43,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:43,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:05:43,952 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:43,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:05:43,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:05:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:05:43,955 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2018-10-23 10:05:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:44,787 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2018-10-23 10:05:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:05:44,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2018-10-23 10:05:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:44,791 INFO L225 Difference]: With dead ends: 410 [2018-10-23 10:05:44,791 INFO L226 Difference]: Without dead ends: 277 [2018-10-23 10:05:44,793 INFO L605 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 [2018-10-23 10:05:44,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-23 10:05:44,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-23 10:05:44,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-23 10:05:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2018-10-23 10:05:44,823 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2018-10-23 10:05:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:44,824 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2018-10-23 10:05:44,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:05:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2018-10-23 10:05:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:44,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:44,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:44,829 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:44,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2018-10-23 10:05:44,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:44,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:44,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:44,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:45,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:45,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-23 10:05:45,099 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:45,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-23 10:05:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-23 10:05:45,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 10:05:45,100 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 7 states. [2018-10-23 10:05:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:46,148 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2018-10-23 10:05:46,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-23 10:05:46,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2018-10-23 10:05:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:46,152 INFO L225 Difference]: With dead ends: 404 [2018-10-23 10:05:46,152 INFO L226 Difference]: Without dead ends: 269 [2018-10-23 10:05:46,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-23 10:05:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-23 10:05:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-10-23 10:05:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-23 10:05:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2018-10-23 10:05:46,176 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2018-10-23 10:05:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:46,177 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2018-10-23 10:05:46,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-23 10:05:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2018-10-23 10:05:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:46,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:46,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:46,181 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:46,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:46,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2018-10-23 10:05:46,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:46,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:46,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:46,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:46,183 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:46,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:46,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-23 10:05:46,410 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:46,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-23 10:05:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-23 10:05:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-23 10:05:46,412 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 8 states. [2018-10-23 10:05:48,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:48,056 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2018-10-23 10:05:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 10:05:48,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2018-10-23 10:05:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:48,059 INFO L225 Difference]: With dead ends: 394 [2018-10-23 10:05:48,060 INFO L226 Difference]: Without dead ends: 267 [2018-10-23 10:05:48,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-23 10:05:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-23 10:05:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-23 10:05:48,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-23 10:05:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2018-10-23 10:05:48,077 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2018-10-23 10:05:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:48,078 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2018-10-23 10:05:48,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-23 10:05:48,078 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2018-10-23 10:05:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:48,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:48,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:48,081 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:48,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2018-10-23 10:05:48,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:48,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:48,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:48,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:48,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:48,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:48,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-23 10:05:48,566 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:48,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 10:05:48,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 10:05:48,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-23 10:05:48,567 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 9 states. [2018-10-23 10:05:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:49,727 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2018-10-23 10:05:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 10:05:49,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2018-10-23 10:05:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:49,731 INFO L225 Difference]: With dead ends: 390 [2018-10-23 10:05:49,731 INFO L226 Difference]: Without dead ends: 265 [2018-10-23 10:05:49,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-23 10:05:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-23 10:05:49,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-10-23 10:05:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-23 10:05:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2018-10-23 10:05:49,745 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2018-10-23 10:05:49,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:49,745 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2018-10-23 10:05:49,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 10:05:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2018-10-23 10:05:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:49,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:49,748 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:49,748 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:49,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2018-10-23 10:05:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:49,750 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:50,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:50,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:50,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-23 10:05:50,007 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:50,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-23 10:05:50,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-23 10:05:50,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-23 10:05:50,008 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 12 states. [2018-10-23 10:05:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:50,665 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2018-10-23 10:05:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-23 10:05:50,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2018-10-23 10:05:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:50,667 INFO L225 Difference]: With dead ends: 382 [2018-10-23 10:05:50,667 INFO L226 Difference]: Without dead ends: 259 [2018-10-23 10:05:50,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-23 10:05:50,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-23 10:05:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-10-23 10:05:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-23 10:05:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2018-10-23 10:05:50,678 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2018-10-23 10:05:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:50,679 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2018-10-23 10:05:50,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-23 10:05:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2018-10-23 10:05:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:50,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:50,681 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:50,681 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:50,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2018-10-23 10:05:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:50,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:50,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:50,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:50,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-23 10:05:50,859 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:50,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 10:05:50,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 10:05:50,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-23 10:05:50,861 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 14 states. [2018-10-23 10:05:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:52,363 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2018-10-23 10:05:52,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-23 10:05:52,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 143 [2018-10-23 10:05:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:52,366 INFO L225 Difference]: With dead ends: 372 [2018-10-23 10:05:52,366 INFO L226 Difference]: Without dead ends: 255 [2018-10-23 10:05:52,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-23 10:05:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-23 10:05:52,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-10-23 10:05:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-23 10:05:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2018-10-23 10:05:52,376 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2018-10-23 10:05:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:52,377 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2018-10-23 10:05:52,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-23 10:05:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2018-10-23 10:05:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:52,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:52,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:52,379 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:52,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:52,379 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2018-10-23 10:05:52,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:52,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:52,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:52,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:52,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:52,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:52,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-23 10:05:52,621 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:52,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-23 10:05:52,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-23 10:05:52,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-23 10:05:52,622 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 15 states. [2018-10-23 10:05:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:53,170 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2018-10-23 10:05:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-23 10:05:53,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 143 [2018-10-23 10:05:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:53,173 INFO L225 Difference]: With dead ends: 366 [2018-10-23 10:05:53,173 INFO L226 Difference]: Without dead ends: 253 [2018-10-23 10:05:53,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-23 10:05:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-23 10:05:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-10-23 10:05:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-23 10:05:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2018-10-23 10:05:53,183 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2018-10-23 10:05:53,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:53,183 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2018-10-23 10:05:53,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-23 10:05:53,184 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2018-10-23 10:05:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:53,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:53,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:53,186 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:53,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2018-10-23 10:05:53,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:53,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:53,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:53,187 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-10-23 10:05:53,376 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:53,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-23 10:05:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-23 10:05:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-23 10:05:53,377 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 17 states. [2018-10-23 10:05:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:55,236 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2018-10-23 10:05:55,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-23 10:05:55,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2018-10-23 10:05:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:55,238 INFO L225 Difference]: With dead ends: 360 [2018-10-23 10:05:55,239 INFO L226 Difference]: Without dead ends: 249 [2018-10-23 10:05:55,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-23 10:05:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-23 10:05:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-10-23 10:05:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-23 10:05:55,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2018-10-23 10:05:55,250 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2018-10-23 10:05:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:55,251 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2018-10-23 10:05:55,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-23 10:05:55,251 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2018-10-23 10:05:55,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:55,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:55,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:55,253 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:55,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2018-10-23 10:05:55,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:55,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:55,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:55,255 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:55,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:55,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-23 10:05:55,613 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:55,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-23 10:05:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-23 10:05:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-23 10:05:55,615 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 19 states. [2018-10-23 10:05:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:58,383 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2018-10-23 10:05:58,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-23 10:05:58,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 143 [2018-10-23 10:05:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:58,387 INFO L225 Difference]: With dead ends: 352 [2018-10-23 10:05:58,387 INFO L226 Difference]: Without dead ends: 245 [2018-10-23 10:05:58,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-23 10:05:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-23 10:05:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-10-23 10:05:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-23 10:05:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2018-10-23 10:05:58,398 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2018-10-23 10:05:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:05:58,398 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2018-10-23 10:05:58,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-23 10:05:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2018-10-23 10:05:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:05:58,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:05:58,400 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:05:58,400 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:05:58,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:05:58,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2018-10-23 10:05:58,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:05:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:58,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:05:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:05:58,402 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:05:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:05:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:05:59,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:05:59,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-10-23 10:05:59,186 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:05:59,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-23 10:05:59,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-23 10:05:59,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-23 10:05:59,187 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 23 states. [2018-10-23 10:05:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:05:59,986 INFO L93 Difference]: Finished difference Result 340 states and 392 transitions. [2018-10-23 10:05:59,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-23 10:05:59,987 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2018-10-23 10:05:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:05:59,990 INFO L225 Difference]: With dead ends: 340 [2018-10-23 10:05:59,990 INFO L226 Difference]: Without dead ends: 237 [2018-10-23 10:05:59,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-23 10:05:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-23 10:05:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-23 10:05:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-23 10:05:59,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2018-10-23 10:06:00,000 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 143 [2018-10-23 10:06:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:00,000 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2018-10-23 10:06:00,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-23 10:06:00,000 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2018-10-23 10:06:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:00,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:00,002 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:00,003 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:00,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1149693335, now seen corresponding path program 1 times [2018-10-23 10:06:00,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:00,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:00,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:00,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:00,005 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-10-23 10:06:00,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:00,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-23 10:06:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-23 10:06:00,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-23 10:06:00,607 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 24 states. [2018-10-23 10:06:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:02,555 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2018-10-23 10:06:02,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-23 10:06:02,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 143 [2018-10-23 10:06:02,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:02,557 INFO L225 Difference]: With dead ends: 330 [2018-10-23 10:06:02,557 INFO L226 Difference]: Without dead ends: 235 [2018-10-23 10:06:02,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-23 10:06:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-23 10:06:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-23 10:06:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-23 10:06:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 282 transitions. [2018-10-23 10:06:02,568 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 282 transitions. Word has length 143 [2018-10-23 10:06:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:02,568 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 282 transitions. [2018-10-23 10:06:02,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-23 10:06:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 282 transitions. [2018-10-23 10:06:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:02,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:02,570 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:02,570 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:02,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:02,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1452778676, now seen corresponding path program 1 times [2018-10-23 10:06:02,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:02,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:02,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:02,572 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:03,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:03,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-10-23 10:06:03,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:03,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-23 10:06:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-23 10:06:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-23 10:06:03,925 INFO L87 Difference]: Start difference. First operand 235 states and 282 transitions. Second operand 25 states. [2018-10-23 10:06:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:06,176 INFO L93 Difference]: Finished difference Result 326 states and 373 transitions. [2018-10-23 10:06:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-23 10:06:06,177 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 143 [2018-10-23 10:06:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:06,179 INFO L225 Difference]: With dead ends: 326 [2018-10-23 10:06:06,179 INFO L226 Difference]: Without dead ends: 233 [2018-10-23 10:06:06,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-23 10:06:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-23 10:06:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-10-23 10:06:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-23 10:06:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-10-23 10:06:06,188 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 143 [2018-10-23 10:06:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:06,188 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-10-23 10:06:06,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-23 10:06:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-10-23 10:06:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:06,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:06,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:06,190 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:06,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1738588719, now seen corresponding path program 1 times [2018-10-23 10:06:06,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:06,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:06,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:06,191 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:06,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:06,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-10-23 10:06:06,573 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:06,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-23 10:06:06,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-23 10:06:06,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-23 10:06:06,575 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 28 states. [2018-10-23 10:06:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:08,808 INFO L93 Difference]: Finished difference Result 318 states and 364 transitions. [2018-10-23 10:06:08,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-23 10:06:08,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 143 [2018-10-23 10:06:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:08,811 INFO L225 Difference]: With dead ends: 318 [2018-10-23 10:06:08,811 INFO L226 Difference]: Without dead ends: 227 [2018-10-23 10:06:08,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-23 10:06:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-23 10:06:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-10-23 10:06:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-23 10:06:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2018-10-23 10:06:08,820 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 143 [2018-10-23 10:06:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:08,820 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2018-10-23 10:06:08,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-23 10:06:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2018-10-23 10:06:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:08,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:08,821 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:08,822 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:08,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -512972737, now seen corresponding path program 1 times [2018-10-23 10:06:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:08,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:08,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:08,823 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:10,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:10,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-10-23 10:06:10,091 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:10,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-23 10:06:10,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-23 10:06:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-23 10:06:10,093 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand 30 states. [2018-10-23 10:06:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:10,873 INFO L93 Difference]: Finished difference Result 308 states and 351 transitions. [2018-10-23 10:06:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-23 10:06:10,873 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 143 [2018-10-23 10:06:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:10,875 INFO L225 Difference]: With dead ends: 308 [2018-10-23 10:06:10,875 INFO L226 Difference]: Without dead ends: 223 [2018-10-23 10:06:10,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-23 10:06:10,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-23 10:06:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-10-23 10:06:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-23 10:06:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 264 transitions. [2018-10-23 10:06:10,884 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 264 transitions. Word has length 143 [2018-10-23 10:06:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:10,885 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 264 transitions. [2018-10-23 10:06:10,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-23 10:06:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 264 transitions. [2018-10-23 10:06:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:10,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:10,886 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:10,887 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:10,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:10,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1207573688, now seen corresponding path program 1 times [2018-10-23 10:06:10,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:10,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:10,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:10,889 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:11,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:11,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2018-10-23 10:06:11,658 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:11,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-23 10:06:11,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-23 10:06:11,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-23 10:06:11,660 INFO L87 Difference]: Start difference. First operand 223 states and 264 transitions. Second operand 31 states. [2018-10-23 10:06:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:14,041 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2018-10-23 10:06:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-23 10:06:14,041 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-10-23 10:06:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:14,043 INFO L225 Difference]: With dead ends: 302 [2018-10-23 10:06:14,043 INFO L226 Difference]: Without dead ends: 221 [2018-10-23 10:06:14,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-23 10:06:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-23 10:06:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-10-23 10:06:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-23 10:06:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2018-10-23 10:06:14,053 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 143 [2018-10-23 10:06:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:14,054 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2018-10-23 10:06:14,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-23 10:06:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2018-10-23 10:06:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:14,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:14,055 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:14,056 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:14,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1520258956, now seen corresponding path program 1 times [2018-10-23 10:06:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:14,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:14,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:15,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:15,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2018-10-23 10:06:15,128 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:15,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-23 10:06:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-23 10:06:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 10:06:15,129 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand 33 states. [2018-10-23 10:06:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:17,622 INFO L93 Difference]: Finished difference Result 296 states and 336 transitions. [2018-10-23 10:06:17,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-23 10:06:17,622 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 143 [2018-10-23 10:06:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:17,625 INFO L225 Difference]: With dead ends: 296 [2018-10-23 10:06:17,625 INFO L226 Difference]: Without dead ends: 217 [2018-10-23 10:06:17,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-23 10:06:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-23 10:06:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-23 10:06:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-23 10:06:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 255 transitions. [2018-10-23 10:06:17,632 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 255 transitions. Word has length 143 [2018-10-23 10:06:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:17,632 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 255 transitions. [2018-10-23 10:06:17,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-23 10:06:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 255 transitions. [2018-10-23 10:06:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:17,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:17,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:17,634 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1702235704, now seen corresponding path program 1 times [2018-10-23 10:06:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:17,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:17,636 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:18,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:18,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2018-10-23 10:06:18,193 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:18,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-23 10:06:18,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-23 10:06:18,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-23 10:06:18,194 INFO L87 Difference]: Start difference. First operand 217 states and 255 transitions. Second operand 35 states. [2018-10-23 10:06:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:19,398 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2018-10-23 10:06:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-23 10:06:19,399 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 143 [2018-10-23 10:06:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:19,400 INFO L225 Difference]: With dead ends: 288 [2018-10-23 10:06:19,400 INFO L226 Difference]: Without dead ends: 213 [2018-10-23 10:06:19,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-23 10:06:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-23 10:06:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-10-23 10:06:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-23 10:06:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2018-10-23 10:06:19,405 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 143 [2018-10-23 10:06:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:19,405 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2018-10-23 10:06:19,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-23 10:06:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2018-10-23 10:06:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:19,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:19,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:19,406 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:19,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2011984104, now seen corresponding path program 1 times [2018-10-23 10:06:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:19,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:19,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:19,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:20,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:20,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2018-10-23 10:06:20,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:20,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-23 10:06:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-23 10:06:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-23 10:06:20,664 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand 39 states. [2018-10-23 10:06:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:22,661 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2018-10-23 10:06:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-23 10:06:22,661 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 143 [2018-10-23 10:06:22,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:22,663 INFO L225 Difference]: With dead ends: 276 [2018-10-23 10:06:22,663 INFO L226 Difference]: Without dead ends: 205 [2018-10-23 10:06:22,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-23 10:06:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-23 10:06:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-23 10:06:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-23 10:06:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2018-10-23 10:06:22,671 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 143 [2018-10-23 10:06:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:22,671 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2018-10-23 10:06:22,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-23 10:06:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2018-10-23 10:06:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:22,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:22,673 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:22,673 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:22,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 221232183, now seen corresponding path program 1 times [2018-10-23 10:06:22,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:22,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:22,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:22,674 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:24,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:24,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2018-10-23 10:06:24,914 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:24,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-23 10:06:24,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-23 10:06:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-23 10:06:24,916 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 40 states. [2018-10-23 10:06:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:26,232 INFO L93 Difference]: Finished difference Result 266 states and 298 transitions. [2018-10-23 10:06:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-23 10:06:26,233 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 143 [2018-10-23 10:06:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:26,234 INFO L225 Difference]: With dead ends: 266 [2018-10-23 10:06:26,234 INFO L226 Difference]: Without dead ends: 203 [2018-10-23 10:06:26,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-23 10:06:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-23 10:06:26,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-10-23 10:06:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-23 10:06:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 234 transitions. [2018-10-23 10:06:26,242 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 234 transitions. Word has length 143 [2018-10-23 10:06:26,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:26,242 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 234 transitions. [2018-10-23 10:06:26,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-23 10:06:26,242 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 234 transitions. [2018-10-23 10:06:26,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:26,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:26,244 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:26,244 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:26,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:26,244 INFO L82 PathProgramCache]: Analyzing trace with hash 500367692, now seen corresponding path program 1 times [2018-10-23 10:06:26,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:26,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:26,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:26,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:27,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:27,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:27,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2018-10-23 10:06:27,343 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:27,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-23 10:06:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-23 10:06:27,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-23 10:06:27,345 INFO L87 Difference]: Start difference. First operand 203 states and 234 transitions. Second operand 41 states. [2018-10-23 10:06:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:30,353 INFO L93 Difference]: Finished difference Result 262 states and 293 transitions. [2018-10-23 10:06:30,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-23 10:06:30,354 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 143 [2018-10-23 10:06:30,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:30,356 INFO L225 Difference]: With dead ends: 262 [2018-10-23 10:06:30,357 INFO L226 Difference]: Without dead ends: 201 [2018-10-23 10:06:30,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-23 10:06:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-23 10:06:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-10-23 10:06:30,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-23 10:06:30,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 231 transitions. [2018-10-23 10:06:30,364 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 231 transitions. Word has length 143 [2018-10-23 10:06:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:30,364 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 231 transitions. [2018-10-23 10:06:30,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-23 10:06:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 231 transitions. [2018-10-23 10:06:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:30,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:30,366 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:30,366 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:30,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:30,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1383526833, now seen corresponding path program 1 times [2018-10-23 10:06:30,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:30,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:30,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:30,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:31,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2018-10-23 10:06:31,187 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:31,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-23 10:06:31,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-23 10:06:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 10:06:31,189 INFO L87 Difference]: Start difference. First operand 201 states and 231 transitions. Second operand 44 states. [2018-10-23 10:06:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:32,602 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2018-10-23 10:06:32,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-23 10:06:32,605 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 143 [2018-10-23 10:06:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:32,607 INFO L225 Difference]: With dead ends: 254 [2018-10-23 10:06:32,608 INFO L226 Difference]: Without dead ends: 195 [2018-10-23 10:06:32,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-23 10:06:32,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-23 10:06:32,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-10-23 10:06:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-23 10:06:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-10-23 10:06:32,614 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 143 [2018-10-23 10:06:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:32,615 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-10-23 10:06:32,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-23 10:06:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-10-23 10:06:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:32,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:32,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:32,617 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:32,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash -595537121, now seen corresponding path program 1 times [2018-10-23 10:06:32,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:32,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:32,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:32,618 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:33,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:33,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2018-10-23 10:06:33,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:33,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-23 10:06:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-23 10:06:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-23 10:06:33,577 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 46 states. [2018-10-23 10:06:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:35,819 INFO L93 Difference]: Finished difference Result 244 states and 271 transitions. [2018-10-23 10:06:35,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-23 10:06:35,820 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2018-10-23 10:06:35,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:35,821 INFO L225 Difference]: With dead ends: 244 [2018-10-23 10:06:35,821 INFO L226 Difference]: Without dead ends: 191 [2018-10-23 10:06:35,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-23 10:06:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-23 10:06:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-23 10:06:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-23 10:06:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2018-10-23 10:06:35,828 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 143 [2018-10-23 10:06:35,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:35,829 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2018-10-23 10:06:35,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-23 10:06:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2018-10-23 10:06:35,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:35,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:35,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:35,830 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:35,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:35,831 INFO L82 PathProgramCache]: Analyzing trace with hash -830587144, now seen corresponding path program 1 times [2018-10-23 10:06:35,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:35,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:35,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:35,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:35,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:37,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:37,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2018-10-23 10:06:37,387 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:37,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-23 10:06:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-23 10:06:37,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-23 10:06:37,388 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand 47 states. [2018-10-23 10:06:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:38,866 INFO L93 Difference]: Finished difference Result 238 states and 263 transitions. [2018-10-23 10:06:38,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-23 10:06:38,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 143 [2018-10-23 10:06:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:38,869 INFO L225 Difference]: With dead ends: 238 [2018-10-23 10:06:38,869 INFO L226 Difference]: Without dead ends: 189 [2018-10-23 10:06:38,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-23 10:06:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-23 10:06:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-23 10:06:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-23 10:06:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 213 transitions. [2018-10-23 10:06:38,876 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 213 transitions. Word has length 143 [2018-10-23 10:06:38,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:38,876 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 213 transitions. [2018-10-23 10:06:38,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-23 10:06:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 213 transitions. [2018-10-23 10:06:38,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:38,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:38,877 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:38,878 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:38,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:38,878 INFO L82 PathProgramCache]: Analyzing trace with hash -228626292, now seen corresponding path program 1 times [2018-10-23 10:06:38,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:38,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:38,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:38,879 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:40,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2018-10-23 10:06:40,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:40,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-23 10:06:40,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-23 10:06:40,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-23 10:06:40,109 INFO L87 Difference]: Start difference. First operand 189 states and 213 transitions. Second operand 49 states. [2018-10-23 10:06:41,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:41,467 INFO L93 Difference]: Finished difference Result 232 states and 256 transitions. [2018-10-23 10:06:41,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-23 10:06:41,467 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 143 [2018-10-23 10:06:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:41,469 INFO L225 Difference]: With dead ends: 232 [2018-10-23 10:06:41,470 INFO L226 Difference]: Without dead ends: 185 [2018-10-23 10:06:41,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-23 10:06:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-23 10:06:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-23 10:06:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-23 10:06:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 207 transitions. [2018-10-23 10:06:41,476 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 207 transitions. Word has length 143 [2018-10-23 10:06:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:41,477 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 207 transitions. [2018-10-23 10:06:41,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-23 10:06:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 207 transitions. [2018-10-23 10:06:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:41,478 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:41,478 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:41,478 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:41,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash 679538168, now seen corresponding path program 1 times [2018-10-23 10:06:41,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:41,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:41,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:41,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:41,480 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:42,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-10-23 10:06:42,509 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:42,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-23 10:06:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-23 10:06:42,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-23 10:06:42,511 INFO L87 Difference]: Start difference. First operand 185 states and 207 transitions. Second operand 51 states. [2018-10-23 10:06:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:45,631 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2018-10-23 10:06:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-23 10:06:45,632 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 143 [2018-10-23 10:06:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:45,634 INFO L225 Difference]: With dead ends: 224 [2018-10-23 10:06:45,634 INFO L226 Difference]: Without dead ends: 181 [2018-10-23 10:06:45,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-23 10:06:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-23 10:06:45,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-23 10:06:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-23 10:06:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 201 transitions. [2018-10-23 10:06:45,640 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 201 transitions. Word has length 143 [2018-10-23 10:06:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:45,640 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 201 transitions. [2018-10-23 10:06:45,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-23 10:06:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 201 transitions. [2018-10-23 10:06:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:45,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:45,642 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:45,642 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:45,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash -200266664, now seen corresponding path program 1 times [2018-10-23 10:06:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:45,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:45,644 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:47,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:47,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:47,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2018-10-23 10:06:47,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:47,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-23 10:06:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-23 10:06:47,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-23 10:06:47,048 INFO L87 Difference]: Start difference. First operand 181 states and 201 transitions. Second operand 53 states. [2018-10-23 10:06:48,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:48,272 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-10-23 10:06:48,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-23 10:06:48,273 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 143 [2018-10-23 10:06:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:48,274 INFO L225 Difference]: With dead ends: 216 [2018-10-23 10:06:48,274 INFO L226 Difference]: Without dead ends: 147 [2018-10-23 10:06:48,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-23 10:06:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-23 10:06:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-23 10:06:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-23 10:06:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-23 10:06:48,282 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-10-23 10:06:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:48,283 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-23 10:06:48,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-23 10:06:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-23 10:06:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-23 10:06:48,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:48,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:48,284 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:48,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:48,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1774383300, now seen corresponding path program 1 times [2018-10-23 10:06:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:48,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:48,285 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:49,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:49,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-23 10:06:49,265 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:49,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-23 10:06:49,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-23 10:06:49,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-23 10:06:49,266 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 22 states. [2018-10-23 10:06:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:49,932 INFO L93 Difference]: Finished difference Result 188 states and 191 transitions. [2018-10-23 10:06:49,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 10:06:49,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 143 [2018-10-23 10:06:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:49,933 INFO L225 Difference]: With dead ends: 188 [2018-10-23 10:06:49,933 INFO L226 Difference]: Without dead ends: 185 [2018-10-23 10:06:49,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-23 10:06:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-23 10:06:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-10-23 10:06:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-23 10:06:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 185 transitions. [2018-10-23 10:06:49,942 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 185 transitions. Word has length 143 [2018-10-23 10:06:49,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:49,942 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 185 transitions. [2018-10-23 10:06:49,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-23 10:06:49,942 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 185 transitions. [2018-10-23 10:06:49,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-23 10:06:49,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:49,943 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:49,944 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:49,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -861732141, now seen corresponding path program 1 times [2018-10-23 10:06:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:49,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:49,945 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 10:06:51,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:06:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-23 10:06:51,366 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:06:51,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-23 10:06:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-23 10:06:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-23 10:06:51,368 INFO L87 Difference]: Start difference. First operand 184 states and 185 transitions. Second operand 52 states. [2018-10-23 10:06:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:06:53,792 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-10-23 10:06:53,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-23 10:06:53,799 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 147 [2018-10-23 10:06:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:06:53,800 INFO L225 Difference]: With dead ends: 192 [2018-10-23 10:06:53,800 INFO L226 Difference]: Without dead ends: 150 [2018-10-23 10:06:53,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-23 10:06:53,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-23 10:06:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-23 10:06:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-23 10:06:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-23 10:06:53,807 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-10-23 10:06:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:06:53,808 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-23 10:06:53,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-23 10:06:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-23 10:06:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-23 10:06:53,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:06:53,809 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:06:53,809 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:06:53,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1190198026, now seen corresponding path program 1 times [2018-10-23 10:06:53,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:06:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:53,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:06:53,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:06:53,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:06:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:06:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:06:54,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:06:54,193 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:06:54,194 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 150 with the following transitions: [2018-10-23 10:06:54,196 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [15], [18], [22], [25], [29], [32], [36], [39], [43], [46], [50], [53], [57], [60], [64], [67], [71], [74], [78], [81], [85], [88], [92], [95], [99], [102], [106], [109], [113], [116], [120], [123], [127], [130], [134], [137], [141], [144], [148], [151], [155], [158], [162], [165], [169], [172], [176], [179], [183], [186], [190], [193], [197], [200], [204], [207], [211], [214], [218], [221], [225], [228], [232], [235], [239], [242], [246], [249], [253], [256], [260], [263], [267], [270], [274], [277], [281], [284], [288], [291], [295], [298], [302], [305], [309], [312], [316], [319], [323], [326], [330], [333], [337], [340], [344], [347], [351], [354], [358], [365], [372], [379], [386], [393], [400], [407], [414], [421], [428], [435], [442], [449], [456], [463], [470], [477], [483], [485], [488], [489], [492], [495], [498], [501], [504], [507], [510], [513], [516], [519], [522], [525], [528], [531], [534], [537], [540], [694], [695], [696] [2018-10-23 10:06:54,265 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:06:54,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:06:54,844 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-23 10:06:54,845 INFO L272 AbstractInterpreter]: Visited 144 different actions 159 times. Merged at 2 different actions 10 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-10-23 10:06:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:06:54,860 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-23 10:06:55,280 INFO L232 lantSequenceWeakener]: Weakened 147 states. On average, predicates are now at 67.94% of their original sizes. [2018-10-23 10:06:55,280 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-23 10:07:01,822 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-23 10:07:01,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-23 10:07:01,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [25] total 95 [2018-10-23 10:07:01,823 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:07:01,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-23 10:07:01,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-23 10:07:01,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=4970, Unknown=0, NotChecked=0, Total=5112 [2018-10-23 10:07:01,827 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 72 states. [2018-10-23 10:07:32,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:07:32,332 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-23 10:07:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-23 10:07:32,332 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 149 [2018-10-23 10:07:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:07:32,332 INFO L225 Difference]: With dead ends: 150 [2018-10-23 10:07:32,333 INFO L226 Difference]: Without dead ends: 0 [2018-10-23 10:07:32,334 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 149 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=146, Invalid=5110, Unknown=0, NotChecked=0, Total=5256 [2018-10-23 10:07:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-23 10:07:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-23 10:07:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-23 10:07:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-23 10:07:32,335 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2018-10-23 10:07:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:07:32,335 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-23 10:07:32,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-23 10:07:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-23 10:07:32,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-23 10:07:32,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-23 10:07:32,600 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 10 [2018-10-23 10:07:34,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-23 10:07:34,075 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-23 10:07:34,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:07:34,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-23 10:07:34,075 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-23 10:07:34,075 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-23 10:07:34,075 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-23 10:07:34,075 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 1253) no Hoare annotation was computed. [2018-10-23 10:07:34,076 INFO L421 ceAbstractionStarter]: At program point L1126(lines 74 1127) the Hoare annotation is: (and (<= 61 (+ main_~main__y~0 main_~main__x~0)) (= main_~main__y~0 50) (<= (+ main_~main__x~0 39) main_~main__y~0)) [2018-10-23 10:07:34,076 INFO L421 ceAbstractionStarter]: At program point L994(lines 140 995) the Hoare annotation is: (and (<= 72 (+ main_~main__y~0 main_~main__x~0)) (<= main_~main__x~0 22) (= main_~main__y~0 50)) [2018-10-23 10:07:34,076 INFO L421 ceAbstractionStarter]: At program point L862(lines 206 863) the Hoare annotation is: (and (<= 66 (* 2 main_~main__x~0)) (= main_~main__y~0 50) (<= (+ main_~main__x~0 17) main_~main__y~0)) [2018-10-23 10:07:34,076 INFO L421 ceAbstractionStarter]: At program point L730(lines 272 731) the Hoare annotation is: (and (<= 44 main_~main__x~0) (<= (* 2 main_~main__x~0) 88) (= main_~main__y~0 50)) [2018-10-23 10:07:34,076 INFO L421 ceAbstractionStarter]: At program point L598(lines 338 599) the Hoare annotation is: (let ((.cse0 (+ main_~main__y~0 main_~main__x~0))) (and (<= 110 .cse0) (= main_~main__x~0 55) (<= .cse0 110))) [2018-10-23 10:07:34,076 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 439) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L421 ceAbstractionStarter]: At program point L466(lines 404 467) the Hoare annotation is: (let ((.cse1 (* 2 main_~main__y~0)) (.cse0 (* 2 main_~main__x~0))) (and (<= .cse0 132) (<= .cse1 132) (<= 132 .cse1) (<= 132 .cse0))) [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 539) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 671) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 1253) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 803) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 935) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 1067) no Hoare annotation was computed. [2018-10-23 10:07:34,077 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 1199) no Hoare annotation was computed. [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L1162(lines 56 1163) the Hoare annotation is: (and (<= 8 main_~main__x~0) (<= (+ main_~main__y~0 main_~main__x~0) 58) (= main_~main__y~0 50)) [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L1030(lines 122 1031) the Hoare annotation is: (and (<= 69 (+ main_~main__y~0 main_~main__x~0)) (= main_~main__y~0 50) (<= (+ main_~main__x~0 31) main_~main__y~0)) [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L898(lines 188 899) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 30)) [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L766(lines 254 767) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 41)) [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L634(lines 320 635) the Hoare annotation is: (and (<= 104 (* 2 main_~main__y~0)) (<= main_~main__x~0 52) (<= main_~main__y~0 main_~main__x~0)) [2018-10-23 10:07:34,078 INFO L421 ceAbstractionStarter]: At program point L502(lines 386 503) the Hoare annotation is: (and (= main_~main__x~0 63) (<= main_~main__x~0 main_~main__y~0) (<= (+ main_~main__y~0 main_~main__x~0) 126)) [2018-10-23 10:07:34,078 INFO L425 ceAbstractionStarter]: For program point L437(lines 437 446) no Hoare annotation was computed. [2018-10-23 10:07:34,078 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 467) no Hoare annotation was computed. [2018-10-23 10:07:34,078 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 599) no Hoare annotation was computed. [2018-10-23 10:07:34,078 INFO L425 ceAbstractionStarter]: For program point L272(lines 272 731) no Hoare annotation was computed. [2018-10-23 10:07:34,079 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 863) no Hoare annotation was computed. [2018-10-23 10:07:34,079 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 995) no Hoare annotation was computed. [2018-10-23 10:07:34,079 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 1127) no Hoare annotation was computed. [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L1198(lines 38 1199) the Hoare annotation is: (and (<= (* 2 main_~main__x~0) 10) (= main_~main__y~0 50) (<= 55 (+ main_~main__y~0 main_~main__x~0))) [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L1066(lines 104 1067) the Hoare annotation is: (and (<= (* 2 main_~main__x~0) 32) (<= 16 main_~main__x~0) (= main_~main__y~0 50)) [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L934(lines 170 935) the Hoare annotation is: (and (<= (* 2 main_~main__x~0) 54) (<= 77 (+ main_~main__y~0 main_~main__x~0)) (= main_~main__y~0 50)) [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L802(lines 236 803) the Hoare annotation is: (and (<= 76 (* 2 main_~main__x~0)) (= main_~main__y~0 50) (<= (+ main_~main__x~0 12) main_~main__y~0)) [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L670(lines 302 671) the Hoare annotation is: (and (<= 99 (+ main_~main__y~0 main_~main__x~0)) (= main_~main__y~0 50) (<= (* 2 main_~main__x~0) 98)) [2018-10-23 10:07:34,079 INFO L421 ceAbstractionStarter]: At program point L538(lines 368 539) the Hoare annotation is: (and (<= main_~main__x~0 main_~main__y~0) (= main_~main__x~0 60) (<= main_~main__y~0 main_~main__x~0)) [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L374(lines 374 527) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 659) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 791) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 923) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 1055) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 1187) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L421 ceAbstractionStarter]: At program point L1234(lines 20 1235) the Hoare annotation is: (and (<= main_~main__x~0 2) (= main_~main__y~0 50) (<= 52 (+ main_~main__y~0 main_~main__x~0))) [2018-10-23 10:07:34,080 INFO L421 ceAbstractionStarter]: At program point L1102(lines 86 1103) the Hoare annotation is: (and (<= main_~main__x~0 13) (= main_~main__y~0 50) (<= 63 (+ main_~main__y~0 main_~main__x~0))) [2018-10-23 10:07:34,080 INFO L425 ceAbstractionStarter]: For program point L12(lines 12 1252) no Hoare annotation was computed. [2018-10-23 10:07:34,080 INFO L421 ceAbstractionStarter]: At program point L970(lines 152 971) the Hoare annotation is: (and (= main_~main__x~0 24) (= main_~main__y~0 50)) [2018-10-23 10:07:34,081 INFO L421 ceAbstractionStarter]: At program point L838(lines 218 839) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 35)) [2018-10-23 10:07:34,081 INFO L421 ceAbstractionStarter]: At program point L706(lines 284 707) the Hoare annotation is: (and (= main_~main__y~0 50) (<= main_~main__x~0 46) (<= 92 (* 2 main_~main__x~0))) [2018-10-23 10:07:34,081 INFO L421 ceAbstractionStarter]: At program point L574(lines 350 575) the Hoare annotation is: (and (<= main_~main__y~0 main_~main__x~0) (<= 114 (+ main_~main__y~0 main_~main__x~0)) (<= (* 2 main_~main__x~0) 114)) [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 455) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L344(lines 344 587) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 719) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 851) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 983) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 1115) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L425 ceAbstractionStarter]: For program point L14(lines 14 1247) no Hoare annotation was computed. [2018-10-23 10:07:34,081 INFO L421 ceAbstractionStarter]: At program point L1138(lines 68 1139) the Hoare annotation is: (let ((.cse0 (+ main_~main__y~0 main_~main__x~0))) (and (<= 60 .cse0) (= main_~main__y~0 50) (<= .cse0 60))) [2018-10-23 10:07:34,081 INFO L421 ceAbstractionStarter]: At program point L1006(lines 134 1007) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 21)) [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L874(lines 200 875) the Hoare annotation is: (and (<= 82 (+ main_~main__y~0 main_~main__x~0)) (<= (* 2 main_~main__x~0) 64) (= main_~main__y~0 50)) [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L742(lines 266 743) the Hoare annotation is: (and (<= (* 2 main_~main__x~0) 86) (= main_~main__y~0 50) (<= 43 main_~main__x~0)) [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L610(lines 332 611) the Hoare annotation is: (and (<= 108 (+ main_~main__y~0 main_~main__x~0)) (<= main_~main__y~0 main_~main__x~0) (<= main_~main__x~0 54)) [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L478(lines 398 479) the Hoare annotation is: (and (<= main_~main__y~0 main_~main__x~0) (<= 130 (* 2 main_~main__y~0)) (<= main_~main__x~0 65)) [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 515) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 647) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 779) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 911) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 1043) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 1175) no Hoare annotation was computed. [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L1174(lines 50 1175) the Hoare annotation is: (let ((.cse0 (+ main_~main__x~0 43))) (and (<= main_~main__y~0 .cse0) (<= .cse0 main_~main__y~0) (= main_~main__y~0 50))) [2018-10-23 10:07:34,082 INFO L421 ceAbstractionStarter]: At program point L1042(lines 116 1043) the Hoare annotation is: (and (<= 18 main_~main__x~0) (= main_~main__y~0 50) (<= (* 2 main_~main__x~0) 36)) [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L910(lines 182 911) the Hoare annotation is: (and (<= main_~main__x~0 29) (= main_~main__y~0 50) (<= 29 main_~main__x~0)) [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L778(lines 248 779) the Hoare annotation is: (and (= main_~main__x~0 40) (= main_~main__y~0 50)) [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L646(lines 314 647) the Hoare annotation is: (and (<= main_~main__x~0 51) (<= 102 (+ main_~main__y~0 main_~main__x~0)) (<= (* 2 main_~main__y~0) 102)) [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L514(lines 380 515) the Hoare annotation is: (and (= main_~main__y~0 62) (<= main_~main__y~0 main_~main__x~0) (<= main_~main__x~0 62)) [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 575) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 707) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 839) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 971) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 1103) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L20(lines 20 1235) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 428) no Hoare annotation was computed. [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L1210(lines 32 1211) the Hoare annotation is: (and (<= (+ main_~main__y~0 main_~main__x~0) 54) (= main_~main__y~0 50) (<= 8 (* 2 main_~main__x~0))) [2018-10-23 10:07:34,083 INFO L421 ceAbstractionStarter]: At program point L1078(lines 98 1079) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 15)) [2018-10-23 10:07:34,084 INFO L421 ceAbstractionStarter]: At program point L946(lines 164 947) the Hoare annotation is: (and (<= (* 2 main_~main__x~0) 52) (<= 26 main_~main__x~0) (= main_~main__y~0 50)) [2018-10-23 10:07:34,084 INFO L421 ceAbstractionStarter]: At program point L814(lines 230 815) the Hoare annotation is: (and (<= (+ main_~main__y~0 main_~main__x~0) 87) (<= 37 main_~main__x~0) (= main_~main__y~0 50)) [2018-10-23 10:07:34,084 INFO L421 ceAbstractionStarter]: At program point L682(lines 296 683) the Hoare annotation is: (and (<= main_~main__x~0 48) (<= 96 (* 2 main_~main__x~0)) (= main_~main__y~0 50)) [2018-10-23 10:07:34,084 INFO L421 ceAbstractionStarter]: At program point L550(lines 362 551) the Hoare annotation is: (let ((.cse0 (* 2 main_~main__y~0))) (and (<= 118 .cse0) (= main_~main__x~0 59) (<= .cse0 118))) [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 503) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 635) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 767) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L188(lines 188 899) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 1031) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 1163) no Hoare annotation was computed. [2018-10-23 10:07:34,084 INFO L421 ceAbstractionStarter]: At program point L1246(lines 14 1247) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 1)) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L1114(lines 80 1115) the Hoare annotation is: (and (<= main_~main__y~0 (+ main_~main__x~0 38)) (<= (* 2 main_~main__x~0) 24) (= main_~main__y~0 50)) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L982(lines 146 983) the Hoare annotation is: (and (<= main_~main__y~0 (+ main_~main__x~0 27)) (= main_~main__y~0 50) (<= (+ main_~main__y~0 main_~main__x~0) 73)) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L850(lines 212 851) the Hoare annotation is: (let ((.cse0 (+ main_~main__y~0 main_~main__x~0))) (and (<= 84 .cse0) (<= .cse0 84) (= main_~main__y~0 50))) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L718(lines 278 719) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 45)) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L586(lines 344 587) the Hoare annotation is: (let ((.cse0 (+ main_~main__y~0 main_~main__x~0))) (and (= main_~main__x~0 56) (<= 112 .cse0) (<= .cse0 112))) [2018-10-23 10:07:34,085 INFO L421 ceAbstractionStarter]: At program point L454(lines 410 455) the Hoare annotation is: (and (<= main_~main__x~0 main_~main__y~0) (<= 134 (+ main_~main__y~0 main_~main__x~0)) (<= main_~main__y~0 main_~main__x~0) (<= (* 2 main_~main__x~0) 200)) [2018-10-23 10:07:34,085 INFO L425 ceAbstractionStarter]: For program point L356(lines 356 563) no Hoare annotation was computed. [2018-10-23 10:07:34,085 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 695) no Hoare annotation was computed. [2018-10-23 10:07:34,085 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 827) no Hoare annotation was computed. [2018-10-23 10:07:34,085 INFO L425 ceAbstractionStarter]: For program point L158(lines 158 959) no Hoare annotation was computed. [2018-10-23 10:07:34,086 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 1091) no Hoare annotation was computed. [2018-10-23 10:07:34,086 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 1223) no Hoare annotation was computed. [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L1150(lines 62 1151) the Hoare annotation is: (and (<= (+ main_~main__y~0 main_~main__x~0) 59) (<= 18 (* 2 main_~main__x~0)) (= main_~main__y~0 50)) [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L1018(lines 128 1019) the Hoare annotation is: (and (= main_~main__x~0 20) (= main_~main__y~0 50)) [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L886(lines 194 887) the Hoare annotation is: (and (<= main_~main__y~0 (+ main_~main__x~0 19)) (<= (* 2 main_~main__x~0) 62) (= main_~main__y~0 50)) [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L754(lines 260 755) the Hoare annotation is: (and (= main_~main__y~0 50) (= main_~main__x~0 42)) [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L622(lines 326 623) the Hoare annotation is: (and (<= main_~main__y~0 main_~main__x~0) (<= 106 (+ main_~main__y~0 main_~main__x~0)) (<= (* 2 main_~main__x~0) 106)) [2018-10-23 10:07:34,086 INFO L421 ceAbstractionStarter]: At program point L490(lines 392 491) the Hoare annotation is: (and (= main_~main__y~0 64) (<= main_~main__y~0 main_~main__x~0) (<= (* 2 main_~main__x~0) 128)) [2018-10-23 10:07:34,086 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 491) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 623) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 755) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 887) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L425 ceAbstractionStarter]: For program point L128(lines 128 1019) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 1151) no Hoare annotation was computed. [2018-10-23 10:07:34,087 INFO L421 ceAbstractionStarter]: At program point L1186(lines 44 1187) the Hoare annotation is: (and (<= 12 (* 2 main_~main__x~0)) (<= main_~main__x~0 6) (= main_~main__y~0 50)) [2018-10-23 10:07:34,087 INFO L421 ceAbstractionStarter]: At program point L1054(lines 110 1055) the Hoare annotation is: (and (= main_~main__y~0 50) (<= (+ main_~main__y~0 main_~main__x~0) 67) (<= main_~main__y~0 (+ main_~main__x~0 33))) [2018-10-23 10:07:34,087 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 1253) the Hoare annotation is: true [2018-10-23 10:07:34,087 INFO L421 ceAbstractionStarter]: At program point L922(lines 176 923) the Hoare annotation is: (and (<= 56 (* 2 main_~main__x~0)) (= main_~main__y~0 50) (<= (+ main_~main__x~0 22) main_~main__y~0)) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L790(lines 242 791) the Hoare annotation is: (and (= main_~main__x~0 39) (= main_~main__y~0 50)) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L658(lines 308 659) the Hoare annotation is: (and (= main_~main__y~0 50) (<= (+ main_~main__y~0 main_~main__x~0) 100) (<= 50 main_~main__x~0)) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L526(lines 374 527) the Hoare annotation is: (and (= main_~main__x~0 61) (= main_~main__y~0 61)) [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 551) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 683) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 815) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 947) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 1079) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L425 ceAbstractionStarter]: For program point L32(lines 32 1211) no Hoare annotation was computed. [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L1222(lines 26 1223) the Hoare annotation is: (and (= main_~main__x~0 3) (= main_~main__y~0 50)) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L1090(lines 92 1091) the Hoare annotation is: (let ((.cse0 (+ main_~main__x~0 36))) (and (<= .cse0 main_~main__y~0) (<= main_~main__y~0 .cse0) (= main_~main__y~0 50))) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L958(lines 158 959) the Hoare annotation is: (and (= main_~main__x~0 25) (= main_~main__y~0 50)) [2018-10-23 10:07:34,088 INFO L421 ceAbstractionStarter]: At program point L826(lines 224 827) the Hoare annotation is: (and (= main_~main__y~0 50) (<= 86 (+ main_~main__y~0 main_~main__x~0)) (<= (* 2 main_~main__x~0) 72)) [2018-10-23 10:07:34,089 INFO L421 ceAbstractionStarter]: At program point L694(lines 290 695) the Hoare annotation is: (and (= main_~main__x~0 47) (= main_~main__y~0 50)) [2018-10-23 10:07:34,089 INFO L421 ceAbstractionStarter]: At program point L562(lines 356 563) the Hoare annotation is: (and (<= main_~main__y~0 main_~main__x~0) (<= 116 (* 2 main_~main__y~0)) (<= (* 2 main_~main__x~0) 116)) [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 479) no Hoare annotation was computed. [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 611) no Hoare annotation was computed. [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 743) no Hoare annotation was computed. [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 875) no Hoare annotation was computed. [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 1007) no Hoare annotation was computed. [2018-10-23 10:07:34,089 INFO L425 ceAbstractionStarter]: For program point L68(lines 68 1139) no Hoare annotation was computed. [2018-10-23 10:07:34,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:07:34 BoogieIcfgContainer [2018-10-23 10:07:34,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 10:07:34,120 INFO L168 Benchmark]: Toolchain (without parser) took 114252.16 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-23 10:07:34,121 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:07:34,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-23 10:07:34,123 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:07:34,123 INFO L168 Benchmark]: Boogie Preprocessor took 62.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-23 10:07:34,124 INFO L168 Benchmark]: RCFGBuilder took 1549.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -711.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-10-23 10:07:34,125 INFO L168 Benchmark]: TraceAbstraction took 112030.79 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 473.4 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -345.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-23 10:07:34,129 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 576.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 27.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1549.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 711.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -711.4 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112030.79 ms. Allocated memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: 473.4 MB). Free memory was 2.1 GB in the beginning and 2.4 GB in the end (delta: -345.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 439]: 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: 56]: Loop Invariant Derived loop invariant: (8 <= main__x && main__y + main__x <= 58) && main__y == 50 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: main__x == 40 && main__y == 50 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 1 - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: (66 <= 2 * main__x && main__y == 50) && main__x + 17 <= main__y - InvariantResult [Line: 374]: Loop Invariant Derived loop invariant: main__x == 61 && main__y == 61 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: (2 * main__x <= 52 && 26 <= main__x) && main__y == 50 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: (69 <= main__y + main__x && main__y == 50) && main__x + 31 <= main__y - InvariantResult [Line: 314]: Loop Invariant Derived loop invariant: (main__x <= 51 && 102 <= main__y + main__x) && 2 * main__y <= 102 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (main__y <= main__x + 38 && 2 * main__x <= 24) && main__y == 50 - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: (44 <= main__x && 2 * main__x <= 88) && main__y == 50 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (2 * main__x <= 10 && main__y == 50) && 55 <= main__y + main__x - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (main__y + main__x <= 87 && 37 <= main__x) && main__y == 50 - InvariantResult [Line: 350]: Loop Invariant Derived loop invariant: (main__y <= main__x && 114 <= main__y + main__x) && 2 * main__x <= 114 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 30 - InvariantResult [Line: 392]: Loop Invariant Derived loop invariant: (main__y == 64 && main__y <= main__x) && 2 * main__x <= 128 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (main__y <= main__x + 27 && main__y == 50) && main__y + main__x <= 73 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: (110 <= main__y + main__x && main__x == 55) && main__y + main__x <= 110 - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (2 * main__x <= 32 && 16 <= main__x) && main__y == 50 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (main__x <= 48 && 96 <= 2 * main__x) && main__y == 50 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: (main__y + main__x <= 59 && 18 <= 2 * main__x) && main__y == 50 - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 41 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (main__x <= 2 && main__y == 50) && 52 <= main__y + main__x - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (84 <= main__y + main__x && main__y + main__x <= 84) && main__y == 50 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (main__x <= main__y && main__x == 60) && main__y <= main__x - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (2 * main__x <= 54 && 77 <= main__y + main__x) && main__y == 50 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((main__x <= main__y && 134 <= main__y + main__x) && main__y <= main__x) && 2 * main__x <= 200 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: main__x == 20 && main__y == 50 - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (104 <= 2 * main__y && main__x <= 52) && main__y <= main__x - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (main__x <= 13 && main__y == 50) && 63 <= main__y + main__x - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 45 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (12 <= 2 * main__x && main__x <= 6) && main__y == 50 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: (76 <= 2 * main__x && main__y == 50) && main__x + 12 <= main__y - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (main__x == 56 && 112 <= main__y + main__x) && main__y + main__x <= 112 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (main__y <= main__x + 19 && 2 * main__x <= 62) && main__y == 50 - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: (main__x == 63 && main__x <= main__y) && main__y + main__x <= 126 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: main__x == 24 && main__y == 50 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (main__y == 50 && main__y + main__x <= 67) && main__y <= main__x + 33 - InvariantResult [Line: 302]: Loop Invariant Derived loop invariant: (99 <= main__y + main__x && main__y == 50) && 2 * main__x <= 98 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (60 <= main__y + main__x && main__y == 50) && main__y + main__x <= 60 - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 42 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x == 3 && main__y == 50 - InvariantResult [Line: 218]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 35 - InvariantResult [Line: 362]: Loop Invariant Derived loop invariant: (118 <= 2 * main__y && main__x == 59) && 2 * main__y <= 118 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (56 <= 2 * main__x && main__y == 50) && main__x + 22 <= main__y - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((2 * main__x <= 132 && 2 * main__y <= 132) && 132 <= 2 * main__y) && 132 <= 2 * main__x - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 21 - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: (main__y <= main__x && 106 <= main__y + main__x) && 2 * main__x <= 106 - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: (main__x + 36 <= main__y && main__y <= main__x + 36) && main__y == 50 - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: (main__y == 50 && main__x <= 46) && 92 <= 2 * main__x - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (main__y <= main__x + 43 && main__x + 43 <= main__y) && main__y == 50 - InvariantResult [Line: 242]: Loop Invariant Derived loop invariant: main__x == 39 && main__y == 50 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (82 <= main__y + main__x && 2 * main__x <= 64) && main__y == 50 - InvariantResult [Line: 380]: Loop Invariant Derived loop invariant: (main__y == 62 && main__y <= main__x) && main__x <= 62 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: main__x == 25 && main__y == 50 - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (18 <= main__x && main__y == 50) && 2 * main__x <= 36 - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: (main__y == 50 && main__y + main__x <= 100) && 50 <= main__x - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (61 <= main__y + main__x && main__y == 50) && main__x + 39 <= main__y - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: (2 * main__x <= 86 && main__y == 50) && 43 <= main__x - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (main__y + main__x <= 54 && main__y == 50) && 8 <= 2 * main__x - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: (main__y == 50 && 86 <= main__y + main__x) && 2 * main__x <= 72 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (main__y <= main__x && 116 <= 2 * main__y) && 2 * main__x <= 116 - InvariantResult [Line: 182]: Loop Invariant Derived loop invariant: (main__x <= 29 && main__y == 50) && 29 <= main__x - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (main__y <= main__x && 130 <= 2 * main__y) && main__x <= 65 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (72 <= main__y + main__x && main__x <= 22) && main__y == 50 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: (108 <= main__y + main__x && main__y <= main__x) && main__x <= 54 - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: main__y == 50 && main__x == 15 - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: main__x == 47 && main__y == 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 1 error locations. SAFE Result, 111.9s OverallTime, 30 OverallIterations, 3 TraceHistogramMax, 78.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3628 SDtfs, 3332 SDslu, 3741 SDs, 0 SdLazy, 77552 SolverSat, 3431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 969 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 833 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9932432432432432 AbsIntWeakeningRatio, 0.04054054054054054 AbsIntAvgWeakeningVarsNumRemoved, 66.10810810810811 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 141 NumberOfFragments, 790 HoareAnnotationTreeSize, 71 FomulaSimplifications, 100 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 2929 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 4300 NumberOfCodeBlocks, 4300 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 4270 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 29 PerfectInterpolantSequences, 4/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...