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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:19:23,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:19:23,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:19:23,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:19:23,852 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:19:23,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:19:23,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:19:23,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:19:23,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:19:23,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:19:23,874 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:19:23,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:19:23,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:19:23,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:19:23,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:19:23,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:19:23,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:19:23,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:19:23,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:19:23,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:19:23,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:19:23,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:19:23,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:19:23,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:19:23,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:19:23,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:19:23,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:19:23,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:19:23,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:19:23,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:19:23,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:19:23,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:19:23,897 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:19:23,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:19:23,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:19:23,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:19:23,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:19:23,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:19:23,900 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:19:23,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:19:23,902 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:19:23,903 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:19:23,918 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:19:23,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:19:23,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:19:23,920 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:19:23,921 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:19:23,921 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:19:23,922 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:19:23,922 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:19:23,922 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:19:23,922 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:19:23,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:19:23,923 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:19:23,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:19:23,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:19:23,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:19:23,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:19:23,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:19:23,926 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:19:23,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:19:23,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:19:23,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:19:23,927 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:19:23,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:19:23,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:19:23,927 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:19:23,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:19:23,928 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:19:23,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:19:23,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:19:23,928 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:19:23,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:19:23,994 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:19:23,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:19:23,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:19:23,999 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:19:24,000 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.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:19:24,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81fcb87b/b8ad59c3512646e8bc50e456796cdc5f/FLAGac32ead4b [2019-09-10 07:19:24,585 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:19:24,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:19:24,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81fcb87b/b8ad59c3512646e8bc50e456796cdc5f/FLAGac32ead4b [2019-09-10 07:19:24,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81fcb87b/b8ad59c3512646e8bc50e456796cdc5f [2019-09-10 07:19:24,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:19:24,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:19:24,906 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:19:24,906 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:19:24,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:19:24,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:19:24" (1/1) ... [2019-09-10 07:19:24,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67837e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:24, skipping insertion in model container [2019-09-10 07:19:24,914 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:19:24" (1/1) ... [2019-09-10 07:19:24,920 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:19:24,981 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:19:25,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:19:25,422 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:19:25,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:19:25,576 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:19:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25 WrapperNode [2019-09-10 07:19:25,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:19:25,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:19:25,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:19:25,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:19:25,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (1/1) ... [2019-09-10 07:19:25,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:19:25,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:19:25,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:19:25,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:19:25,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (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:19:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:19:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:19:25,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:19:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:19:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:19:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:19:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:19:25,719 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:19:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:19:25,720 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:19:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:19:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:19:25,721 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:19:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:19:25,722 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:19:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:19:25,723 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:19:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:19:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:19:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:19:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:19:25,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:19:26,645 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:19:26,646 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:19:26,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:19:26 BoogieIcfgContainer [2019-09-10 07:19:26,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:19:26,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:19:26,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:19:26,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:19:26,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:19:24" (1/3) ... [2019-09-10 07:19:26,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b791b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:19:26, skipping insertion in model container [2019-09-10 07:19:26,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:19:25" (2/3) ... [2019-09-10 07:19:26,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b791b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:19:26, skipping insertion in model container [2019-09-10 07:19:26,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:19:26" (3/3) ... [2019-09-10 07:19:26,656 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:19:26,668 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:19:26,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:19:26,710 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:19:26,740 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:19:26,740 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:19:26,740 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:19:26,740 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:19:26,741 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:19:26,741 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:19:26,741 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:19:26,741 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:19:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2019-09-10 07:19:26,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:19:26,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:26,779 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, 1, 1, 1, 1, 1] [2019-09-10 07:19:26,781 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:26,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -56104316, now seen corresponding path program 1 times [2019-09-10 07:19:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:26,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:26,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:27,320 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:19:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:27,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:27,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:27,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:27,351 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2019-09-10 07:19:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:27,468 INFO L93 Difference]: Finished difference Result 276 states and 445 transitions. [2019-09-10 07:19:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:27,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:19:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:27,502 INFO L225 Difference]: With dead ends: 276 [2019-09-10 07:19:27,503 INFO L226 Difference]: Without dead ends: 268 [2019-09-10 07:19:27,506 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:19:27,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-10 07:19:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-09-10 07:19:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-10 07:19:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2019-09-10 07:19:27,582 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 78 [2019-09-10 07:19:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:27,583 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2019-09-10 07:19:27,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2019-09-10 07:19:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:19:27,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:27,587 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, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:27,587 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:27,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash -30986540, now seen corresponding path program 1 times [2019-09-10 07:19:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:27,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:27,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:27,819 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:19:27,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:27,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:27,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:27,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:27,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:27,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:27,823 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand 3 states. [2019-09-10 07:19:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:27,862 INFO L93 Difference]: Finished difference Result 452 states and 690 transitions. [2019-09-10 07:19:27,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:27,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:19:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:27,867 INFO L225 Difference]: With dead ends: 452 [2019-09-10 07:19:27,867 INFO L226 Difference]: Without dead ends: 452 [2019-09-10 07:19:27,868 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:19:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-10 07:19:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2019-09-10 07:19:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-10 07:19:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 689 transitions. [2019-09-10 07:19:27,898 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 689 transitions. Word has length 79 [2019-09-10 07:19:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:27,899 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 689 transitions. [2019-09-10 07:19:27,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 689 transitions. [2019-09-10 07:19:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:19:27,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:27,903 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:27,903 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1869199441, now seen corresponding path program 1 times [2019-09-10 07:19:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:27,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:27,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:28,059 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:19:28,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:28,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:28,060 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:28,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:28,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:28,067 INFO L87 Difference]: Start difference. First operand 450 states and 689 transitions. Second operand 3 states. [2019-09-10 07:19:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:28,106 INFO L93 Difference]: Finished difference Result 788 states and 1222 transitions. [2019-09-10 07:19:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:28,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:19:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:28,121 INFO L225 Difference]: With dead ends: 788 [2019-09-10 07:19:28,122 INFO L226 Difference]: Without dead ends: 788 [2019-09-10 07:19:28,122 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:19:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-10 07:19:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786. [2019-09-10 07:19:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-10 07:19:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1221 transitions. [2019-09-10 07:19:28,165 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1221 transitions. Word has length 80 [2019-09-10 07:19:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:28,168 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1221 transitions. [2019-09-10 07:19:28,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1221 transitions. [2019-09-10 07:19:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:19:28,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:28,178 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:28,178 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:28,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:28,179 INFO L82 PathProgramCache]: Analyzing trace with hash -28449079, now seen corresponding path program 1 times [2019-09-10 07:19:28,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:28,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:28,347 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:19:28,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:28,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:28,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:28,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:28,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:28,350 INFO L87 Difference]: Start difference. First operand 786 states and 1221 transitions. Second operand 3 states. [2019-09-10 07:19:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:28,387 INFO L93 Difference]: Finished difference Result 1396 states and 2178 transitions. [2019-09-10 07:19:28,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:28,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:19:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:28,399 INFO L225 Difference]: With dead ends: 1396 [2019-09-10 07:19:28,400 INFO L226 Difference]: Without dead ends: 1396 [2019-09-10 07:19:28,401 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:19:28,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-10 07:19:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-10 07:19:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-10 07:19:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2177 transitions. [2019-09-10 07:19:28,467 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2177 transitions. Word has length 81 [2019-09-10 07:19:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:28,467 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2177 transitions. [2019-09-10 07:19:28,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2177 transitions. [2019-09-10 07:19:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:19:28,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:28,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:28,470 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:28,471 INFO L82 PathProgramCache]: Analyzing trace with hash 579558126, now seen corresponding path program 1 times [2019-09-10 07:19:28,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:28,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:28,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:28,583 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:19:28,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:28,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:28,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:28,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:28,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:28,587 INFO L87 Difference]: Start difference. First operand 1394 states and 2177 transitions. Second operand 3 states. [2019-09-10 07:19:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:28,630 INFO L93 Difference]: Finished difference Result 2484 states and 3874 transitions. [2019-09-10 07:19:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:28,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:19:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:28,646 INFO L225 Difference]: With dead ends: 2484 [2019-09-10 07:19:28,646 INFO L226 Difference]: Without dead ends: 2484 [2019-09-10 07:19:28,647 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:19:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-09-10 07:19:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2482. [2019-09-10 07:19:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-09-10 07:19:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3873 transitions. [2019-09-10 07:19:28,711 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3873 transitions. Word has length 82 [2019-09-10 07:19:28,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:28,713 INFO L475 AbstractCegarLoop]: Abstraction has 2482 states and 3873 transitions. [2019-09-10 07:19:28,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3873 transitions. [2019-09-10 07:19:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:19:28,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:28,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:28,715 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1438283986, now seen corresponding path program 1 times [2019-09-10 07:19:28,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:28,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:28,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:28,962 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:19:28,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:28,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:19:28,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:28,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:19:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:19:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:19:28,964 INFO L87 Difference]: Start difference. First operand 2482 states and 3873 transitions. Second operand 8 states. [2019-09-10 07:19:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:29,365 INFO L93 Difference]: Finished difference Result 12652 states and 19670 transitions. [2019-09-10 07:19:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:19:29,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 07:19:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:29,436 INFO L225 Difference]: With dead ends: 12652 [2019-09-10 07:19:29,437 INFO L226 Difference]: Without dead ends: 12652 [2019-09-10 07:19:29,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:19:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12652 states. [2019-09-10 07:19:29,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12652 to 12642. [2019-09-10 07:19:29,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2019-09-10 07:19:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 19665 transitions. [2019-09-10 07:19:29,886 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 19665 transitions. Word has length 83 [2019-09-10 07:19:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:29,887 INFO L475 AbstractCegarLoop]: Abstraction has 12642 states and 19665 transitions. [2019-09-10 07:19:29,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:19:29,887 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 19665 transitions. [2019-09-10 07:19:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:19:29,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:29,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:29,889 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:29,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1909068852, now seen corresponding path program 1 times [2019-09-10 07:19:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:29,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:29,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:29,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:29,964 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:19:29,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:29,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:29,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:29,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:29,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:29,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:29,966 INFO L87 Difference]: Start difference. First operand 12642 states and 19665 transitions. Second operand 3 states. [2019-09-10 07:19:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:30,193 INFO L93 Difference]: Finished difference Result 21940 states and 33778 transitions. [2019-09-10 07:19:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:30,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:19:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:30,272 INFO L225 Difference]: With dead ends: 21940 [2019-09-10 07:19:30,273 INFO L226 Difference]: Without dead ends: 21940 [2019-09-10 07:19:30,273 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:19:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21940 states. [2019-09-10 07:19:30,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21940 to 21938. [2019-09-10 07:19:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21938 states. [2019-09-10 07:19:30,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21938 states to 21938 states and 33777 transitions. [2019-09-10 07:19:30,833 INFO L78 Accepts]: Start accepts. Automaton has 21938 states and 33777 transitions. Word has length 84 [2019-09-10 07:19:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:30,833 INFO L475 AbstractCegarLoop]: Abstraction has 21938 states and 33777 transitions. [2019-09-10 07:19:30,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 21938 states and 33777 transitions. [2019-09-10 07:19:30,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:19:30,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:30,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:30,836 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2091636891, now seen corresponding path program 1 times [2019-09-10 07:19:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:30,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:30,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:30,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:31,502 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:19:31,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:31,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:19:31,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:31,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:19:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:19:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:19:31,504 INFO L87 Difference]: Start difference. First operand 21938 states and 33777 transitions. Second operand 5 states. [2019-09-10 07:19:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:32,093 INFO L93 Difference]: Finished difference Result 43828 states and 67154 transitions. [2019-09-10 07:19:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:19:32,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:19:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:32,226 INFO L225 Difference]: With dead ends: 43828 [2019-09-10 07:19:32,226 INFO L226 Difference]: Without dead ends: 43828 [2019-09-10 07:19:32,227 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:19:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43828 states. [2019-09-10 07:19:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43828 to 43826. [2019-09-10 07:19:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43826 states. [2019-09-10 07:19:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43826 states to 43826 states and 67153 transitions. [2019-09-10 07:19:33,175 INFO L78 Accepts]: Start accepts. Automaton has 43826 states and 67153 transitions. Word has length 85 [2019-09-10 07:19:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:33,175 INFO L475 AbstractCegarLoop]: Abstraction has 43826 states and 67153 transitions. [2019-09-10 07:19:33,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:19:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 43826 states and 67153 transitions. [2019-09-10 07:19:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:19:33,177 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:33,178 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:33,183 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:33,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1934689024, now seen corresponding path program 1 times [2019-09-10 07:19:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:33,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:33,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:33,617 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:19:33,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:33,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:19:33,618 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:33,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:19:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:19:33,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:19:33,620 INFO L87 Difference]: Start difference. First operand 43826 states and 67153 transitions. Second operand 8 states. [2019-09-10 07:19:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:36,290 INFO L93 Difference]: Finished difference Result 203774 states and 311287 transitions. [2019-09-10 07:19:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:19:36,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-10 07:19:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:36,999 INFO L225 Difference]: With dead ends: 203774 [2019-09-10 07:19:36,999 INFO L226 Difference]: Without dead ends: 203774 [2019-09-10 07:19:37,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:19:37,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203774 states. [2019-09-10 07:19:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203774 to 87602. [2019-09-10 07:19:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87602 states. [2019-09-10 07:19:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87602 states to 87602 states and 132721 transitions. [2019-09-10 07:19:39,613 INFO L78 Accepts]: Start accepts. Automaton has 87602 states and 132721 transitions. Word has length 85 [2019-09-10 07:19:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:39,613 INFO L475 AbstractCegarLoop]: Abstraction has 87602 states and 132721 transitions. [2019-09-10 07:19:39,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:19:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 87602 states and 132721 transitions. [2019-09-10 07:19:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:19:39,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:39,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:39,616 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash -172715075, now seen corresponding path program 1 times [2019-09-10 07:19:39,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:39,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:39,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:39,737 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:19:39,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:39,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:19:39,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:39,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:19:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:19:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:19:39,739 INFO L87 Difference]: Start difference. First operand 87602 states and 132721 transitions. Second operand 5 states. [2019-09-10 07:19:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:40,510 INFO L93 Difference]: Finished difference Result 178226 states and 266929 transitions. [2019-09-10 07:19:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:19:40,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:19:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:40,839 INFO L225 Difference]: With dead ends: 178226 [2019-09-10 07:19:40,840 INFO L226 Difference]: Without dead ends: 178226 [2019-09-10 07:19:40,840 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:19:41,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178226 states. [2019-09-10 07:19:44,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178226 to 90674. [2019-09-10 07:19:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90674 states. [2019-09-10 07:19:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90674 states to 90674 states and 135793 transitions. [2019-09-10 07:19:44,619 INFO L78 Accepts]: Start accepts. Automaton has 90674 states and 135793 transitions. Word has length 86 [2019-09-10 07:19:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:44,619 INFO L475 AbstractCegarLoop]: Abstraction has 90674 states and 135793 transitions. [2019-09-10 07:19:44,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:19:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 90674 states and 135793 transitions. [2019-09-10 07:19:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:19:44,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:44,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:44,621 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1049580209, now seen corresponding path program 1 times [2019-09-10 07:19:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:44,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:44,703 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:19:44,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:19:44,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:19:44,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:19:44,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:19:44,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:19:44,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:19:44,705 INFO L87 Difference]: Start difference. First operand 90674 states and 135793 transitions. Second operand 3 states. [2019-09-10 07:19:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:19:45,107 INFO L93 Difference]: Finished difference Result 112278 states and 166948 transitions. [2019-09-10 07:19:45,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:19:45,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:19:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:19:45,321 INFO L225 Difference]: With dead ends: 112278 [2019-09-10 07:19:45,322 INFO L226 Difference]: Without dead ends: 112278 [2019-09-10 07:19:45,323 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:19:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112278 states. [2019-09-10 07:19:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112278 to 111924. [2019-09-10 07:19:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111924 states. [2019-09-10 07:19:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111924 states to 111924 states and 166595 transitions. [2019-09-10 07:19:48,483 INFO L78 Accepts]: Start accepts. Automaton has 111924 states and 166595 transitions. Word has length 87 [2019-09-10 07:19:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:19:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 111924 states and 166595 transitions. [2019-09-10 07:19:48,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:19:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 111924 states and 166595 transitions. [2019-09-10 07:19:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:19:48,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:19:48,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:19:48,525 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:19:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1906818762, now seen corresponding path program 1 times [2019-09-10 07:19:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:19:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:48,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:19:48,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:19:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:48,832 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:19:48,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:19:48,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:19:48,833 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 07:19:48,836 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], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [131], [136], [147], [149], [152], [163], [165], [168], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [245], [250], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [475], [477], [490], [498], [517], [528], [530], [532], [535], [538], [541], [543], [545], [617], [618], [622], [623], [624] [2019-09-10 07:19:48,905 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:19:48,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:19:49,156 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:19:49,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:19:49,917 INFO L272 AbstractInterpreter]: Visited 109 different actions 616 times. Merged at 61 different actions 439 times. Widened at 17 different actions 45 times. Performed 2014 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 73 fixpoints after 16 different actions. Largest state had 166 variables. [2019-09-10 07:19:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:19:49,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:19:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:19:49,924 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:19:49,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:19:49,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 07:19:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:19:50,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:19:50,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:19:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:19:50,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:19:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:19:50,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:19:50,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:19:50,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:19:50,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:19:50,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:19:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:19:50,443 INFO L87 Difference]: Start difference. First operand 111924 states and 166595 transitions. Second operand 12 states. [2019-09-10 07:19:51,383 WARN L188 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-09-10 07:20:07,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:07,016 INFO L93 Difference]: Finished difference Result 1357446 states and 1982436 transitions. [2019-09-10 07:20:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 07:20:07,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 07:20:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:17,420 INFO L225 Difference]: With dead ends: 1357446 [2019-09-10 07:20:17,420 INFO L226 Difference]: Without dead ends: 1357446 [2019-09-10 07:20:17,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1765, Invalid=8135, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 07:20:18,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357446 states. [2019-09-10 07:20:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357446 to 327268. [2019-09-10 07:20:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327268 states. [2019-09-10 07:20:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327268 states to 327268 states and 479827 transitions. [2019-09-10 07:20:33,990 INFO L78 Accepts]: Start accepts. Automaton has 327268 states and 479827 transitions. Word has length 118 [2019-09-10 07:20:33,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:33,990 INFO L475 AbstractCegarLoop]: Abstraction has 327268 states and 479827 transitions. [2019-09-10 07:20:33,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:20:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 327268 states and 479827 transitions. [2019-09-10 07:20:34,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:20:34,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:34,076 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:20:34,076 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash -482119262, now seen corresponding path program 1 times [2019-09-10 07:20:34,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:34,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:34,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:34,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:20:34,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:34,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:20:34,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:34,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:20:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:20:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:20:34,180 INFO L87 Difference]: Start difference. First operand 327268 states and 479827 transitions. Second operand 3 states. [2019-09-10 07:20:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:20:39,596 INFO L93 Difference]: Finished difference Result 530951 states and 776918 transitions. [2019-09-10 07:20:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:20:39,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 07:20:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:20:40,397 INFO L225 Difference]: With dead ends: 530951 [2019-09-10 07:20:40,397 INFO L226 Difference]: Without dead ends: 530951 [2019-09-10 07:20:40,398 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:20:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530951 states. [2019-09-10 07:20:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530951 to 530949. [2019-09-10 07:20:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530949 states. [2019-09-10 07:20:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530949 states to 530949 states and 776917 transitions. [2019-09-10 07:20:58,049 INFO L78 Accepts]: Start accepts. Automaton has 530949 states and 776917 transitions. Word has length 118 [2019-09-10 07:20:58,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:20:58,049 INFO L475 AbstractCegarLoop]: Abstraction has 530949 states and 776917 transitions. [2019-09-10 07:20:58,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:20:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 530949 states and 776917 transitions. [2019-09-10 07:20:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:20:58,102 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:20:58,103 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,103 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:20:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:20:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash -739654471, now seen corresponding path program 1 times [2019-09-10 07:20:58,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:20:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:58,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:20:58,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:20:58,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:20:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:20:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:20:58,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:20:58,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:20:58,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:20:58,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:20:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:20:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:20:58,202 INFO L87 Difference]: Start difference. First operand 530949 states and 776917 transitions. Second operand 6 states. [2019-09-10 07:21:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:21:14,653 INFO L93 Difference]: Finished difference Result 1525321 states and 2216183 transitions. [2019-09-10 07:21:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:21:14,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 07:21:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:21:16,972 INFO L225 Difference]: With dead ends: 1525321 [2019-09-10 07:21:16,972 INFO L226 Difference]: Without dead ends: 1525321 [2019-09-10 07:21:16,972 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:21:17,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525321 states. [2019-09-10 07:21:59,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525321 to 1525317. [2019-09-10 07:21:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1525317 states. [2019-09-10 07:22:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525317 states to 1525317 states and 2216181 transitions. [2019-09-10 07:22:16,117 INFO L78 Accepts]: Start accepts. Automaton has 1525317 states and 2216181 transitions. Word has length 118 [2019-09-10 07:22:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:22:16,118 INFO L475 AbstractCegarLoop]: Abstraction has 1525317 states and 2216181 transitions. [2019-09-10 07:22:16,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:22:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1525317 states and 2216181 transitions. [2019-09-10 07:22:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:22:18,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:22:18,542 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:18,543 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:22:18,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:18,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2031162782, now seen corresponding path program 1 times [2019-09-10 07:22:18,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:22:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:18,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:22:18,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:22:18,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:22:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:22:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:22:18,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:22:18,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:22:18,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 07:22:18,693 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], [102], [105], [108], [111], [114], [117], [120], [123], [126], [128], [149], [152], [155], [158], [163], [165], [168], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [466], [469], [477], [480], [483], [486], [488], [490], [532], [545], [553], [572], [617], [618], [622], [623], [624] [2019-09-10 07:22:18,706 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:22:18,706 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:22:18,766 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:22:19,028 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:22:19,029 INFO L272 AbstractInterpreter]: Visited 101 different actions 298 times. Merged at 50 different actions 166 times. Widened at 5 different actions 10 times. Performed 1139 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 22 fixpoints after 8 different actions. Largest state had 166 variables. [2019-09-10 07:22:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:22:19,030 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:22:19,567 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 79.98% of their original sizes. [2019-09-10 07:22:19,567 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:22:24,205 INFO L420 sIntCurrentIteration]: We unified 117 AI predicates to 117 [2019-09-10 07:22:24,206 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:22:24,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:22:24,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:22:24,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:22:24,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:22:24,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:22:24,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2820, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:22:24,209 INFO L87 Difference]: Start difference. First operand 1525317 states and 2216181 transitions. Second operand 57 states. [2019-09-10 07:25:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:17,531 INFO L93 Difference]: Finished difference Result 3706329 states and 5265188 transitions. [2019-09-10 07:25:17,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 592 states. [2019-09-10 07:25:17,531 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-10 07:25:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:25,094 INFO L225 Difference]: With dead ends: 3706329 [2019-09-10 07:25:25,094 INFO L226 Difference]: Without dead ends: 3706329 [2019-09-10 07:25:25,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 609 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172458 ImplicationChecksByTransitivity, 68.1s TimeCoverageRelationStatistics Valid=36180, Invalid=336530, Unknown=0, NotChecked=0, Total=372710 [2019-09-10 07:25:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706329 states.