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/pals_lcr.4.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:30:53,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:30:53,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:30:53,758 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:30:53,759 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:30:53,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:30:53,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:30:53,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:30:53,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:30:53,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:30:53,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:30:53,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:30:53,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:30:53,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:30:53,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:30:53,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:30:53,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:30:53,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:30:53,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:30:53,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:30:53,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:30:53,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:30:53,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:30:53,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:30:53,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:30:53,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:30:53,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:30:53,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:30:53,791 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:30:53,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:30:53,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:30:53,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:30:53,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:30:53,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:30:53,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:30:53,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:30:53,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:30:53,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:30:53,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:30:53,802 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:30:53,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:30:53,804 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 04:30:53,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:30:53,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:30:53,832 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:30:53,832 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:30:53,833 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:30:53,833 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:30:53,833 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:30:53,833 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:30:53,834 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:30:53,834 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:30:53,834 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:30:53,835 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:30:53,835 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:30:53,835 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:30:53,835 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:30:53,835 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:30:53,836 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:30:53,836 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:30:53,836 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:30:53,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:30:53,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:30:53,837 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:30:53,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:30:53,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:30:53,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:30:53,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:30:53,837 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:30:53,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:30:53,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:30:53,838 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:30:53,874 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:30:53,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:30:53,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:30:53,891 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:30:53,892 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:30:53,892 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:30:53,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543479413/3269f61940a546e8bd709cb3d73f68e3/FLAG619b06d42 [2019-09-10 04:30:54,424 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:30:54,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:30:54,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543479413/3269f61940a546e8bd709cb3d73f68e3/FLAG619b06d42 [2019-09-10 04:30:54,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/543479413/3269f61940a546e8bd709cb3d73f68e3 [2019-09-10 04:30:54,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:30:54,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:30:54,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:30:54,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:30:54,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:30:54,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:30:54" (1/1) ... [2019-09-10 04:30:54,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2daa5aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:54, skipping insertion in model container [2019-09-10 04:30:54,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:30:54" (1/1) ... [2019-09-10 04:30:54,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:30:54,839 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:30:55,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:30:55,077 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:30:55,234 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:30:55,252 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:30:55,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55 WrapperNode [2019-09-10 04:30:55,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:30:55,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:30:55,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:30:55,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:30:55,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (1/1) ... [2019-09-10 04:30:55,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:30:55,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:30:55,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:30:55,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:30:55,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (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 04:30:55,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:30:55,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:30:55,369 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:30:55,369 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:30:55,370 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:30:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:30:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:30:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:30:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:30:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:30:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:30:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:30:55,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:30:55,944 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:30:55,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:30:55 BoogieIcfgContainer [2019-09-10 04:30:55,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:30:55,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:30:55,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:30:55,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:30:55,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:30:54" (1/3) ... [2019-09-10 04:30:55,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9142e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:30:55, skipping insertion in model container [2019-09-10 04:30:55,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:30:55" (2/3) ... [2019-09-10 04:30:55,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9142e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:30:55, skipping insertion in model container [2019-09-10 04:30:55,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:30:55" (3/3) ... [2019-09-10 04:30:55,953 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c [2019-09-10 04:30:55,963 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:30:55,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:30:55,987 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:30:56,015 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:30:56,015 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:30:56,015 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:30:56,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:30:56,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:30:56,016 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:30:56,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:30:56,017 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:30:56,036 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-09-10 04:30:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-10 04:30:56,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:30:56,050 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] [2019-09-10 04:30:56,053 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:30:56,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:30:56,059 INFO L82 PathProgramCache]: Analyzing trace with hash -40511920, now seen corresponding path program 1 times [2019-09-10 04:30:56,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:30:56,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:30:56,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:56,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:30:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:30:56,449 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 04:30:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:30:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:30:56,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:30:56,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:30:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:30:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:30:56,484 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 5 states. [2019-09-10 04:30:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:30:56,671 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2019-09-10 04:30:56,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:30:56,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-10 04:30:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:30:56,693 INFO L225 Difference]: With dead ends: 105 [2019-09-10 04:30:56,693 INFO L226 Difference]: Without dead ends: 101 [2019-09-10 04:30:56,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 04:30:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-10 04:30:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-09-10 04:30:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-10 04:30:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-09-10 04:30:56,778 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 54 [2019-09-10 04:30:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:30:56,778 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-09-10 04:30:56,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:30:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-09-10 04:30:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 04:30:56,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:30:56,788 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] [2019-09-10 04:30:56,788 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:30:56,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:30:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1067510165, now seen corresponding path program 1 times [2019-09-10 04:30:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:30:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:56,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:30:56,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:30:56,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:30:56,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:30:57,199 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 04:30:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:30:57,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:30:57,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:30:57,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:30:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:30:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:30:57,204 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 11 states. [2019-09-10 04:31:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:00,077 INFO L93 Difference]: Finished difference Result 694 states and 993 transitions. [2019-09-10 04:31:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 04:31:00,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2019-09-10 04:31:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:00,089 INFO L225 Difference]: With dead ends: 694 [2019-09-10 04:31:00,090 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 04:31:00,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:31:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 04:31:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 499. [2019-09-10 04:31:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-10 04:31:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 700 transitions. [2019-09-10 04:31:00,171 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 700 transitions. Word has length 76 [2019-09-10 04:31:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:00,172 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 700 transitions. [2019-09-10 04:31:00,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:31:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 700 transitions. [2019-09-10 04:31:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:31:00,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:00,176 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 04:31:00,177 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash -933077243, now seen corresponding path program 1 times [2019-09-10 04:31:00,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:00,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:00,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:00,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:00,239 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 04:31:00,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:31:00,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:00,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:31:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:31:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:31:00,241 INFO L87 Difference]: Start difference. First operand 499 states and 700 transitions. Second operand 3 states. [2019-09-10 04:31:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:00,277 INFO L93 Difference]: Finished difference Result 919 states and 1290 transitions. [2019-09-10 04:31:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:31:00,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 04:31:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:00,299 INFO L225 Difference]: With dead ends: 919 [2019-09-10 04:31:00,299 INFO L226 Difference]: Without dead ends: 919 [2019-09-10 04:31:00,300 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 04:31:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-10 04:31:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 903. [2019-09-10 04:31:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2019-09-10 04:31:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1268 transitions. [2019-09-10 04:31:00,379 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1268 transitions. Word has length 78 [2019-09-10 04:31:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:00,380 INFO L475 AbstractCegarLoop]: Abstraction has 903 states and 1268 transitions. [2019-09-10 04:31:00,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:31:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1268 transitions. [2019-09-10 04:31:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:31:00,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:00,391 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 04:31:00,391 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:00,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2074187597, now seen corresponding path program 1 times [2019-09-10 04:31:00,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:00,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:00,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:00,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:00,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:00,510 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 04:31:00,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:00,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:31:00,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:00,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:31:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:31:00,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:31:00,512 INFO L87 Difference]: Start difference. First operand 903 states and 1268 transitions. Second operand 5 states. [2019-09-10 04:31:00,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:00,965 INFO L93 Difference]: Finished difference Result 1675 states and 2341 transitions. [2019-09-10 04:31:00,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:31:00,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:31:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:00,976 INFO L225 Difference]: With dead ends: 1675 [2019-09-10 04:31:00,976 INFO L226 Difference]: Without dead ends: 1675 [2019-09-10 04:31:00,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:31:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2019-09-10 04:31:01,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1673. [2019-09-10 04:31:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2019-09-10 04:31:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2340 transitions. [2019-09-10 04:31:01,037 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2340 transitions. Word has length 78 [2019-09-10 04:31:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:01,037 INFO L475 AbstractCegarLoop]: Abstraction has 1673 states and 2340 transitions. [2019-09-10 04:31:01,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:31:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2340 transitions. [2019-09-10 04:31:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:31:01,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:01,039 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 04:31:01,039 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash -973270845, now seen corresponding path program 1 times [2019-09-10 04:31:01,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:01,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:01,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:01,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:01,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:01,129 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 04:31:01,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:01,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:31:01,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:01,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:31:01,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:31:01,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:31:01,131 INFO L87 Difference]: Start difference. First operand 1673 states and 2340 transitions. Second operand 5 states. [2019-09-10 04:31:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:01,599 INFO L93 Difference]: Finished difference Result 3131 states and 4337 transitions. [2019-09-10 04:31:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:31:01,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:31:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:01,622 INFO L225 Difference]: With dead ends: 3131 [2019-09-10 04:31:01,622 INFO L226 Difference]: Without dead ends: 3131 [2019-09-10 04:31:01,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:31:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2019-09-10 04:31:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3129. [2019-09-10 04:31:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3129 states. [2019-09-10 04:31:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 4336 transitions. [2019-09-10 04:31:01,847 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 4336 transitions. Word has length 78 [2019-09-10 04:31:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:01,848 INFO L475 AbstractCegarLoop]: Abstraction has 3129 states and 4336 transitions. [2019-09-10 04:31:01,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:31:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 4336 transitions. [2019-09-10 04:31:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:31:01,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:01,850 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 04:31:01,850 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1683468301, now seen corresponding path program 1 times [2019-09-10 04:31:01,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:01,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:01,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:01,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:01,955 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 04:31:01,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:01,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:31:01,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:01,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:31:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:31:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:31:01,958 INFO L87 Difference]: Start difference. First operand 3129 states and 4336 transitions. Second operand 5 states. [2019-09-10 04:31:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:02,374 INFO L93 Difference]: Finished difference Result 5839 states and 8005 transitions. [2019-09-10 04:31:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:31:02,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-10 04:31:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:02,416 INFO L225 Difference]: With dead ends: 5839 [2019-09-10 04:31:02,417 INFO L226 Difference]: Without dead ends: 5839 [2019-09-10 04:31:02,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:31:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2019-09-10 04:31:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 5837. [2019-09-10 04:31:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5837 states. [2019-09-10 04:31:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5837 states to 5837 states and 8004 transitions. [2019-09-10 04:31:02,690 INFO L78 Accepts]: Start accepts. Automaton has 5837 states and 8004 transitions. Word has length 78 [2019-09-10 04:31:02,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:02,703 INFO L475 AbstractCegarLoop]: Abstraction has 5837 states and 8004 transitions. [2019-09-10 04:31:02,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:31:02,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5837 states and 8004 transitions. [2019-09-10 04:31:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 04:31:02,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:02,706 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 04:31:02,707 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:02,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:02,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1415753725, now seen corresponding path program 1 times [2019-09-10 04:31:02,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:02,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:02,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:02,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:02,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:03,072 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 04:31:03,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:03,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:31:03,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:03,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:31:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:31:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:31:03,075 INFO L87 Difference]: Start difference. First operand 5837 states and 8004 transitions. Second operand 11 states. [2019-09-10 04:31:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:05,493 INFO L93 Difference]: Finished difference Result 8201 states and 11778 transitions. [2019-09-10 04:31:05,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 04:31:05,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2019-09-10 04:31:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:05,565 INFO L225 Difference]: With dead ends: 8201 [2019-09-10 04:31:05,565 INFO L226 Difference]: Without dead ends: 8201 [2019-09-10 04:31:05,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 04:31:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2019-09-10 04:31:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 5861. [2019-09-10 04:31:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5861 states. [2019-09-10 04:31:05,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 7988 transitions. [2019-09-10 04:31:05,866 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 7988 transitions. Word has length 78 [2019-09-10 04:31:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:05,868 INFO L475 AbstractCegarLoop]: Abstraction has 5861 states and 7988 transitions. [2019-09-10 04:31:05,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:31:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 7988 transitions. [2019-09-10 04:31:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:31:05,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:05,870 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 04:31:05,870 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1035416937, now seen corresponding path program 1 times [2019-09-10 04:31:05,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:05,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:05,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:05,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:06,117 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 04:31:06,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:06,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:31:06,118 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:06,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:31:06,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:31:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:31:06,121 INFO L87 Difference]: Start difference. First operand 5861 states and 7988 transitions. Second operand 5 states. [2019-09-10 04:31:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:06,648 INFO L93 Difference]: Finished difference Result 8585 states and 11550 transitions. [2019-09-10 04:31:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:31:06,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-09-10 04:31:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:06,704 INFO L225 Difference]: With dead ends: 8585 [2019-09-10 04:31:06,705 INFO L226 Difference]: Without dead ends: 8585 [2019-09-10 04:31:06,705 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:31:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8585 states. [2019-09-10 04:31:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8585 to 8365. [2019-09-10 04:31:06,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8365 states. [2019-09-10 04:31:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8365 states to 8365 states and 11276 transitions. [2019-09-10 04:31:06,921 INFO L78 Accepts]: Start accepts. Automaton has 8365 states and 11276 transitions. Word has length 79 [2019-09-10 04:31:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:06,921 INFO L475 AbstractCegarLoop]: Abstraction has 8365 states and 11276 transitions. [2019-09-10 04:31:06,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:31:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8365 states and 11276 transitions. [2019-09-10 04:31:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 04:31:06,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:06,924 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 04:31:06,924 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:06,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 612008024, now seen corresponding path program 1 times [2019-09-10 04:31:06,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:06,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:06,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:06,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:06,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:07,079 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 04:31:07,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:07,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:31:07,080 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:07,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:31:07,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:31:07,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:31:07,081 INFO L87 Difference]: Start difference. First operand 8365 states and 11276 transitions. Second operand 8 states. [2019-09-10 04:31:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:07,211 INFO L93 Difference]: Finished difference Result 10237 states and 14435 transitions. [2019-09-10 04:31:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:31:07,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-09-10 04:31:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:07,272 INFO L225 Difference]: With dead ends: 10237 [2019-09-10 04:31:07,273 INFO L226 Difference]: Without dead ends: 10237 [2019-09-10 04:31:07,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:31:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10237 states. [2019-09-10 04:31:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10237 to 9229. [2019-09-10 04:31:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9229 states. [2019-09-10 04:31:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9229 states to 9229 states and 12164 transitions. [2019-09-10 04:31:07,661 INFO L78 Accepts]: Start accepts. Automaton has 9229 states and 12164 transitions. Word has length 79 [2019-09-10 04:31:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:07,661 INFO L475 AbstractCegarLoop]: Abstraction has 9229 states and 12164 transitions. [2019-09-10 04:31:07,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:31:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9229 states and 12164 transitions. [2019-09-10 04:31:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 04:31:07,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:07,663 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 04:31:07,663 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:07,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash 902213724, now seen corresponding path program 1 times [2019-09-10 04:31:07,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:07,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:07,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:07,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:07,763 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 04:31:07,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:07,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:31:07,764 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:07,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:31:07,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:31:07,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:31:07,765 INFO L87 Difference]: Start difference. First operand 9229 states and 12164 transitions. Second operand 9 states. [2019-09-10 04:31:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:08,417 INFO L93 Difference]: Finished difference Result 10901 states and 14490 transitions. [2019-09-10 04:31:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:31:08,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-09-10 04:31:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:08,450 INFO L225 Difference]: With dead ends: 10901 [2019-09-10 04:31:08,450 INFO L226 Difference]: Without dead ends: 10901 [2019-09-10 04:31:08,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:31:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10901 states. [2019-09-10 04:31:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10901 to 9261. [2019-09-10 04:31:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9261 states. [2019-09-10 04:31:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9261 states to 9261 states and 12204 transitions. [2019-09-10 04:31:09,315 INFO L78 Accepts]: Start accepts. Automaton has 9261 states and 12204 transitions. Word has length 80 [2019-09-10 04:31:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:09,315 INFO L475 AbstractCegarLoop]: Abstraction has 9261 states and 12204 transitions. [2019-09-10 04:31:09,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:31:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9261 states and 12204 transitions. [2019-09-10 04:31:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 04:31:09,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:09,317 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 04:31:09,317 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1065134300, now seen corresponding path program 1 times [2019-09-10 04:31:09,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:09,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:09,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:09,459 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 04:31:09,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:31:09,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:31:09,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:09,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:31:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:31:09,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:31:09,461 INFO L87 Difference]: Start difference. First operand 9261 states and 12204 transitions. Second operand 5 states. [2019-09-10 04:31:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:31:09,901 INFO L93 Difference]: Finished difference Result 13135 states and 17035 transitions. [2019-09-10 04:31:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:31:09,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-09-10 04:31:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:31:09,958 INFO L225 Difference]: With dead ends: 13135 [2019-09-10 04:31:09,958 INFO L226 Difference]: Without dead ends: 13135 [2019-09-10 04:31:09,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:31:09,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13135 states. [2019-09-10 04:31:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13135 to 13130. [2019-09-10 04:31:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13130 states. [2019-09-10 04:31:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13130 states to 13130 states and 17029 transitions. [2019-09-10 04:31:10,298 INFO L78 Accepts]: Start accepts. Automaton has 13130 states and 17029 transitions. Word has length 81 [2019-09-10 04:31:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:31:10,299 INFO L475 AbstractCegarLoop]: Abstraction has 13130 states and 17029 transitions. [2019-09-10 04:31:10,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:31:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13130 states and 17029 transitions. [2019-09-10 04:31:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 04:31:10,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:31:10,310 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:10,310 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:31:10,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:10,310 INFO L82 PathProgramCache]: Analyzing trace with hash 400882303, now seen corresponding path program 1 times [2019-09-10 04:31:10,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:31:10,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:10,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:31:10,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:31:10,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:31:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:31:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:31:10,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:31:10,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:31:10,451 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 124 with the following transitions: [2019-09-10 04:31:10,454 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [228], [231], [235], [237], [238], [241], [244], [249], [252], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:31:10,528 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:31:10,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:31:10,679 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:31:11,403 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:31:11,414 INFO L272 AbstractInterpreter]: Visited 93 different actions 519 times. Merged at 15 different actions 105 times. Widened at 1 different actions 1 times. Performed 5046 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5046 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 22 fixpoints after 5 different actions. Largest state had 93 variables. [2019-09-10 04:31:11,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:31:11,419 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:31:11,734 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 91.96% of their original sizes. [2019-09-10 04:31:11,735 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:31:18,579 INFO L420 sIntCurrentIteration]: We unified 122 AI predicates to 122 [2019-09-10 04:31:18,579 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:31:18,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:31:18,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 04:31:18,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:31:18,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 04:31:18,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 04:31:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=4117, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 04:31:18,584 INFO L87 Difference]: Start difference. First operand 13130 states and 17029 transitions. Second operand 68 states. [2019-09-10 04:32:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:32:00,014 INFO L93 Difference]: Finished difference Result 10863 states and 14965 transitions. [2019-09-10 04:32:00,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 04:32:00,014 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 123 [2019-09-10 04:32:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:32:00,055 INFO L225 Difference]: With dead ends: 10863 [2019-09-10 04:32:00,055 INFO L226 Difference]: Without dead ends: 10863 [2019-09-10 04:32:00,059 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=780, Invalid=9932, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 04:32:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10863 states. [2019-09-10 04:32:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10863 to 9620. [2019-09-10 04:32:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9620 states. [2019-09-10 04:32:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 12359 transitions. [2019-09-10 04:32:00,470 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 12359 transitions. Word has length 123 [2019-09-10 04:32:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:32:00,470 INFO L475 AbstractCegarLoop]: Abstraction has 9620 states and 12359 transitions. [2019-09-10 04:32:00,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 04:32:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 12359 transitions. [2019-09-10 04:32:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:32:00,474 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:32:00,475 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:32:00,475 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:32:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 735244934, now seen corresponding path program 1 times [2019-09-10 04:32:00,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:32:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:32:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:32:00,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:32:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:32:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:32:00,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:32:00,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:32:00,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:32:00,845 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:32:00,854 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:32:00,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:32:00,868 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:32:01,300 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:32:01,301 INFO L272 AbstractInterpreter]: Visited 98 different actions 708 times. Merged at 17 different actions 149 times. Widened at 1 different actions 1 times. Performed 6596 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6596 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 35 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:32:01,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:32:01,302 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:32:01,496 INFO L227 lantSequenceWeakener]: Weakened 23 states. On average, predicates are now at 88.82% of their original sizes. [2019-09-10 04:32:01,497 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:32:08,599 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:32:08,600 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:32:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:32:08,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [71] imperfect sequences [14] total 83 [2019-09-10 04:32:08,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:32:08,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-10 04:32:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-10 04:32:08,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=4442, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 04:32:08,603 INFO L87 Difference]: Start difference. First operand 9620 states and 12359 transitions. Second operand 71 states. [2019-09-10 04:33:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:33:39,575 INFO L93 Difference]: Finished difference Result 17508 states and 23704 transitions. [2019-09-10 04:33:39,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2019-09-10 04:33:39,575 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 125 [2019-09-10 04:33:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:33:39,642 INFO L225 Difference]: With dead ends: 17508 [2019-09-10 04:33:39,643 INFO L226 Difference]: Without dead ends: 17508 [2019-09-10 04:33:39,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14907 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=2662, Invalid=37138, Unknown=0, NotChecked=0, Total=39800 [2019-09-10 04:33:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17508 states. [2019-09-10 04:33:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17508 to 15217. [2019-09-10 04:33:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15217 states. [2019-09-10 04:33:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15217 states to 15217 states and 19567 transitions. [2019-09-10 04:33:40,032 INFO L78 Accepts]: Start accepts. Automaton has 15217 states and 19567 transitions. Word has length 125 [2019-09-10 04:33:40,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:33:40,032 INFO L475 AbstractCegarLoop]: Abstraction has 15217 states and 19567 transitions. [2019-09-10 04:33:40,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-10 04:33:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15217 states and 19567 transitions. [2019-09-10 04:33:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:33:40,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:33:40,039 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:40,039 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:33:40,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1971017990, now seen corresponding path program 1 times [2019-09-10 04:33:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:33:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:40,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:33:40,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:33:40,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:33:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:33:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:33:40,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:33:40,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:33:40,284 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:33:40,286 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:33:40,293 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:33:40,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:33:40,303 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:33:40,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:33:40,599 INFO L272 AbstractInterpreter]: Visited 98 different actions 662 times. Merged at 17 different actions 147 times. Widened at 1 different actions 1 times. Performed 6272 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 37 fixpoints after 7 different actions. Largest state had 93 variables. [2019-09-10 04:33:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:33:40,600 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:33:40,705 INFO L227 lantSequenceWeakener]: Weakened 98 states. On average, predicates are now at 78.08% of their original sizes. [2019-09-10 04:33:40,705 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:33:43,427 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:33:43,428 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:33:43,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:33:43,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [13] total 71 [2019-09-10 04:33:43,428 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:33:43,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-10 04:33:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-10 04:33:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3215, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 04:33:43,430 INFO L87 Difference]: Start difference. First operand 15217 states and 19567 transitions. Second operand 60 states. [2019-09-10 04:35:18,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:35:18,171 INFO L93 Difference]: Finished difference Result 23841 states and 32271 transitions. [2019-09-10 04:35:18,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2019-09-10 04:35:18,171 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 125 [2019-09-10 04:35:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:35:18,245 INFO L225 Difference]: With dead ends: 23841 [2019-09-10 04:35:18,245 INFO L226 Difference]: Without dead ends: 23841 [2019-09-10 04:35:18,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25272 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=6254, Invalid=62652, Unknown=0, NotChecked=0, Total=68906 [2019-09-10 04:35:18,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23841 states. [2019-09-10 04:35:18,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23841 to 21321. [2019-09-10 04:35:18,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21321 states. [2019-09-10 04:35:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21321 states to 21321 states and 27417 transitions. [2019-09-10 04:35:18,702 INFO L78 Accepts]: Start accepts. Automaton has 21321 states and 27417 transitions. Word has length 125 [2019-09-10 04:35:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:35:18,703 INFO L475 AbstractCegarLoop]: Abstraction has 21321 states and 27417 transitions. [2019-09-10 04:35:18,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-10 04:35:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 21321 states and 27417 transitions. [2019-09-10 04:35:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 04:35:18,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:35:18,710 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:18,710 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:35:18,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 741491750, now seen corresponding path program 1 times [2019-09-10 04:35:18,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:35:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:18,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:35:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:35:18,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:35:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:35:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:35:19,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:35:19,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:35:19,013 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 04:35:19,014 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:35:19,019 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:35:19,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:35:19,036 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:35:19,648 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:35:19,649 INFO L272 AbstractInterpreter]: Visited 98 different actions 817 times. Merged at 17 different actions 185 times. Widened at 1 different actions 1 times. Performed 7467 root evaluator evaluations with a maximum evaluation depth of 5. Performed 7467 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 47 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:35:19,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:35:19,649 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:35:19,812 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 84.64% of their original sizes. [2019-09-10 04:35:19,813 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:35:26,592 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 04:35:26,592 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:35:26,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:35:26,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [14] total 85 [2019-09-10 04:35:26,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:35:26,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-10 04:35:26,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-10 04:35:26,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=4592, Unknown=0, NotChecked=0, Total=5256 [2019-09-10 04:35:26,595 INFO L87 Difference]: Start difference. First operand 21321 states and 27417 transitions. Second operand 73 states. [2019-09-10 04:36:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:52,811 INFO L93 Difference]: Finished difference Result 32432 states and 43368 transitions. [2019-09-10 04:36:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2019-09-10 04:36:52,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 125 [2019-09-10 04:36:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:52,914 INFO L225 Difference]: With dead ends: 32432 [2019-09-10 04:36:52,915 INFO L226 Difference]: Without dead ends: 32432 [2019-09-10 04:36:52,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12188 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=3148, Invalid=31262, Unknown=0, NotChecked=0, Total=34410 [2019-09-10 04:36:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32432 states. [2019-09-10 04:36:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32432 to 29256. [2019-09-10 04:36:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29256 states. [2019-09-10 04:36:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29256 states to 29256 states and 37593 transitions. [2019-09-10 04:36:53,528 INFO L78 Accepts]: Start accepts. Automaton has 29256 states and 37593 transitions. Word has length 125 [2019-09-10 04:36:53,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:53,529 INFO L475 AbstractCegarLoop]: Abstraction has 29256 states and 37593 transitions. [2019-09-10 04:36:53,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-10 04:36:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29256 states and 37593 transitions. [2019-09-10 04:36:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-10 04:36:53,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:53,537 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:53,537 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash -721975086, now seen corresponding path program 1 times [2019-09-10 04:36:53,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:53,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:53,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:53,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:36:53,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:53,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:53,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 127 with the following transitions: [2019-09-10 04:36:53,923 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [172], [174], [177], [181], [183], [188], [196], [197], [198], [201], [206], [208], [224], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:36:53,927 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:53,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:53,944 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:54,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:36:54,532 INFO L272 AbstractInterpreter]: Visited 99 different actions 903 times. Merged at 20 different actions 230 times. Widened at 1 different actions 1 times. Performed 7852 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7852 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 70 fixpoints after 9 different actions. Largest state had 93 variables. [2019-09-10 04:36:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:54,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:36:54,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:54,534 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 04:36:54,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:54,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:36:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:54,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-10 04:36:54,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:36:55,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:36:56,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:36:56,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:36:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-10 04:36:57,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:36:57,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 41 [2019-09-10 04:36:57,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:36:57,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 04:36:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 04:36:57,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 04:36:57,148 INFO L87 Difference]: Start difference. First operand 29256 states and 37593 transitions. Second operand 31 states. [2019-09-10 04:37:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:03,225 INFO L93 Difference]: Finished difference Result 69669 states and 89045 transitions. [2019-09-10 04:37:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 04:37:03,225 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 126 [2019-09-10 04:37:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:03,435 INFO L225 Difference]: With dead ends: 69669 [2019-09-10 04:37:03,436 INFO L226 Difference]: Without dead ends: 69510 [2019-09-10 04:37:03,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1647 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1475, Invalid=6007, Unknown=0, NotChecked=0, Total=7482 [2019-09-10 04:37:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69510 states. [2019-09-10 04:37:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69510 to 66434. [2019-09-10 04:37:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66434 states. [2019-09-10 04:37:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66434 states to 66434 states and 85125 transitions. [2019-09-10 04:37:04,649 INFO L78 Accepts]: Start accepts. Automaton has 66434 states and 85125 transitions. Word has length 126 [2019-09-10 04:37:04,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:04,650 INFO L475 AbstractCegarLoop]: Abstraction has 66434 states and 85125 transitions. [2019-09-10 04:37:04,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 04:37:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 66434 states and 85125 transitions. [2019-09-10 04:37:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:37:04,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:04,661 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:04,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1550432093, now seen corresponding path program 1 times [2019-09-10 04:37:04,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:04,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:04,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:04,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:37:05,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:05,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:05,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:37:05,019 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [172], [174], [177], [181], [183], [188], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [290], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:37:05,021 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:05,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:05,030 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:05,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:05,993 INFO L272 AbstractInterpreter]: Visited 100 different actions 1339 times. Merged at 20 different actions 343 times. Widened at 1 different actions 3 times. Performed 11599 root evaluator evaluations with a maximum evaluation depth of 6. Performed 11599 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 100 fixpoints after 9 different actions. Largest state had 93 variables. [2019-09-10 04:37:05,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:05,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:05,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:05,994 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:37:06,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:06,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:37:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:06,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 804 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 04:37:06,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 04:37:06,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 04:37:06,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:06,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 6, 7] total 28 [2019-09-10 04:37:06,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:06,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 04:37:06,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 04:37:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-09-10 04:37:06,572 INFO L87 Difference]: Start difference. First operand 66434 states and 85125 transitions. Second operand 23 states. [2019-09-10 04:37:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:37:21,465 INFO L93 Difference]: Finished difference Result 224343 states and 291991 transitions. [2019-09-10 04:37:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-09-10 04:37:21,465 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2019-09-10 04:37:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:37:22,105 INFO L225 Difference]: With dead ends: 224343 [2019-09-10 04:37:22,105 INFO L226 Difference]: Without dead ends: 223983 [2019-09-10 04:37:22,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9653 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3843, Invalid=23217, Unknown=0, NotChecked=0, Total=27060 [2019-09-10 04:37:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223983 states. [2019-09-10 04:37:28,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223983 to 204441. [2019-09-10 04:37:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204441 states. [2019-09-10 04:37:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204441 states to 204441 states and 266612 transitions. [2019-09-10 04:37:28,613 INFO L78 Accepts]: Start accepts. Automaton has 204441 states and 266612 transitions. Word has length 127 [2019-09-10 04:37:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:37:28,614 INFO L475 AbstractCegarLoop]: Abstraction has 204441 states and 266612 transitions. [2019-09-10 04:37:28,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 04:37:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 204441 states and 266612 transitions. [2019-09-10 04:37:28,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:37:28,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:37:28,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:28,623 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:37:28,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:28,624 INFO L82 PathProgramCache]: Analyzing trace with hash 75160112, now seen corresponding path program 1 times [2019-09-10 04:37:28,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:37:28,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:28,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:37:28,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:37:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:37:28,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:28,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:37:28,980 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:37:28,980 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [325], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:37:28,982 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:37:28,982 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:37:28,993 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:37:29,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:37:29,417 INFO L272 AbstractInterpreter]: Visited 101 different actions 769 times. Merged at 20 different actions 171 times. Widened at 1 different actions 1 times. Performed 7219 root evaluator evaluations with a maximum evaluation depth of 6. Performed 7219 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 43 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:37:29,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:37:29,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:37:29,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:37:29,417 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 04:37:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:37:29,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:37:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:37:29,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-10 04:37:29,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:37:29,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:29,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:29,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:30,064 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-09-10 04:37:30,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:30,559 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 04:37:30,896 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-09-10 04:37:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:37:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:37:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:37:31,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:37:31,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:37:32,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:32,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,082 WARN L188 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-09-10 04:37:33,605 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-10 04:37:33,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:37:33,613 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-09-10 04:37:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-10 04:37:34,234 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-09-10 04:37:34,655 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2019-09-10 04:37:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 04:37:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:37:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 21] total 55 [2019-09-10 04:37:39,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:37:39,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 04:37:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 04:37:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2710, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 04:37:39,568 INFO L87 Difference]: Start difference. First operand 204441 states and 266612 transitions. Second operand 38 states. [2019-09-10 04:37:39,887 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-09-10 04:37:40,270 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2019-09-10 04:37:42,334 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:37:43,145 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 04:37:43,396 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-09-10 04:37:43,597 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-09-10 04:37:44,093 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 47 [2019-09-10 04:37:44,344 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 45 [2019-09-10 04:37:44,708 WARN L188 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-09-10 04:37:45,104 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 04:37:46,059 WARN L188 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-09-10 04:37:46,491 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-10 04:37:46,848 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 04:37:47,333 WARN L188 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-09-10 04:37:47,886 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 71 [2019-09-10 04:37:48,396 WARN L188 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 72 [2019-09-10 04:37:48,783 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 61 [2019-09-10 04:37:49,120 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-09-10 04:37:49,446 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 04:37:49,806 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-09-10 04:37:50,178 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 55 [2019-09-10 04:37:50,452 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-10 04:37:50,731 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-09-10 04:37:51,200 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 45 [2019-09-10 04:37:51,618 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 54 [2019-09-10 04:37:52,225 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 64 [2019-09-10 04:37:52,482 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2019-09-10 04:37:53,015 WARN L188 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 62 [2019-09-10 04:37:53,307 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-09-10 04:37:53,681 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2019-09-10 04:37:54,025 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-09-10 04:37:54,321 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-09-10 04:37:54,731 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 43 [2019-09-10 04:37:55,456 WARN L188 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-09-10 04:37:55,960 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-09-10 04:37:56,864 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-09-10 04:37:57,261 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 04:37:57,747 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-09-10 04:37:58,380 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 04:37:58,802 WARN L188 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-09-10 04:37:59,198 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-10 04:37:59,578 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2019-09-10 04:37:59,731 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 04:38:00,025 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-10 04:38:00,978 WARN L188 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 64 [2019-09-10 04:38:01,347 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 04:38:01,597 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-09-10 04:38:01,773 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-10 04:38:02,091 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 47 [2019-09-10 04:38:02,904 WARN L188 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 60 [2019-09-10 04:38:03,429 WARN L188 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2019-09-10 04:38:04,599 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 72 [2019-09-10 04:38:04,811 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 04:38:04,986 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-10 04:38:07,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:07,008 INFO L93 Difference]: Finished difference Result 581954 states and 761384 transitions. [2019-09-10 04:38:07,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 04:38:07,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 127 [2019-09-10 04:38:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:08,333 INFO L225 Difference]: With dead ends: 581954 [2019-09-10 04:38:08,333 INFO L226 Difference]: Without dead ends: 581198 [2019-09-10 04:38:08,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 238 SyntacticMatches, 27 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5026 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=3380, Invalid=15252, Unknown=0, NotChecked=0, Total=18632 [2019-09-10 04:38:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581198 states. [2019-09-10 04:38:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581198 to 540694. [2019-09-10 04:38:24,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540694 states. [2019-09-10 04:38:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540694 states to 540694 states and 709011 transitions. [2019-09-10 04:38:36,357 INFO L78 Accepts]: Start accepts. Automaton has 540694 states and 709011 transitions. Word has length 127 [2019-09-10 04:38:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:36,357 INFO L475 AbstractCegarLoop]: Abstraction has 540694 states and 709011 transitions. [2019-09-10 04:38:36,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 04:38:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 540694 states and 709011 transitions. [2019-09-10 04:38:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:38:36,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:36,368 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:36,368 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1990771706, now seen corresponding path program 1 times [2019-09-10 04:38:36,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:36,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:36,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:36,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:38:36,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:36,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:38:36,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:38:36,455 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:38:36,456 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:38:36,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:38:36,465 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:38:36,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:38:36,716 INFO L272 AbstractInterpreter]: Visited 98 different actions 437 times. Merged at 18 different actions 79 times. Never widened. Performed 4369 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4369 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 16 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:38:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:36,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:38:36,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:38:36,717 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:38:36,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:36,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:38:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:36,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:38:36,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:38:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:38:37,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:38:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:38:37,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:38:37,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:38:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:38:37,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:38:37,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:38:37,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:38:37,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:38:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:38:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:38:37,329 INFO L87 Difference]: Start difference. First operand 540694 states and 709011 transitions. Second operand 13 states. [2019-09-10 04:38:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:41,648 INFO L93 Difference]: Finished difference Result 546143 states and 732575 transitions. [2019-09-10 04:38:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:38:41,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 04:38:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:52,941 INFO L225 Difference]: With dead ends: 546143 [2019-09-10 04:38:52,942 INFO L226 Difference]: Without dead ends: 545993 [2019-09-10 04:38:52,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:38:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545993 states. [2019-09-10 04:39:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545993 to 515391. [2019-09-10 04:39:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515391 states. [2019-09-10 04:39:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515391 states to 515391 states and 667820 transitions. [2019-09-10 04:39:03,484 INFO L78 Accepts]: Start accepts. Automaton has 515391 states and 667820 transitions. Word has length 127 [2019-09-10 04:39:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:03,484 INFO L475 AbstractCegarLoop]: Abstraction has 515391 states and 667820 transitions. [2019-09-10 04:39:03,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:39:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 515391 states and 667820 transitions. [2019-09-10 04:39:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-10 04:39:03,491 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:03,491 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:03,492 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash -266035406, now seen corresponding path program 1 times [2019-09-10 04:39:03,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:03,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:03,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:03,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:39:03,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:03,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:03,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 128 with the following transitions: [2019-09-10 04:39:03,567 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [216], [219], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:39:03,568 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:03,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:03,578 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:12,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:12,020 INFO L272 AbstractInterpreter]: Visited 98 different actions 410 times. Merged at 18 different actions 73 times. Never widened. Performed 3887 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3887 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 15 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:39:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:12,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:12,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:12,020 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:39:12,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:12,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:12,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:39:12,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:12,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:12,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:12,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:39:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:12,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:39:12,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:12,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:39:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:39:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:39:12,417 INFO L87 Difference]: Start difference. First operand 515391 states and 667820 transitions. Second operand 13 states. [2019-09-10 04:39:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:14,058 INFO L93 Difference]: Finished difference Result 251437 states and 332691 transitions. [2019-09-10 04:39:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:39:14,063 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 127 [2019-09-10 04:39:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:15,086 INFO L225 Difference]: With dead ends: 251437 [2019-09-10 04:39:15,086 INFO L226 Difference]: Without dead ends: 251437 [2019-09-10 04:39:15,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:39:15,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251437 states. [2019-09-10 04:39:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251437 to 239759. [2019-09-10 04:39:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239759 states. [2019-09-10 04:39:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239759 states to 239759 states and 307437 transitions. [2019-09-10 04:39:23,651 INFO L78 Accepts]: Start accepts. Automaton has 239759 states and 307437 transitions. Word has length 127 [2019-09-10 04:39:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:23,651 INFO L475 AbstractCegarLoop]: Abstraction has 239759 states and 307437 transitions. [2019-09-10 04:39:23,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:39:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 239759 states and 307437 transitions. [2019-09-10 04:39:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:39:23,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:23,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:23,656 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:23,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1102619169, now seen corresponding path program 1 times [2019-09-10 04:39:23,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:23,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:23,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:23,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 04:39:24,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:24,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:24,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:39:24,036 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [257], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:39:24,037 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:24,037 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:24,047 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:24,353 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:24,354 INFO L272 AbstractInterpreter]: Visited 102 different actions 549 times. Merged at 20 different actions 111 times. Never widened. Performed 5128 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5128 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 27 fixpoints after 8 different actions. Largest state had 93 variables. [2019-09-10 04:39:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:24,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:24,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:24,354 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:39:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:24,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:24,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 04:39:24,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:24,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:25,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:25,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:39:25,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:25,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 15] total 44 [2019-09-10 04:39:25,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:25,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:39:25,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:39:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1713, Unknown=0, NotChecked=0, Total=1892 [2019-09-10 04:39:25,757 INFO L87 Difference]: Start difference. First operand 239759 states and 307437 transitions. Second operand 34 states. [2019-09-10 04:39:29,400 WARN L188 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-09-10 04:39:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:36,707 INFO L93 Difference]: Finished difference Result 604563 states and 779943 transitions. [2019-09-10 04:39:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-10 04:39:36,707 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 128 [2019-09-10 04:39:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:39,042 INFO L225 Difference]: With dead ends: 604563 [2019-09-10 04:39:39,042 INFO L226 Difference]: Without dead ends: 603795 [2019-09-10 04:39:39,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2311, Invalid=9899, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 04:39:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603795 states. [2019-09-10 04:39:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603795 to 576992. [2019-09-10 04:39:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576992 states. [2019-09-10 04:39:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576992 states to 576992 states and 747840 transitions. [2019-09-10 04:39:56,500 INFO L78 Accepts]: Start accepts. Automaton has 576992 states and 747840 transitions. Word has length 128 [2019-09-10 04:39:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:56,500 INFO L475 AbstractCegarLoop]: Abstraction has 576992 states and 747840 transitions. [2019-09-10 04:39:56,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:39:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 576992 states and 747840 transitions. [2019-09-10 04:39:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-10 04:39:56,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:56,504 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:56,504 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:56,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:56,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1598063445, now seen corresponding path program 1 times [2019-09-10 04:39:56,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:56,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:56,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:56,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:39:56,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:56,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:56,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2019-09-10 04:39:56,592 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:39:56,593 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:56,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:56,602 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:56,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:39:56,888 INFO L272 AbstractInterpreter]: Visited 99 different actions 441 times. Merged at 18 different actions 79 times. Never widened. Performed 4693 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 16 fixpoints after 4 different actions. Largest state had 93 variables. [2019-09-10 04:39:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:56,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:39:56,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:56,888 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:39:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:56,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:39:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:57,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 04:39:57,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:39:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:39:57,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:39:57,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:57,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:57,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:39:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 04:39:57,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:39:57,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 8] total 18 [2019-09-10 04:39:57,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:39:57,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:39:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:39:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-10 04:39:57,283 INFO L87 Difference]: Start difference. First operand 576992 states and 747840 transitions. Second operand 13 states. [2019-09-10 04:40:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:00,730 INFO L93 Difference]: Finished difference Result 308028 states and 430024 transitions. [2019-09-10 04:40:00,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 04:40:00,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 128 [2019-09-10 04:40:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:01,515 INFO L225 Difference]: With dead ends: 308028 [2019-09-10 04:40:01,515 INFO L226 Difference]: Without dead ends: 308028 [2019-09-10 04:40:01,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 247 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-09-10 04:40:01,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308028 states. [2019-09-10 04:40:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308028 to 289007. [2019-09-10 04:40:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289007 states. [2019-09-10 04:40:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289007 states to 289007 states and 373249 transitions. [2019-09-10 04:40:17,506 INFO L78 Accepts]: Start accepts. Automaton has 289007 states and 373249 transitions. Word has length 128 [2019-09-10 04:40:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:17,507 INFO L475 AbstractCegarLoop]: Abstraction has 289007 states and 373249 transitions. [2019-09-10 04:40:17,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:40:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 289007 states and 373249 transitions. [2019-09-10 04:40:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:40:17,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:17,509 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:17,509 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 777724142, now seen corresponding path program 1 times [2019-09-10 04:40:17,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:17,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:17,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:17,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:17,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:40:19,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:40:19,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:40:19,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:40:19,054 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [244], [249], [252], [259], [261], [264], [268], [270], [271], [274], [277], [280], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:40:19,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:40:19,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:40:19,065 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:40:19,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:40:19,342 INFO L272 AbstractInterpreter]: Visited 103 different actions 622 times. Merged at 20 different actions 125 times. Never widened. Performed 5849 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5849 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 32 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:40:19,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:19,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:40:19,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:40:19,343 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:40:19,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:19,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:40:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:19,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 88 conjunts are in the unsatisfiable core [2019-09-10 04:40:19,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:40:28,276 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 04:40:29,278 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 04:40:29,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:30,357 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 04:40:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:30,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:31,606 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-09-10 04:40:32,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:40:32,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:40:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-10 04:40:33,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-10 04:40:34,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:34,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:35,449 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-10 04:40:35,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:36,149 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 04:40:36,460 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 04:40:36,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:37,009 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:40:37,364 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2019-09-10 04:40:37,698 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-10 04:40:38,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:38,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:38,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:40:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:40:39,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:40:39,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 42, 41] total 115 [2019-09-10 04:40:39,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:40:39,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:40:39,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:40:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1007, Invalid=12103, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 04:40:39,546 INFO L87 Difference]: Start difference. First operand 289007 states and 373249 transitions. Second operand 78 states. [2019-09-10 04:40:42,235 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:40:42,947 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:40:43,198 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:40:43,803 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:40:44,094 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-09-10 04:40:44,390 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2019-09-10 04:40:44,801 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-09-10 04:40:45,113 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 60 [2019-09-10 04:40:45,419 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 04:40:45,827 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2019-09-10 04:40:46,170 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2019-09-10 04:40:46,480 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2019-09-10 04:40:46,770 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 46 [2019-09-10 04:40:47,097 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-10 04:40:48,566 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-09-10 04:40:48,940 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-09-10 04:40:49,760 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-09-10 04:40:50,498 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-09-10 04:40:50,852 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-09-10 04:40:51,265 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 64 [2019-09-10 04:40:51,674 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-09-10 04:40:52,046 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:40:52,496 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-09-10 04:40:53,156 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-09-10 04:40:54,246 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-09-10 04:40:54,466 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 04:40:54,813 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-09-10 04:40:55,151 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-09-10 04:40:55,545 WARN L188 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-09-10 04:40:55,771 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 39 [2019-09-10 04:40:56,162 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-09-10 04:40:56,475 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:40:57,019 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-09-10 04:40:57,475 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-09-10 04:40:58,170 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-09-10 04:40:58,461 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-10 04:40:58,758 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-09-10 04:41:02,840 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 04:41:03,449 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 04:41:05,098 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:41:06,108 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:41:06,899 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2019-09-10 04:41:07,587 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-09-10 04:41:08,077 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-09-10 04:41:08,668 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2019-09-10 04:41:09,742 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2019-09-10 04:41:10,583 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:41:14,619 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:41:15,457 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-09-10 04:41:16,351 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-09-10 04:41:16,807 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:41:19,415 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:41:19,693 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:41:20,709 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 84 [2019-09-10 04:41:21,045 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 75 [2019-09-10 04:41:21,449 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:41:21,636 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:41:22,396 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2019-09-10 04:41:22,676 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:41:23,199 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 85 [2019-09-10 04:41:23,514 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-09-10 04:41:24,178 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2019-09-10 04:41:24,532 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:41:24,964 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 73 [2019-09-10 04:41:25,237 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 04:41:25,774 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2019-09-10 04:41:26,038 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2019-09-10 04:41:27,554 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 102 [2019-09-10 04:41:27,884 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:41:28,204 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 73 [2019-09-10 04:41:28,447 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:41:29,557 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 89 [2019-09-10 04:41:30,014 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 87 [2019-09-10 04:41:30,327 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 67 [2019-09-10 04:41:30,590 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-09-10 04:41:31,064 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2019-09-10 04:41:31,544 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2019-09-10 04:41:31,788 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-09-10 04:41:32,049 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 66 [2019-09-10 04:41:32,239 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2019-09-10 04:41:32,943 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 59 [2019-09-10 04:41:33,339 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2019-09-10 04:41:33,683 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-09-10 04:41:33,933 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-09-10 04:41:34,276 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2019-09-10 04:41:35,710 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 72 [2019-09-10 04:41:36,339 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-09-10 04:41:36,793 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-09-10 04:41:37,310 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-09-10 04:41:37,520 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-09-10 04:41:37,773 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-09-10 04:41:39,548 WARN L188 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 04:41:40,381 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2019-09-10 04:41:40,611 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:41:41,083 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-09-10 04:41:41,436 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-09-10 04:41:41,699 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-09-10 04:41:42,417 WARN L188 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 63 [2019-09-10 04:41:42,761 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 70 [2019-09-10 04:41:42,971 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 53 [2019-09-10 04:41:43,144 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:41:43,443 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-09-10 04:41:43,962 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 04:41:44,892 WARN L188 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2019-09-10 04:41:45,360 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2019-09-10 04:41:45,730 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 56 [2019-09-10 04:41:46,167 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 53 [2019-09-10 04:41:47,498 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:41:47,721 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2019-09-10 04:41:49,448 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 71 [2019-09-10 04:41:49,735 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-09-10 04:41:49,983 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-09-10 04:41:50,391 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:41:50,560 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-09-10 04:41:51,165 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-09-10 04:41:51,481 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2019-09-10 04:41:53,046 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 77 [2019-09-10 04:41:53,447 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-09-10 04:41:53,751 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 68 [2019-09-10 04:41:54,037 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-09-10 04:41:55,942 WARN L188 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-09-10 04:41:57,157 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2019-09-10 04:41:57,610 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2019-09-10 04:41:58,765 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-09-10 04:41:59,042 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-09-10 04:42:00,171 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 64 [2019-09-10 04:42:00,753 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-10 04:42:02,544 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 04:42:02,829 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-10 04:42:04,573 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-09-10 04:42:04,815 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-10 04:42:05,983 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 04:42:06,514 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-09-10 04:42:07,186 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2019-09-10 04:42:07,648 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-10 04:42:08,613 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-09-10 04:42:09,612 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-10 04:42:10,473 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2019-09-10 04:42:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:15,375 INFO L93 Difference]: Finished difference Result 332353 states and 426699 transitions. [2019-09-10 04:42:15,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2019-09-10 04:42:15,376 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 129 [2019-09-10 04:42:15,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:16,092 INFO L225 Difference]: With dead ends: 332353 [2019-09-10 04:42:16,092 INFO L226 Difference]: Without dead ends: 330904 [2019-09-10 04:42:16,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 263 SyntacticMatches, 8 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47918 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=15659, Invalid=129121, Unknown=0, NotChecked=0, Total=144780 [2019-09-10 04:42:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330904 states. [2019-09-10 04:42:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330904 to 317294. [2019-09-10 04:42:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317294 states. [2019-09-10 04:42:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317294 states to 317294 states and 409487 transitions. [2019-09-10 04:42:24,568 INFO L78 Accepts]: Start accepts. Automaton has 317294 states and 409487 transitions. Word has length 129 [2019-09-10 04:42:24,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:24,568 INFO L475 AbstractCegarLoop]: Abstraction has 317294 states and 409487 transitions. [2019-09-10 04:42:24,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 04:42:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 317294 states and 409487 transitions. [2019-09-10 04:42:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 04:42:24,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:24,571 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:42:24,571 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1088790599, now seen corresponding path program 1 times [2019-09-10 04:42:24,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:24,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:24,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:24,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 04:42:26,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:26,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:42:26,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 130 with the following transitions: [2019-09-10 04:42:26,063 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], [139], [140], [141], [143], [152], [157], [159], [166], [169], [174], [177], [181], [194], [196], [197], [198], [201], [206], [208], [211], [214], [226], [228], [231], [235], [237], [238], [241], [244], [247], [259], [261], [264], [268], [270], [271], [274], [277], [282], [285], [292], [294], [297], [301], [303], [304], [305], [306], [309], [312], [317], [320], [327], [329], [332], [336], [338], [339], [342], [344], [347], [349], [353], [354], [355], [356], [357], [358], [359], [360], [361], [362], [363], [364], [365], [366], [367], [368], [369] [2019-09-10 04:42:26,064 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:42:26,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:42:26,070 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:42:26,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 04:42:26,275 INFO L272 AbstractInterpreter]: Visited 103 different actions 496 times. Merged at 20 different actions 95 times. Never widened. Performed 4458 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4458 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 25 fixpoints after 6 different actions. Largest state had 93 variables. [2019-09-10 04:42:26,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:26,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 04:42:26,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:26,276 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 04:42:27,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:27,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 04:42:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:27,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-10 04:42:27,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 04:42:28,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 04:42:28,789 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 04:42:29,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:29,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 04:42:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 04:42:30,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 04:42:30,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 18, 18] total 70 [2019-09-10 04:42:30,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 04:42:30,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 04:42:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 04:42:30,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=4580, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 04:42:30,492 INFO L87 Difference]: Start difference. First operand 317294 states and 409487 transitions. Second operand 54 states. [2019-09-10 04:42:31,439 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 04:42:33,195 WARN L188 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-09-10 04:42:33,803 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 04:42:34,109 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2019-09-10 04:42:34,444 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2019-09-10 04:42:35,322 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 04:42:36,844 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2019-09-10 04:42:37,156 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2019-09-10 04:42:37,402 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 04:42:37,682 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-09-10 04:42:38,377 WARN L188 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-09-10 04:42:38,729 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 80 [2019-09-10 04:42:39,237 WARN L188 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-09-10 04:42:39,803 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2019-09-10 04:42:40,428 WARN L188 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 103 [2019-09-10 04:42:40,871 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 99 [2019-09-10 04:42:42,949 WARN L188 SmtUtils]: Spent 1.88 s on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2019-09-10 04:42:43,514 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 109 [2019-09-10 04:42:44,120 WARN L188 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 111 [2019-09-10 04:42:44,683 WARN L188 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2019-09-10 04:42:45,378 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2019-09-10 04:42:45,641 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:42:45,970 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-10 04:42:46,759 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 04:42:47,049 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-09-10 04:42:47,643 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 04:42:47,983 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76