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.5_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:34:22,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:34:22,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:34:22,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:34:22,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:34:22,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:34:22,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:34:22,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:34:22,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:34:22,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:34:22,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:34:22,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:34:22,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:34:22,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:34:22,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:34:22,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:34:22,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:34:22,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:34:22,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:34:22,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:34:22,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:34:22,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:34:22,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:34:22,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:34:22,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:34:22,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:34:22,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:34:22,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:34:22,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:34:22,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:34:22,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:34:22,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:34:22,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:34:22,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:34:22,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:34:22,899 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:34:22,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:34:22,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:34:22,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:34:22,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:34:22,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:34:22,904 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:34:22,930 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:34:22,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:34:22,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:34:22,932 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:34:22,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:34:22,933 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:34:22,933 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:34:22,933 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:34:22,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:34:22,933 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:34:22,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:34:22,936 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:34:22,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:34:22,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:34:22,938 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:34:22,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:34:22,938 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:34:22,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:34:22,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:34:22,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:34:22,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:34:22,940 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:34:22,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:34:22,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:34:22,940 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:34:22,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:34:23,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:34:23,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:34:23,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:34:23,017 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:34:23,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:34:23,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562760d7/44312c683d4b4ef7bbf1575bbea536c2/FLAGd41ea10a2 [2019-09-10 04:34:23,585 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:34:23,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:34:23,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562760d7/44312c683d4b4ef7bbf1575bbea536c2/FLAGd41ea10a2 [2019-09-10 04:34:23,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d562760d7/44312c683d4b4ef7bbf1575bbea536c2 [2019-09-10 04:34:23,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:34:23,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:34:23,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:34:23,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:34:23,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:34:23,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:34:23" (1/1) ... [2019-09-10 04:34:23,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e791905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:23, skipping insertion in model container [2019-09-10 04:34:23,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:34:23" (1/1) ... [2019-09-10 04:34:23,907 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:34:23,962 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:34:24,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:34:24,321 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:34:24,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:34:24,395 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:34:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24 WrapperNode [2019-09-10 04:34:24,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:34:24,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:34:24,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:34:24,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:34:24,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (1/1) ... [2019-09-10 04:34:24,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:34:24,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:34:24,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:34:24,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:34:24,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (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:34:24,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:34:24,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:34:24,517 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:34:24,518 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:34:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:34:24,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:34:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:34:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:34:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:34:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:34:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:34:24,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:34:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:34:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:34:25,160 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:34:25,160 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:34:25,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:34:25 BoogieIcfgContainer [2019-09-10 04:34:25,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:34:25,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:34:25,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:34:25,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:34:25,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:34:23" (1/3) ... [2019-09-10 04:34:25,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d8b7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:34:25, skipping insertion in model container [2019-09-10 04:34:25,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:34:24" (2/3) ... [2019-09-10 04:34:25,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d8b7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:34:25, skipping insertion in model container [2019-09-10 04:34:25,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:34:25" (3/3) ... [2019-09-10 04:34:25,170 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2019-09-10 04:34:25,181 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:34:25,189 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:34:25,205 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:34:25,229 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:34:25,229 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:34:25,229 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:34:25,229 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:34:25,230 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:34:25,230 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:34:25,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:34:25,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:34:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-10 04:34:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-10 04:34:25,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:25,263 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] [2019-09-10 04:34:25,266 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash 506263939, now seen corresponding path program 1 times [2019-09-10 04:34:25,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:25,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:25,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:25,733 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:34:25,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:25,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:25,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:25,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:25,762 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 5 states. [2019-09-10 04:34:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:25,913 INFO L93 Difference]: Finished difference Result 122 states and 182 transitions. [2019-09-10 04:34:25,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:34:25,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-10 04:34:25,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:25,934 INFO L225 Difference]: With dead ends: 122 [2019-09-10 04:34:25,935 INFO L226 Difference]: Without dead ends: 118 [2019-09-10 04:34:25,938 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:34:25,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-10 04:34:25,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-09-10 04:34:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-10 04:34:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 148 transitions. [2019-09-10 04:34:25,999 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 148 transitions. Word has length 61 [2019-09-10 04:34:26,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:26,000 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 148 transitions. [2019-09-10 04:34:26,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 148 transitions. [2019-09-10 04:34:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 04:34:26,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:26,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:26,004 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1395599750, now seen corresponding path program 1 times [2019-09-10 04:34:26,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:26,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:26,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:26,430 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:34:26,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:26,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:34:26,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:26,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:26,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:34:26,436 INFO L87 Difference]: Start difference. First operand 118 states and 148 transitions. Second operand 13 states. [2019-09-10 04:34:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:31,292 INFO L93 Difference]: Finished difference Result 1074 states and 1525 transitions. [2019-09-10 04:34:31,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 04:34:31,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-10 04:34:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:31,318 INFO L225 Difference]: With dead ends: 1074 [2019-09-10 04:34:31,318 INFO L226 Difference]: Without dead ends: 1074 [2019-09-10 04:34:31,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-10 04:34:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-09-10 04:34:31,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 506. [2019-09-10 04:34:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-09-10 04:34:31,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 704 transitions. [2019-09-10 04:34:31,425 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 704 transitions. Word has length 91 [2019-09-10 04:34:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:31,426 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 704 transitions. [2019-09-10 04:34:31,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:31,426 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 704 transitions. [2019-09-10 04:34:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:31,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:31,437 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:31,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1262243146, now seen corresponding path program 1 times [2019-09-10 04:34:31,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:31,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:31,572 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:34:31,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:31,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:34:31,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:31,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:34:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:34:31,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:34:31,574 INFO L87 Difference]: Start difference. First operand 506 states and 704 transitions. Second operand 3 states. [2019-09-10 04:34:31,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:31,610 INFO L93 Difference]: Finished difference Result 928 states and 1299 transitions. [2019-09-10 04:34:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:34:31,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 04:34:31,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:31,618 INFO L225 Difference]: With dead ends: 928 [2019-09-10 04:34:31,618 INFO L226 Difference]: Without dead ends: 928 [2019-09-10 04:34:31,618 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:34:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-09-10 04:34:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 926. [2019-09-10 04:34:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-09-10 04:34:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1298 transitions. [2019-09-10 04:34:31,689 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1298 transitions. Word has length 93 [2019-09-10 04:34:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:31,689 INFO L475 AbstractCegarLoop]: Abstraction has 926 states and 1298 transitions. [2019-09-10 04:34:31,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:34:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1298 transitions. [2019-09-10 04:34:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:31,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:31,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:31,694 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:31,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:31,695 INFO L82 PathProgramCache]: Analyzing trace with hash -25459310, now seen corresponding path program 1 times [2019-09-10 04:34:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:31,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:31,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:31,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:31,867 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:34:31,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:31,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:31,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:31,870 INFO L87 Difference]: Start difference. First operand 926 states and 1298 transitions. Second operand 5 states. [2019-09-10 04:34:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:32,392 INFO L93 Difference]: Finished difference Result 1416 states and 1968 transitions. [2019-09-10 04:34:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:32,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:34:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:32,403 INFO L225 Difference]: With dead ends: 1416 [2019-09-10 04:34:32,403 INFO L226 Difference]: Without dead ends: 1416 [2019-09-10 04:34:32,404 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:34:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-09-10 04:34:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1414. [2019-09-10 04:34:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1414 states. [2019-09-10 04:34:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 1967 transitions. [2019-09-10 04:34:32,455 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 1967 transitions. Word has length 93 [2019-09-10 04:34:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:32,455 INFO L475 AbstractCegarLoop]: Abstraction has 1414 states and 1967 transitions. [2019-09-10 04:34:32,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 1967 transitions. [2019-09-10 04:34:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:32,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:32,458 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:32,458 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1376634744, now seen corresponding path program 1 times [2019-09-10 04:34:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:32,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:32,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:32,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:32,568 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:34:32,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:32,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:32,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:32,571 INFO L87 Difference]: Start difference. First operand 1414 states and 1967 transitions. Second operand 5 states. [2019-09-10 04:34:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:33,099 INFO L93 Difference]: Finished difference Result 2659 states and 3684 transitions. [2019-09-10 04:34:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:33,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:34:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:33,116 INFO L225 Difference]: With dead ends: 2659 [2019-09-10 04:34:33,116 INFO L226 Difference]: Without dead ends: 2659 [2019-09-10 04:34:33,117 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:34:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2019-09-10 04:34:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2657. [2019-09-10 04:34:33,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2657 states. [2019-09-10 04:34:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3683 transitions. [2019-09-10 04:34:33,209 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3683 transitions. Word has length 93 [2019-09-10 04:34:33,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:33,210 INFO L475 AbstractCegarLoop]: Abstraction has 2657 states and 3683 transitions. [2019-09-10 04:34:33,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3683 transitions. [2019-09-10 04:34:33,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:33,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:33,212 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:33,212 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:33,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:33,213 INFO L82 PathProgramCache]: Analyzing trace with hash -129125890, now seen corresponding path program 1 times [2019-09-10 04:34:33,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:33,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:33,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:33,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:33,352 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:34:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:33,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:33,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:33,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:33,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:33,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:33,354 INFO L87 Difference]: Start difference. First operand 2657 states and 3683 transitions. Second operand 5 states. [2019-09-10 04:34:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:33,838 INFO L93 Difference]: Finished difference Result 5019 states and 6909 transitions. [2019-09-10 04:34:33,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:33,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 04:34:33,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:33,869 INFO L225 Difference]: With dead ends: 5019 [2019-09-10 04:34:33,869 INFO L226 Difference]: Without dead ends: 5019 [2019-09-10 04:34:33,870 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:34:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2019-09-10 04:34:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 5017. [2019-09-10 04:34:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5017 states. [2019-09-10 04:34:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 6908 transitions. [2019-09-10 04:34:34,064 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 6908 transitions. Word has length 93 [2019-09-10 04:34:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:34,066 INFO L475 AbstractCegarLoop]: Abstraction has 5017 states and 6908 transitions. [2019-09-10 04:34:34,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 6908 transitions. [2019-09-10 04:34:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:34,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:34,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:34,069 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1767354040, now seen corresponding path program 1 times [2019-09-10 04:34:34,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:34,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:34,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:34,396 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:34:34,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:34,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 04:34:34,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:34,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 04:34:34,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 04:34:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-10 04:34:34,399 INFO L87 Difference]: Start difference. First operand 5017 states and 6908 transitions. Second operand 13 states. [2019-09-10 04:34:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:39,198 INFO L93 Difference]: Finished difference Result 12980 states and 18315 transitions. [2019-09-10 04:34:39,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-10 04:34:39,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-10 04:34:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:39,290 INFO L225 Difference]: With dead ends: 12980 [2019-09-10 04:34:39,290 INFO L226 Difference]: Without dead ends: 12980 [2019-09-10 04:34:39,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 04:34:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12980 states. [2019-09-10 04:34:39,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12980 to 10954. [2019-09-10 04:34:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10954 states. [2019-09-10 04:34:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10954 states to 10954 states and 15220 transitions. [2019-09-10 04:34:39,697 INFO L78 Accepts]: Start accepts. Automaton has 10954 states and 15220 transitions. Word has length 93 [2019-09-10 04:34:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:39,697 INFO L475 AbstractCegarLoop]: Abstraction has 10954 states and 15220 transitions. [2019-09-10 04:34:39,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 04:34:39,697 INFO L276 IsEmpty]: Start isEmpty. Operand 10954 states and 15220 transitions. [2019-09-10 04:34:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:39,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:39,699 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:39,699 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:39,700 INFO L82 PathProgramCache]: Analyzing trace with hash 513197380, now seen corresponding path program 1 times [2019-09-10 04:34:39,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:39,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:39,847 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:34:39,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:39,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:34:39,848 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:39,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:34:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:34:39,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:34:39,849 INFO L87 Difference]: Start difference. First operand 10954 states and 15220 transitions. Second operand 9 states. [2019-09-10 04:34:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:40,529 INFO L93 Difference]: Finished difference Result 12008 states and 16290 transitions. [2019-09-10 04:34:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:34:40,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 04:34:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:40,580 INFO L225 Difference]: With dead ends: 12008 [2019-09-10 04:34:40,580 INFO L226 Difference]: Without dead ends: 12008 [2019-09-10 04:34:40,581 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:34:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2019-09-10 04:34:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 11024. [2019-09-10 04:34:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11024 states. [2019-09-10 04:34:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 15306 transitions. [2019-09-10 04:34:40,953 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 15306 transitions. Word has length 93 [2019-09-10 04:34:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:40,953 INFO L475 AbstractCegarLoop]: Abstraction has 11024 states and 15306 transitions. [2019-09-10 04:34:40,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:34:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 15306 transitions. [2019-09-10 04:34:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 04:34:40,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:40,956 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:40,956 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1885489220, now seen corresponding path program 1 times [2019-09-10 04:34:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:40,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:40,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:40,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:40,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:41,102 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:34:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:34:41,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:41,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:34:41,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:34:41,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:34:41,105 INFO L87 Difference]: Start difference. First operand 11024 states and 15306 transitions. Second operand 9 states. [2019-09-10 04:34:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:41,814 INFO L93 Difference]: Finished difference Result 16643 states and 22921 transitions. [2019-09-10 04:34:41,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:34:41,815 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 93 [2019-09-10 04:34:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:41,901 INFO L225 Difference]: With dead ends: 16643 [2019-09-10 04:34:41,902 INFO L226 Difference]: Without dead ends: 16637 [2019-09-10 04:34:41,903 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:34:41,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16637 states. [2019-09-10 04:34:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16637 to 11507. [2019-09-10 04:34:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11507 states. [2019-09-10 04:34:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11507 states to 11507 states and 15961 transitions. [2019-09-10 04:34:42,285 INFO L78 Accepts]: Start accepts. Automaton has 11507 states and 15961 transitions. Word has length 93 [2019-09-10 04:34:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:42,286 INFO L475 AbstractCegarLoop]: Abstraction has 11507 states and 15961 transitions. [2019-09-10 04:34:42,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:34:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 11507 states and 15961 transitions. [2019-09-10 04:34:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:34:42,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:42,288 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:42,288 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:42,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:42,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1649574105, now seen corresponding path program 1 times [2019-09-10 04:34:42,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:42,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:42,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:42,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:42,992 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:34:42,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:42,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:34:42,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:42,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:34:42,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:34:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:34:42,994 INFO L87 Difference]: Start difference. First operand 11507 states and 15961 transitions. Second operand 5 states. [2019-09-10 04:34:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:43,605 INFO L93 Difference]: Finished difference Result 14925 states and 20699 transitions. [2019-09-10 04:34:43,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:34:43,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 04:34:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:43,657 INFO L225 Difference]: With dead ends: 14925 [2019-09-10 04:34:43,657 INFO L226 Difference]: Without dead ends: 14925 [2019-09-10 04:34:43,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:34:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14925 states. [2019-09-10 04:34:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14925 to 14408. [2019-09-10 04:34:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14408 states. [2019-09-10 04:34:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14408 states to 14408 states and 20005 transitions. [2019-09-10 04:34:44,002 INFO L78 Accepts]: Start accepts. Automaton has 14408 states and 20005 transitions. Word has length 94 [2019-09-10 04:34:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:44,003 INFO L475 AbstractCegarLoop]: Abstraction has 14408 states and 20005 transitions. [2019-09-10 04:34:44,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:34:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 14408 states and 20005 transitions. [2019-09-10 04:34:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 04:34:44,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:44,005 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:44,005 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:44,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2149144, now seen corresponding path program 1 times [2019-09-10 04:34:44,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:44,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:44,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:44,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:44,178 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:34:44,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:34:44,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 04:34:44,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:44,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 04:34:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 04:34:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:34:44,181 INFO L87 Difference]: Start difference. First operand 14408 states and 20005 transitions. Second operand 11 states. [2019-09-10 04:34:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:34:44,389 INFO L93 Difference]: Finished difference Result 16219 states and 23109 transitions. [2019-09-10 04:34:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 04:34:44,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-10 04:34:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:34:44,451 INFO L225 Difference]: With dead ends: 16219 [2019-09-10 04:34:44,452 INFO L226 Difference]: Without dead ends: 16219 [2019-09-10 04:34:44,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:34:44,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16219 states. [2019-09-10 04:34:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16219 to 15128. [2019-09-10 04:34:44,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15128 states. [2019-09-10 04:34:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15128 states to 15128 states and 20713 transitions. [2019-09-10 04:34:44,908 INFO L78 Accepts]: Start accepts. Automaton has 15128 states and 20713 transitions. Word has length 94 [2019-09-10 04:34:44,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:34:44,909 INFO L475 AbstractCegarLoop]: Abstraction has 15128 states and 20713 transitions. [2019-09-10 04:34:44,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 04:34:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 15128 states and 20713 transitions. [2019-09-10 04:34:44,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:34:44,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:34:44,918 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:34:44,919 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:34:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -977858734, now seen corresponding path program 1 times [2019-09-10 04:34:44,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:34:44,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:34:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:34:44,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:34:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:34:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:34:45,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:34:45,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:34:45,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:34:45,037 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [215], [218], [223], [226], [230], [243], [245], [246], [247], [250], [266], [268], [270], [273], [277], [279], [280], [283], [299], [301], [303], [306], [310], [312], [313], [316], [319], [324], [327], [334], [336], [339], [343], [345], [346], [369], [372], [376], [378], [379], [380], [381], [384], [400], [402], [404], [407], [411], [413], [414], [417], [419], [422], [424], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446] [2019-09-10 04:34:45,134 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:34:45,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:34:45,280 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:34:46,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:34:46,558 INFO L272 AbstractInterpreter]: Visited 111 different actions 958 times. Merged at 18 different actions 204 times. Widened at 1 different actions 1 times. Performed 11163 root evaluator evaluations with a maximum evaluation depth of 5. Performed 11163 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 7 different actions. Largest state had 113 variables. [2019-09-10 04:34:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:34:46,563 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:34:47,198 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 78.08% of their original sizes. [2019-09-10 04:34:47,199 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:34:51,478 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 04:34:51,479 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:34:51,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:34:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [5] total 72 [2019-09-10 04:34:51,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:34:51,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 04:34:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 04:34:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=4248, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 04:34:51,484 INFO L87 Difference]: Start difference. First operand 15128 states and 20713 transitions. Second operand 69 states. [2019-09-10 04:36:36,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:36:36,746 INFO L93 Difference]: Finished difference Result 20200 states and 28477 transitions. [2019-09-10 04:36:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2019-09-10 04:36:36,747 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 145 [2019-09-10 04:36:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:36:36,815 INFO L225 Difference]: With dead ends: 20200 [2019-09-10 04:36:36,815 INFO L226 Difference]: Without dead ends: 20197 [2019-09-10 04:36:36,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17368 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=4309, Invalid=46091, Unknown=0, NotChecked=0, Total=50400 [2019-09-10 04:36:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20197 states. [2019-09-10 04:36:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20197 to 18550. [2019-09-10 04:36:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18550 states. [2019-09-10 04:36:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18550 states to 18550 states and 25218 transitions. [2019-09-10 04:36:37,747 INFO L78 Accepts]: Start accepts. Automaton has 18550 states and 25218 transitions. Word has length 145 [2019-09-10 04:36:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:36:37,747 INFO L475 AbstractCegarLoop]: Abstraction has 18550 states and 25218 transitions. [2019-09-10 04:36:37,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 04:36:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18550 states and 25218 transitions. [2019-09-10 04:36:37,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:36:37,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:36:37,759 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:36:37,760 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:36:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1836133942, now seen corresponding path program 1 times [2019-09-10 04:36:37,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:36:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:37,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:36:37,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:36:37,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:36:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:36:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:36:37,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:36:37,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:36:37,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:36:37,909 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [215], [218], [223], [226], [230], [243], [245], [246], [247], [250], [266], [268], [270], [273], [277], [279], [280], [283], [299], [301], [303], [306], [310], [312], [313], [336], [339], [343], [345], [346], [349], [352], [357], [360], [367], [369], [372], [376], [378], [379], [380], [381], [384], [400], [402], [404], [407], [411], [413], [414], [417], [419], [422], [424], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446] [2019-09-10 04:36:37,920 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:36:37,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:36:37,943 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:36:39,036 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:36:39,037 INFO L272 AbstractInterpreter]: Visited 111 different actions 973 times. Merged at 18 different actions 205 times. Widened at 1 different actions 1 times. Performed 11373 root evaluator evaluations with a maximum evaluation depth of 5. Performed 11373 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 45 fixpoints after 8 different actions. Largest state had 113 variables. [2019-09-10 04:36:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:36:39,038 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:36:39,372 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 78.2% of their original sizes. [2019-09-10 04:36:39,372 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:36:43,669 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 04:36:43,669 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:36:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:36:43,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 04:36:43,670 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:36:43,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 04:36:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 04:36:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=4145, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 04:36:43,672 INFO L87 Difference]: Start difference. First operand 18550 states and 25218 transitions. Second operand 68 states. [2019-09-10 04:40:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:40:23,896 INFO L93 Difference]: Finished difference Result 36226 states and 51499 transitions. [2019-09-10 04:40:23,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2019-09-10 04:40:23,896 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 145 [2019-09-10 04:40:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:40:24,044 INFO L225 Difference]: With dead ends: 36226 [2019-09-10 04:40:24,045 INFO L226 Difference]: Without dead ends: 36226 [2019-09-10 04:40:24,061 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55604 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=10412, Invalid=129090, Unknown=0, NotChecked=0, Total=139502 [2019-09-10 04:40:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36226 states. [2019-09-10 04:40:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36226 to 31699. [2019-09-10 04:40:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31699 states. [2019-09-10 04:40:25,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31699 states to 31699 states and 42971 transitions. [2019-09-10 04:40:25,004 INFO L78 Accepts]: Start accepts. Automaton has 31699 states and 42971 transitions. Word has length 145 [2019-09-10 04:40:25,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:40:25,005 INFO L475 AbstractCegarLoop]: Abstraction has 31699 states and 42971 transitions. [2019-09-10 04:40:25,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 04:40:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 31699 states and 42971 transitions. [2019-09-10 04:40:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:40:25,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:40:25,021 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:40:25,021 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:40:25,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1177787062, now seen corresponding path program 1 times [2019-09-10 04:40:25,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:40:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:25,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:40:25,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:40:25,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:40:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:40:25,151 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:40:25,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:40:25,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:40:25,152 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:40:25,155 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [215], [218], [223], [226], [230], [243], [245], [246], [247], [250], [266], [268], [270], [273], [277], [279], [280], [283], [286], [291], [294], [301], [303], [306], [310], [312], [313], [336], [339], [343], [345], [346], [349], [365], [367], [369], [372], [376], [378], [379], [380], [381], [384], [400], [402], [404], [407], [411], [413], [414], [417], [419], [422], [424], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446] [2019-09-10 04:40:25,164 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:40:25,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:40:25,178 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:40:26,104 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:40:26,106 INFO L272 AbstractInterpreter]: Visited 111 different actions 895 times. Merged at 18 different actions 182 times. Widened at 1 different actions 1 times. Performed 10577 root evaluator evaluations with a maximum evaluation depth of 5. Performed 10577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 38 fixpoints after 7 different actions. Largest state had 113 variables. [2019-09-10 04:40:26,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:40:26,106 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:40:26,320 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 78.31% of their original sizes. [2019-09-10 04:40:26,320 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:40:30,251 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 04:40:30,252 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:40:30,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:40:30,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [69] imperfect sequences [5] total 72 [2019-09-10 04:40:30,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:40:30,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-10 04:40:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-10 04:40:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=4252, Unknown=0, NotChecked=0, Total=4692 [2019-09-10 04:40:30,254 INFO L87 Difference]: Start difference. First operand 31699 states and 42971 transitions. Second operand 69 states. [2019-09-10 04:44:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:44:58,482 INFO L93 Difference]: Finished difference Result 47191 states and 67236 transitions. [2019-09-10 04:44:58,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2019-09-10 04:44:58,483 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 145 [2019-09-10 04:44:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:44:58,637 INFO L225 Difference]: With dead ends: 47191 [2019-09-10 04:44:58,638 INFO L226 Difference]: Without dead ends: 47191 [2019-09-10 04:44:58,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54885 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=10162, Invalid=127850, Unknown=0, NotChecked=0, Total=138012 [2019-09-10 04:44:58,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47191 states. [2019-09-10 04:44:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47191 to 41198. [2019-09-10 04:44:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41198 states. [2019-09-10 04:44:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41198 states to 41198 states and 56146 transitions. [2019-09-10 04:44:59,544 INFO L78 Accepts]: Start accepts. Automaton has 41198 states and 56146 transitions. Word has length 145 [2019-09-10 04:44:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:44:59,544 INFO L475 AbstractCegarLoop]: Abstraction has 41198 states and 56146 transitions. [2019-09-10 04:44:59,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-10 04:44:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 41198 states and 56146 transitions. [2019-09-10 04:44:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 04:44:59,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:44:59,562 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 04:44:59,563 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:44:59,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:44:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1154134206, now seen corresponding path program 1 times [2019-09-10 04:44:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:44:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:59,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:44:59,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:44:59,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:44:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:44:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 04:44:59,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:44:59,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:44:59,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 04:44:59,677 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [187], [188], [189], [191], [200], [206], [208], [215], [218], [223], [226], [230], [243], [245], [246], [247], [250], [266], [268], [270], [273], [277], [279], [280], [283], [299], [301], [303], [306], [310], [312], [313], [336], [339], [343], [345], [346], [349], [365], [367], [369], [372], [376], [378], [379], [380], [381], [384], [387], [392], [395], [402], [404], [407], [411], [413], [414], [417], [419], [422], [424], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [438], [439], [440], [441], [442], [443], [444], [445], [446] [2019-09-10 04:44:59,681 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:44:59,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:44:59,694 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:45:00,517 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:45:00,517 INFO L272 AbstractInterpreter]: Visited 111 different actions 937 times. Merged at 18 different actions 198 times. Widened at 1 different actions 1 times. Performed 10879 root evaluator evaluations with a maximum evaluation depth of 5. Performed 10879 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 46 fixpoints after 7 different actions. Largest state had 113 variables. [2019-09-10 04:45:00,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:45:00,518 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:45:00,728 INFO L227 lantSequenceWeakener]: Weakened 114 states. On average, predicates are now at 78.26% of their original sizes. [2019-09-10 04:45:00,728 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:45:04,552 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 04:45:04,552 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:45:04,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:45:04,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 04:45:04,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:45:04,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 04:45:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 04:45:04,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=4139, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 04:45:04,554 INFO L87 Difference]: Start difference. First operand 41198 states and 56146 transitions. Second operand 68 states.