java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:06:34,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:06:34,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:06:34,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:06:34,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:06:34,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:06:34,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:06:34,913 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:06:34,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:06:34,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:06:34,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:06:34,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:06:34,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:06:34,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:06:34,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:06:34,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:06:34,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:06:34,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:06:34,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:06:34,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:06:34,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:06:34,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:06:34,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:06:34,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:06:34,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:06:34,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:06:34,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:06:34,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:06:34,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:06:34,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:06:34,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:06:34,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:06:34,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:06:34,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:06:34,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:06:34,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:06:34,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:06:34,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:06:34,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:06:34,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:06:34,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:06:34,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 07:06:34,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:06:34,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:06:34,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:06:34,961 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:06:34,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:06:34,962 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:06:34,962 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:06:34,963 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:06:34,963 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:06:34,963 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:06:34,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:06:34,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:06:34,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:06:34,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:06:34,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:06:34,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:06:34,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:06:34,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:06:34,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:06:34,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:06:34,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:06:34,968 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:06:34,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:06:34,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:06:34,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:06:34,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:06:34,969 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:06:34,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:06:34,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:06:34,970 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:06:35,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:06:35,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:06:35,019 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:06:35,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:06:35,021 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:06:35,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:06:35,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d6b528f/5f590e5c35544de5a8fccef5bbbc70f2/FLAGc7c4defb6 [2019-09-10 07:06:35,525 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:06:35,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:06:35,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d6b528f/5f590e5c35544de5a8fccef5bbbc70f2/FLAGc7c4defb6 [2019-09-10 07:06:35,894 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d6b528f/5f590e5c35544de5a8fccef5bbbc70f2 [2019-09-10 07:06:35,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:06:35,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:06:35,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:35,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:06:35,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:06:35,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:35" (1/1) ... [2019-09-10 07:06:35,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:35, skipping insertion in model container [2019-09-10 07:06:35,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:06:35" (1/1) ... [2019-09-10 07:06:35,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:06:35,967 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:06:36,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:36,370 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:06:36,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:06:36,469 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:06:36,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36 WrapperNode [2019-09-10 07:06:36,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:06:36,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:06:36,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:06:36,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:06:36,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... [2019-09-10 07:06:36,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:06:36,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:06:36,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:06:36,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:06:36,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:06:36,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:06:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:06:36,591 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:06:36,592 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:06:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:06:36,593 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:06:36,594 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:06:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:06:36,595 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:06:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:06:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:06:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:06:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:06:36,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:06:36,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:06:37,397 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:06:37,398 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:06:37,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:06:37 BoogieIcfgContainer [2019-09-10 07:06:37,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:06:37,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:06:37,403 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:06:37,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:06:37,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:06:35" (1/3) ... [2019-09-10 07:06:37,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c10d64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:06:37, skipping insertion in model container [2019-09-10 07:06:37,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:06:36" (2/3) ... [2019-09-10 07:06:37,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c10d64b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:06:37, skipping insertion in model container [2019-09-10 07:06:37,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:06:37" (3/3) ... [2019-09-10 07:06:37,416 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:06:37,427 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:06:37,449 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:06:37,468 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:06:37,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:06:37,507 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:06:37,507 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:06:37,507 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:06:37,508 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:06:37,508 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:06:37,508 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:06:37,508 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:06:37,539 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-10 07:06:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-10 07:06:37,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:37,556 INFO L399 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] [2019-09-10 07:06:37,558 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:37,565 INFO L82 PathProgramCache]: Analyzing trace with hash -34788824, now seen corresponding path program 1 times [2019-09-10 07:06:37,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:37,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:37,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:37,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:37,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:38,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:38,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:38,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:38,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,087 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-10 07:06:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:38,192 INFO L93 Difference]: Finished difference Result 231 states and 369 transitions. [2019-09-10 07:06:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:38,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-10 07:06:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:38,214 INFO L225 Difference]: With dead ends: 231 [2019-09-10 07:06:38,214 INFO L226 Difference]: Without dead ends: 223 [2019-09-10 07:06:38,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-10 07:06:38,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-10 07:06:38,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-10 07:06:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2019-09-10 07:06:38,300 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 65 [2019-09-10 07:06:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:38,301 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2019-09-10 07:06:38,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2019-09-10 07:06:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-10 07:06:38,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:38,305 INFO L399 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] [2019-09-10 07:06:38,305 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1987070288, now seen corresponding path program 1 times [2019-09-10 07:06:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:38,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:38,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:38,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:38,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:38,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,440 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand 3 states. [2019-09-10 07:06:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:38,482 INFO L93 Difference]: Finished difference Result 371 states and 565 transitions. [2019-09-10 07:06:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:38,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-10 07:06:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:38,486 INFO L225 Difference]: With dead ends: 371 [2019-09-10 07:06:38,486 INFO L226 Difference]: Without dead ends: 371 [2019-09-10 07:06:38,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-10 07:06:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-10 07:06:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-10 07:06:38,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2019-09-10 07:06:38,513 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 66 [2019-09-10 07:06:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:38,513 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2019-09-10 07:06:38,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2019-09-10 07:06:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 07:06:38,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:38,516 INFO L399 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] [2019-09-10 07:06:38,517 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 612521917, now seen corresponding path program 1 times [2019-09-10 07:06:38,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:38,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:38,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:38,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:38,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:38,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:38,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,679 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2019-09-10 07:06:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:38,717 INFO L93 Difference]: Finished difference Result 635 states and 981 transitions. [2019-09-10 07:06:38,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:38,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-10 07:06:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:38,723 INFO L225 Difference]: With dead ends: 635 [2019-09-10 07:06:38,724 INFO L226 Difference]: Without dead ends: 635 [2019-09-10 07:06:38,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-10 07:06:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-10 07:06:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-10 07:06:38,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2019-09-10 07:06:38,750 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 67 [2019-09-10 07:06:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:38,751 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2019-09-10 07:06:38,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2019-09-10 07:06:38,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 07:06:38,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:38,754 INFO L399 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] [2019-09-10 07:06:38,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1025177521, now seen corresponding path program 1 times [2019-09-10 07:06:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:38,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:38,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:38,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:38,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:38,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,859 INFO L87 Difference]: Start difference. First operand 633 states and 980 transitions. Second operand 3 states. [2019-09-10 07:06:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:38,884 INFO L93 Difference]: Finished difference Result 1099 states and 1705 transitions. [2019-09-10 07:06:38,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:38,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-10 07:06:38,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:38,893 INFO L225 Difference]: With dead ends: 1099 [2019-09-10 07:06:38,893 INFO L226 Difference]: Without dead ends: 1099 [2019-09-10 07:06:38,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-10 07:06:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2019-09-10 07:06:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-09-10 07:06:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1704 transitions. [2019-09-10 07:06:38,924 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1704 transitions. Word has length 68 [2019-09-10 07:06:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:38,925 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1704 transitions. [2019-09-10 07:06:38,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1704 transitions. [2019-09-10 07:06:38,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-10 07:06:38,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:38,933 INFO L399 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] [2019-09-10 07:06:38,934 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:38,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:38,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880858, now seen corresponding path program 1 times [2019-09-10 07:06:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:38,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:38,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:38,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:39,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:39,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:39,216 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:39,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:39,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:39,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:39,218 INFO L87 Difference]: Start difference. First operand 1097 states and 1704 transitions. Second operand 7 states. [2019-09-10 07:06:39,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:39,437 INFO L93 Difference]: Finished difference Result 4609 states and 7164 transitions. [2019-09-10 07:06:39,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:06:39,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-10 07:06:39,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:39,461 INFO L225 Difference]: With dead ends: 4609 [2019-09-10 07:06:39,462 INFO L226 Difference]: Without dead ends: 4609 [2019-09-10 07:06:39,462 INFO L628 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 [2019-09-10 07:06:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-09-10 07:06:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4601. [2019-09-10 07:06:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2019-09-10 07:06:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7160 transitions. [2019-09-10 07:06:39,570 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7160 transitions. Word has length 69 [2019-09-10 07:06:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:39,570 INFO L475 AbstractCegarLoop]: Abstraction has 4601 states and 7160 transitions. [2019-09-10 07:06:39,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7160 transitions. [2019-09-10 07:06:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-10 07:06:39,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:39,573 INFO L399 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] [2019-09-10 07:06:39,573 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1707189843, now seen corresponding path program 1 times [2019-09-10 07:06:39,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:39,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:39,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:39,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:39,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:39,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:39,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:39,639 INFO L87 Difference]: Start difference. First operand 4601 states and 7160 transitions. Second operand 3 states. [2019-09-10 07:06:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:39,697 INFO L93 Difference]: Finished difference Result 7803 states and 12009 transitions. [2019-09-10 07:06:39,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:39,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-10 07:06:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:39,735 INFO L225 Difference]: With dead ends: 7803 [2019-09-10 07:06:39,735 INFO L226 Difference]: Without dead ends: 7803 [2019-09-10 07:06:39,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:39,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2019-09-10 07:06:39,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7801. [2019-09-10 07:06:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7801 states. [2019-09-10 07:06:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12008 transitions. [2019-09-10 07:06:39,970 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12008 transitions. Word has length 70 [2019-09-10 07:06:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:39,973 INFO L475 AbstractCegarLoop]: Abstraction has 7801 states and 12008 transitions. [2019-09-10 07:06:39,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12008 transitions. [2019-09-10 07:06:39,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:06:39,985 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:39,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:39,986 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:39,986 INFO L82 PathProgramCache]: Analyzing trace with hash -453623555, now seen corresponding path program 1 times [2019-09-10 07:06:39,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:39,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:40,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:40,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:40,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:40,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:40,102 INFO L87 Difference]: Start difference. First operand 7801 states and 12008 transitions. Second operand 5 states. [2019-09-10 07:06:40,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:40,402 INFO L93 Difference]: Finished difference Result 15563 states and 23833 transitions. [2019-09-10 07:06:40,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:06:40,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-10 07:06:40,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:40,475 INFO L225 Difference]: With dead ends: 15563 [2019-09-10 07:06:40,476 INFO L226 Difference]: Without dead ends: 15563 [2019-09-10 07:06:40,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-09-10 07:06:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15561. [2019-09-10 07:06:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15561 states. [2019-09-10 07:06:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15561 states to 15561 states and 23832 transitions. [2019-09-10 07:06:40,884 INFO L78 Accepts]: Start accepts. Automaton has 15561 states and 23832 transitions. Word has length 71 [2019-09-10 07:06:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:40,885 INFO L475 AbstractCegarLoop]: Abstraction has 15561 states and 23832 transitions. [2019-09-10 07:06:40,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 15561 states and 23832 transitions. [2019-09-10 07:06:40,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 07:06:40,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:40,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:40,886 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:40,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:40,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1163881336, now seen corresponding path program 1 times [2019-09-10 07:06:40,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:40,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:40,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:40,889 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 07:06:41,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:41,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 07:06:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 07:06:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:06:41,080 INFO L87 Difference]: Start difference. First operand 15561 states and 23832 transitions. Second operand 7 states. [2019-09-10 07:06:42,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:42,051 INFO L93 Difference]: Finished difference Result 64051 states and 97613 transitions. [2019-09-10 07:06:42,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 07:06:42,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-10 07:06:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:42,189 INFO L225 Difference]: With dead ends: 64051 [2019-09-10 07:06:42,189 INFO L226 Difference]: Without dead ends: 64051 [2019-09-10 07:06:42,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-10 07:06:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64051 states. [2019-09-10 07:06:43,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64051 to 31081. [2019-09-10 07:06:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31081 states. [2019-09-10 07:06:43,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31081 states to 31081 states and 46984 transitions. [2019-09-10 07:06:43,083 INFO L78 Accepts]: Start accepts. Automaton has 31081 states and 46984 transitions. Word has length 71 [2019-09-10 07:06:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:43,083 INFO L475 AbstractCegarLoop]: Abstraction has 31081 states and 46984 transitions. [2019-09-10 07:06:43,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 07:06:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 31081 states and 46984 transitions. [2019-09-10 07:06:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-10 07:06:43,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:43,085 INFO L399 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] [2019-09-10 07:06:43,085 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:43,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:43,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1702050330, now seen corresponding path program 1 times [2019-09-10 07:06:43,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:43,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:43,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:43,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:43,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:43,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:06:43,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:43,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:06:43,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:06:43,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:06:43,190 INFO L87 Difference]: Start difference. First operand 31081 states and 46984 transitions. Second operand 5 states. [2019-09-10 07:06:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:43,585 INFO L93 Difference]: Finished difference Result 63401 states and 94568 transitions. [2019-09-10 07:06:43,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:06:43,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-10 07:06:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:43,683 INFO L225 Difference]: With dead ends: 63401 [2019-09-10 07:06:43,683 INFO L226 Difference]: Without dead ends: 63401 [2019-09-10 07:06:43,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:06:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63401 states. [2019-09-10 07:06:44,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63401 to 32361. [2019-09-10 07:06:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32361 states. [2019-09-10 07:06:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32361 states to 32361 states and 48264 transitions. [2019-09-10 07:06:44,626 INFO L78 Accepts]: Start accepts. Automaton has 32361 states and 48264 transitions. Word has length 72 [2019-09-10 07:06:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:44,627 INFO L475 AbstractCegarLoop]: Abstraction has 32361 states and 48264 transitions. [2019-09-10 07:06:44,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:06:44,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32361 states and 48264 transitions. [2019-09-10 07:06:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-10 07:06:44,628 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:44,628 INFO L399 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] [2019-09-10 07:06:44,629 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1233572455, now seen corresponding path program 1 times [2019-09-10 07:06:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:44,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:44,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:44,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:44,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:44,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:44,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:44,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:44,704 INFO L87 Difference]: Start difference. First operand 32361 states and 48264 transitions. Second operand 3 states. [2019-09-10 07:06:44,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:44,834 INFO L93 Difference]: Finished difference Result 39965 states and 59115 transitions. [2019-09-10 07:06:44,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:44,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-10 07:06:44,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:44,888 INFO L225 Difference]: With dead ends: 39965 [2019-09-10 07:06:44,888 INFO L226 Difference]: Without dead ends: 39965 [2019-09-10 07:06:44,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39965 states. [2019-09-10 07:06:46,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39965 to 39819. [2019-09-10 07:06:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39819 states. [2019-09-10 07:06:46,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39819 states to 39819 states and 58970 transitions. [2019-09-10 07:06:46,125 INFO L78 Accepts]: Start accepts. Automaton has 39819 states and 58970 transitions. Word has length 73 [2019-09-10 07:06:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:46,126 INFO L475 AbstractCegarLoop]: Abstraction has 39819 states and 58970 transitions. [2019-09-10 07:06:46,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 39819 states and 58970 transitions. [2019-09-10 07:06:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:06:46,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:46,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:46,144 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:46,144 INFO L82 PathProgramCache]: Analyzing trace with hash -959843441, now seen corresponding path program 1 times [2019-09-10 07:06:46,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:46,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:46,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:46,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:06:46,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:06:46,226 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:06:46,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:06:46,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:06:46,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:46,228 INFO L87 Difference]: Start difference. First operand 39819 states and 58970 transitions. Second operand 3 states. [2019-09-10 07:06:46,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:46,457 INFO L93 Difference]: Finished difference Result 69262 states and 101869 transitions. [2019-09-10 07:06:46,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:06:46,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:06:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:06:46,578 INFO L225 Difference]: With dead ends: 69262 [2019-09-10 07:06:46,579 INFO L226 Difference]: Without dead ends: 69262 [2019-09-10 07:06:46,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:06:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69262 states. [2019-09-10 07:06:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69262 to 69260. [2019-09-10 07:06:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69260 states. [2019-09-10 07:06:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69260 states to 69260 states and 101868 transitions. [2019-09-10 07:06:47,582 INFO L78 Accepts]: Start accepts. Automaton has 69260 states and 101868 transitions. Word has length 100 [2019-09-10 07:06:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:06:47,582 INFO L475 AbstractCegarLoop]: Abstraction has 69260 states and 101868 transitions. [2019-09-10 07:06:47,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:06:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69260 states and 101868 transitions. [2019-09-10 07:06:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:06:47,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:06:47,627 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:06:47,627 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:06:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1995645960, now seen corresponding path program 1 times [2019-09-10 07:06:47,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:06:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:47,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:47,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:06:47,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:06:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:06:47,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:06:47,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:06:47,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:06:47,902 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [104], [109], [120], [122], [125], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [202], [207], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [432], [434], [436], [439], [442], [445], [447], [449], [512], [513], [517], [518], [519] [2019-09-10 07:06:47,951 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:06:47,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:06:48,160 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:06:49,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:06:49,887 INFO L272 AbstractInterpreter]: Visited 92 different actions 502 times. Merged at 53 different actions 355 times. Widened at 14 different actions 38 times. Performed 1614 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1614 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 57 fixpoints after 15 different actions. Largest state had 142 variables. [2019-09-10 07:06:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:06:49,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:06:49,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:06:49,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:06:49,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:06:49,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:06:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:06:50,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:06:50,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:06:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:06:50,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:06:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:06:50,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:06:50,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:06:50,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:06:50,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:06:50,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:06:50,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:06:50,397 INFO L87 Difference]: Start difference. First operand 69260 states and 101868 transitions. Second operand 12 states. [2019-09-10 07:06:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:06:59,533 INFO L93 Difference]: Finished difference Result 454082 states and 651867 transitions. [2019-09-10 07:06:59,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-10 07:06:59,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-10 07:06:59,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:00,470 INFO L225 Difference]: With dead ends: 454082 [2019-09-10 07:07:00,470 INFO L226 Difference]: Without dead ends: 454082 [2019-09-10 07:07:00,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1459, Invalid=6197, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 07:07:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454082 states. [2019-09-10 07:07:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454082 to 184868. [2019-09-10 07:07:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184868 states. [2019-09-10 07:07:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184868 states to 184868 states and 268192 transitions. [2019-09-10 07:07:07,770 INFO L78 Accepts]: Start accepts. Automaton has 184868 states and 268192 transitions. Word has length 100 [2019-09-10 07:07:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:07,770 INFO L475 AbstractCegarLoop]: Abstraction has 184868 states and 268192 transitions. [2019-09-10 07:07:07,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:07:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 184868 states and 268192 transitions. [2019-09-10 07:07:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:07:07,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:07,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:07,805 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:07,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1839484968, now seen corresponding path program 1 times [2019-09-10 07:07:07,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:07,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:07,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:07,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:07,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 07:07:07,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:07:07,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:07:07,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:07,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:07:07,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:07:07,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:07:07,910 INFO L87 Difference]: Start difference. First operand 184868 states and 268192 transitions. Second operand 6 states. [2019-09-10 07:07:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:07:13,086 INFO L93 Difference]: Finished difference Result 526632 states and 757562 transitions. [2019-09-10 07:07:13,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:07:13,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-10 07:07:13,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:07:13,947 INFO L225 Difference]: With dead ends: 526632 [2019-09-10 07:07:13,947 INFO L226 Difference]: Without dead ends: 526632 [2019-09-10 07:07:13,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:07:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526632 states. [2019-09-10 07:07:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526632 to 526628. [2019-09-10 07:07:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526628 states. [2019-09-10 07:07:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526628 states to 526628 states and 757560 transitions. [2019-09-10 07:07:24,485 INFO L78 Accepts]: Start accepts. Automaton has 526628 states and 757560 transitions. Word has length 100 [2019-09-10 07:07:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:07:24,485 INFO L475 AbstractCegarLoop]: Abstraction has 526628 states and 757560 transitions. [2019-09-10 07:07:24,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:07:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 526628 states and 757560 transitions. [2019-09-10 07:07:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:07:24,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:07:24,518 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:07:24,518 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:07:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -140781229, now seen corresponding path program 1 times [2019-09-10 07:07:24,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:07:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:07:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:07:24,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:07:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:07:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:07:24,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:07:24,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:07:24,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:07:24,630 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [128], [131], [136], [138], [141], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [326], [328], [341], [349], [368], [370], [373], [381], [384], [387], [390], [392], [394], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:07:24,634 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:07:24,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:07:24,658 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:07:24,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:07:24,774 INFO L272 AbstractInterpreter]: Visited 84 different actions 213 times. Merged at 42 different actions 108 times. Widened at 1 different actions 1 times. Performed 857 root evaluator evaluations with a maximum evaluation depth of 6. Performed 857 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:07:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:07:24,775 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:07:25,113 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.13% of their original sizes. [2019-09-10 07:07:25,113 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:07:34,914 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:07:34,914 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:07:34,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:07:34,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:07:34,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:07:34,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:07:34,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:07:34,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:07:34,917 INFO L87 Difference]: Start difference. First operand 526628 states and 757560 transitions. Second operand 50 states. [2019-09-10 07:08:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:08:54,392 INFO L93 Difference]: Finished difference Result 1270910 states and 1791486 transitions. [2019-09-10 07:08:54,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 481 states. [2019-09-10 07:08:54,392 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-09-10 07:08:54,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:08:56,206 INFO L225 Difference]: With dead ends: 1270910 [2019-09-10 07:08:56,206 INFO L226 Difference]: Without dead ends: 1270910 [2019-09-10 07:08:56,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114081 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=25186, Invalid=221326, Unknown=0, NotChecked=0, Total=246512 [2019-09-10 07:08:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270910 states. [2019-09-10 07:09:20,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270910 to 667052. [2019-09-10 07:09:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667052 states. [2019-09-10 07:09:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667052 states to 667052 states and 952017 transitions. [2019-09-10 07:09:21,612 INFO L78 Accepts]: Start accepts. Automaton has 667052 states and 952017 transitions. Word has length 100 [2019-09-10 07:09:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:09:21,612 INFO L475 AbstractCegarLoop]: Abstraction has 667052 states and 952017 transitions. [2019-09-10 07:09:21,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:09:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 667052 states and 952017 transitions. [2019-09-10 07:09:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:09:21,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:09:21,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:09:21,656 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:09:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:09:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1915515791, now seen corresponding path program 1 times [2019-09-10 07:09:21,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:09:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:09:21,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:09:21,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:09:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:09:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:09:21,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:09:21,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:09:21,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:09:21,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:09:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:09:21,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:21,726 INFO L87 Difference]: Start difference. First operand 667052 states and 952017 transitions. Second operand 3 states. [2019-09-10 07:09:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:09:32,266 INFO L93 Difference]: Finished difference Result 924285 states and 1307113 transitions. [2019-09-10 07:09:32,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:09:32,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:09:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:09:33,613 INFO L225 Difference]: With dead ends: 924285 [2019-09-10 07:09:33,614 INFO L226 Difference]: Without dead ends: 924285 [2019-09-10 07:09:33,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:09:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924285 states. [2019-09-10 07:09:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924285 to 919977. [2019-09-10 07:09:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919977 states. [2019-09-10 07:10:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919977 states to 919977 states and 1302806 transitions. [2019-09-10 07:10:05,331 INFO L78 Accepts]: Start accepts. Automaton has 919977 states and 1302806 transitions. Word has length 100 [2019-09-10 07:10:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:10:05,332 INFO L475 AbstractCegarLoop]: Abstraction has 919977 states and 1302806 transitions. [2019-09-10 07:10:05,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:10:05,332 INFO L276 IsEmpty]: Start isEmpty. Operand 919977 states and 1302806 transitions. [2019-09-10 07:10:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:10:05,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:10:05,382 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:10:05,382 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:10:05,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:05,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1021331140, now seen corresponding path program 1 times [2019-09-10 07:10:05,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:10:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:05,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:10:05,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:10:05,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:10:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:10:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:10:05,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:10:05,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:10:05,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:10:05,509 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [144], [147], [152], [154], [157], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [273], [275], [288], [296], [315], [317], [320], [328], [331], [334], [337], [339], [341], [379], [381], [394], [402], [421], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:10:05,513 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:10:05,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:10:05,533 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:10:05,624 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:10:05,625 INFO L272 AbstractInterpreter]: Visited 84 different actions 246 times. Merged at 42 different actions 135 times. Widened at 4 different actions 7 times. Performed 913 root evaluator evaluations with a maximum evaluation depth of 6. Performed 913 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 14 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:10:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:10:05,625 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:10:05,778 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.21% of their original sizes. [2019-09-10 07:10:05,779 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:10:10,651 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:10:10,652 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:10:10,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:10:10,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:10:10,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:10:10,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:10:10,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:10:10,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2161, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:10:10,653 INFO L87 Difference]: Start difference. First operand 919977 states and 1302806 transitions. Second operand 50 states. [2019-09-10 07:12:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:12:13,564 INFO L93 Difference]: Finished difference Result 2046025 states and 2855400 transitions. [2019-09-10 07:12:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 507 states. [2019-09-10 07:12:13,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2019-09-10 07:12:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:12:17,970 INFO L225 Difference]: With dead ends: 2046025 [2019-09-10 07:12:17,970 INFO L226 Difference]: Without dead ends: 2046025 [2019-09-10 07:12:17,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125369 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=25813, Invalid=246149, Unknown=0, NotChecked=0, Total=271962 [2019-09-10 07:12:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046025 states. [2019-09-10 07:12:59,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046025 to 1071000. [2019-09-10 07:12:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071000 states. [2019-09-10 07:13:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071000 states to 1071000 states and 1508472 transitions. [2019-09-10 07:13:15,689 INFO L78 Accepts]: Start accepts. Automaton has 1071000 states and 1508472 transitions. Word has length 100 [2019-09-10 07:13:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:13:15,689 INFO L475 AbstractCegarLoop]: Abstraction has 1071000 states and 1508472 transitions. [2019-09-10 07:13:15,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 07:13:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1071000 states and 1508472 transitions. [2019-09-10 07:13:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:13:15,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:13:15,729 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:13:15,730 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:13:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:13:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1437596744, now seen corresponding path program 1 times [2019-09-10 07:13:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:13:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:15,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:13:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:13:15,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:13:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:13:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:13:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:13:15,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:13:15,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:13:15,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:13:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:13:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:15,809 INFO L87 Difference]: Start difference. First operand 1071000 states and 1508472 transitions. Second operand 3 states. [2019-09-10 07:13:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:13:29,521 INFO L93 Difference]: Finished difference Result 1518635 states and 2113641 transitions. [2019-09-10 07:13:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:13:29,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 07:13:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:13:33,239 INFO L225 Difference]: With dead ends: 1518635 [2019-09-10 07:13:33,239 INFO L226 Difference]: Without dead ends: 1518635 [2019-09-10 07:13:33,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:13:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518635 states. [2019-09-10 07:14:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518635 to 1480796. [2019-09-10 07:14:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480796 states. [2019-09-10 07:14:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480796 states to 1480796 states and 2065644 transitions. [2019-09-10 07:14:21,605 INFO L78 Accepts]: Start accepts. Automaton has 1480796 states and 2065644 transitions. Word has length 100 [2019-09-10 07:14:21,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:14:21,606 INFO L475 AbstractCegarLoop]: Abstraction has 1480796 states and 2065644 transitions. [2019-09-10 07:14:21,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:14:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1480796 states and 2065644 transitions. [2019-09-10 07:14:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 07:14:21,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:14:21,673 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:14:21,673 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:14:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash -40854105, now seen corresponding path program 1 times [2019-09-10 07:14:21,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:14:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:14:21,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:14:21,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:14:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:14:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:14:21,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:14:21,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:14:21,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 07:14:21,803 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [101], [122], [125], [136], [138], [141], [152], [154], [157], [160], [163], [168], [170], [173], [184], [186], [189], [192], [194], [197], [198], [200], [209], [220], [222], [235], [243], [262], [264], [267], [275], [278], [281], [284], [286], [288], [326], [328], [341], [349], [368], [379], [381], [394], [402], [421], [436], [449], [457], [476], [512], [513], [517], [518], [519] [2019-09-10 07:14:21,806 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:14:21,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:14:21,823 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:14:21,906 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:14:21,906 INFO L272 AbstractInterpreter]: Visited 84 different actions 249 times. Merged at 42 different actions 140 times. Widened at 1 different actions 1 times. Performed 955 root evaluator evaluations with a maximum evaluation depth of 6. Performed 955 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 13 fixpoints after 4 different actions. Largest state had 142 variables. [2019-09-10 07:14:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:14:21,906 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:14:22,058 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 80.3% of their original sizes. [2019-09-10 07:14:22,058 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:14:26,877 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 07:14:26,877 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:14:26,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:14:26,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [7] total 55 [2019-09-10 07:14:26,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:14:26,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 07:14:26,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 07:14:26,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 07:14:26,879 INFO L87 Difference]: Start difference. First operand 1480796 states and 2065644 transitions. Second operand 50 states.