java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:15:07,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:15:07,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:15:07,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:15:07,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:15:07,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:15:07,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:15:07,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:15:07,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:15:07,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:15:07,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:15:07,224 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:15:07,225 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:15:07,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:15:07,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:15:07,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:15:07,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:15:07,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:15:07,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:15:07,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:15:07,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:15:07,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:15:07,237 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:15:07,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:15:07,239 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:15:07,240 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:15:07,240 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:15:07,241 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:15:07,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:15:07,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:15:07,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:15:07,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:15:07,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:15:07,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:15:07,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:15:07,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:15:07,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:15:07,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:15:07,252 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:15:07,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:15:07,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:15:07,254 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 08:15:07,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:15:07,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:15:07,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:15:07,285 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:15:07,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:15:07,286 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:15:07,286 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:15:07,287 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:15:07,287 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:15:07,287 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:15:07,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:15:07,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:15:07,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:15:07,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:15:07,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:15:07,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:15:07,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:15:07,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:15:07,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:15:07,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:15:07,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:15:07,290 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:15:07,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:15:07,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:15:07,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:15:07,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:15:07,291 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:15:07,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:15:07,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:15:07,292 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:15:07,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:15:07,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:15:07,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:15:07,349 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:15:07,350 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:15:07,352 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:15:07,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81caa6dd8/ca730196eca84449a6f38a2cf184bd10/FLAG99b26d0d1 [2019-09-10 08:15:07,949 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:15:07,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:15:07,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81caa6dd8/ca730196eca84449a6f38a2cf184bd10/FLAG99b26d0d1 [2019-09-10 08:15:08,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81caa6dd8/ca730196eca84449a6f38a2cf184bd10 [2019-09-10 08:15:08,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:15:08,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:15:08,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:15:08,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:15:08,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:15:08,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:08,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fa66722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08, skipping insertion in model container [2019-09-10 08:15:08,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:08,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:15:08,403 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:15:08,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:15:08,832 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:15:08,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:15:08,948 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:15:08,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08 WrapperNode [2019-09-10 08:15:08,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:15:08,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:15:08,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:15:08,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:15:08,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:08,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:08,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:08,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:09,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:09,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:09,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (1/1) ... [2019-09-10 08:15:09,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:15:09,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:15:09,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:15:09,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:15:09,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (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 08:15:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:15:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:15:09,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:15:09,075 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:15:09,076 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:15:09,077 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:15:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:15:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:15:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:15:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:15:09,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:15:09,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:15:09,844 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:15:09,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:15:09 BoogieIcfgContainer [2019-09-10 08:15:09,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:15:09,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:15:09,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:15:09,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:15:09,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:15:08" (1/3) ... [2019-09-10 08:15:09,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68212a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:15:09, skipping insertion in model container [2019-09-10 08:15:09,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:15:08" (2/3) ... [2019-09-10 08:15:09,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68212a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:15:09, skipping insertion in model container [2019-09-10 08:15:09,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:15:09" (3/3) ... [2019-09-10 08:15:09,854 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-10 08:15:09,863 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:15:09,872 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:15:09,891 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:15:09,921 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:15:09,921 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:15:09,921 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:15:09,921 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:15:09,922 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:15:09,922 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:15:09,922 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:15:09,922 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:15:09,942 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2019-09-10 08:15:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-10 08:15:09,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:09,959 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:09,962 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1596383191, now seen corresponding path program 1 times [2019-09-10 08:15:09,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:10,469 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 08:15:10,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:10,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:10,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:10,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:10,495 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2019-09-10 08:15:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:10,595 INFO L93 Difference]: Finished difference Result 187 states and 304 transitions. [2019-09-10 08:15:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:10,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-10 08:15:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:10,619 INFO L225 Difference]: With dead ends: 187 [2019-09-10 08:15:10,619 INFO L226 Difference]: Without dead ends: 179 [2019-09-10 08:15:10,623 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 08:15:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-10 08:15:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2019-09-10 08:15:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-10 08:15:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2019-09-10 08:15:10,681 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 76 [2019-09-10 08:15:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,682 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2019-09-10 08:15:10,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2019-09-10 08:15:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-10 08:15:10,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:10,685 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] [2019-09-10 08:15:10,686 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash 959202196, now seen corresponding path program 1 times [2019-09-10 08:15:10,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:10,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:10,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:10,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:10,883 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 08:15:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:10,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:10,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:10,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:10,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:10,888 INFO L87 Difference]: Start difference. First operand 177 states and 254 transitions. Second operand 3 states. [2019-09-10 08:15:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:10,943 INFO L93 Difference]: Finished difference Result 291 states and 433 transitions. [2019-09-10 08:15:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:10,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-10 08:15:10,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:10,953 INFO L225 Difference]: With dead ends: 291 [2019-09-10 08:15:10,953 INFO L226 Difference]: Without dead ends: 291 [2019-09-10 08:15:10,954 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 08:15:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-09-10 08:15:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2019-09-10 08:15:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-10 08:15:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-10 08:15:10,997 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 77 [2019-09-10 08:15:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:10,998 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-10 08:15:10,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-10 08:15:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 08:15:11,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,009 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash -927003067, now seen corresponding path program 1 times [2019-09-10 08:15:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,175 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 08:15:11,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:11,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:11,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:11,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:11,181 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 3 states. [2019-09-10 08:15:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,220 INFO L93 Difference]: Finished difference Result 499 states and 761 transitions. [2019-09-10 08:15:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:11,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 08:15:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,226 INFO L225 Difference]: With dead ends: 499 [2019-09-10 08:15:11,226 INFO L226 Difference]: Without dead ends: 499 [2019-09-10 08:15:11,227 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 08:15:11,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-10 08:15:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2019-09-10 08:15:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-09-10 08:15:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 760 transitions. [2019-09-10 08:15:11,250 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 760 transitions. Word has length 78 [2019-09-10 08:15:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,251 INFO L475 AbstractCegarLoop]: Abstraction has 497 states and 760 transitions. [2019-09-10 08:15:11,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:11,251 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 760 transitions. [2019-09-10 08:15:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 08:15:11,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,253 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1219899588, now seen corresponding path program 1 times [2019-09-10 08:15:11,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,348 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 08:15:11,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:11,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:11,350 INFO L87 Difference]: Start difference. First operand 497 states and 760 transitions. Second operand 3 states. [2019-09-10 08:15:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,376 INFO L93 Difference]: Finished difference Result 883 states and 1361 transitions. [2019-09-10 08:15:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:11,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 08:15:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,383 INFO L225 Difference]: With dead ends: 883 [2019-09-10 08:15:11,383 INFO L226 Difference]: Without dead ends: 883 [2019-09-10 08:15:11,384 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 08:15:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-09-10 08:15:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2019-09-10 08:15:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-10 08:15:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1360 transitions. [2019-09-10 08:15:11,410 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1360 transitions. Word has length 79 [2019-09-10 08:15:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,411 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1360 transitions. [2019-09-10 08:15:11,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1360 transitions. [2019-09-10 08:15:11,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 08:15:11,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,414 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1078210598, now seen corresponding path program 1 times [2019-09-10 08:15:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,515 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 08:15:11,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:11,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:11,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:11,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:11,517 INFO L87 Difference]: Start difference. First operand 881 states and 1360 transitions. Second operand 3 states. [2019-09-10 08:15:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,571 INFO L93 Difference]: Finished difference Result 1587 states and 2449 transitions. [2019-09-10 08:15:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:11,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 08:15:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,584 INFO L225 Difference]: With dead ends: 1587 [2019-09-10 08:15:11,584 INFO L226 Difference]: Without dead ends: 1587 [2019-09-10 08:15:11,585 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 08:15:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-09-10 08:15:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2019-09-10 08:15:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1585 states. [2019-09-10 08:15:11,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2448 transitions. [2019-09-10 08:15:11,633 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2448 transitions. Word has length 80 [2019-09-10 08:15:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,634 INFO L475 AbstractCegarLoop]: Abstraction has 1585 states and 2448 transitions. [2019-09-10 08:15:11,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:11,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2448 transitions. [2019-09-10 08:15:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 08:15:11,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,640 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,641 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,641 INFO L82 PathProgramCache]: Analyzing trace with hash 847671569, now seen corresponding path program 1 times [2019-09-10 08:15:11,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:11,755 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 08:15:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:11,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:11,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:11,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:11,759 INFO L87 Difference]: Start difference. First operand 1585 states and 2448 transitions. Second operand 3 states. [2019-09-10 08:15:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:11,803 INFO L93 Difference]: Finished difference Result 2867 states and 4401 transitions. [2019-09-10 08:15:11,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:11,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 08:15:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:11,821 INFO L225 Difference]: With dead ends: 2867 [2019-09-10 08:15:11,822 INFO L226 Difference]: Without dead ends: 2867 [2019-09-10 08:15:11,822 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 08:15:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2019-09-10 08:15:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2865. [2019-09-10 08:15:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:11,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4400 transitions. [2019-09-10 08:15:11,902 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4400 transitions. Word has length 81 [2019-09-10 08:15:11,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:11,903 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4400 transitions. [2019-09-10 08:15:11,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4400 transitions. [2019-09-10 08:15:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:11,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:11,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:11,905 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:11,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:11,905 INFO L82 PathProgramCache]: Analyzing trace with hash 12169119, now seen corresponding path program 1 times [2019-09-10 08:15:11,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:11,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:11,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,026 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 08:15:12,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:12,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:12,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:12,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:12,028 INFO L87 Difference]: Start difference. First operand 2865 states and 4400 transitions. Second operand 5 states. [2019-09-10 08:15:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:12,233 INFO L93 Difference]: Finished difference Result 2865 states and 4368 transitions. [2019-09-10 08:15:12,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:12,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:15:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:12,254 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 08:15:12,254 INFO L226 Difference]: Without dead ends: 2865 [2019-09-10 08:15:12,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:15:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-10 08:15:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-10 08:15:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4368 transitions. [2019-09-10 08:15:12,399 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4368 transitions. Word has length 82 [2019-09-10 08:15:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:12,400 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4368 transitions. [2019-09-10 08:15:12,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4368 transitions. [2019-09-10 08:15:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:12,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:12,402 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:12,402 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:12,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1733499994, now seen corresponding path program 1 times [2019-09-10 08:15:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,544 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 08:15:12,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:12,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:12,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:12,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:12,546 INFO L87 Difference]: Start difference. First operand 2865 states and 4368 transitions. Second operand 5 states. [2019-09-10 08:15:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:12,704 INFO L93 Difference]: Finished difference Result 2865 states and 4336 transitions. [2019-09-10 08:15:12,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:12,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:15:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:12,720 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 08:15:12,721 INFO L226 Difference]: Without dead ends: 2865 [2019-09-10 08:15:12,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:15:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-10 08:15:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-10 08:15:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4336 transitions. [2019-09-10 08:15:12,792 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4336 transitions. Word has length 82 [2019-09-10 08:15:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:12,792 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4336 transitions. [2019-09-10 08:15:12,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:12,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4336 transitions. [2019-09-10 08:15:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:12,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:12,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:12,794 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 286470399, now seen corresponding path program 1 times [2019-09-10 08:15:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:12,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:12,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:12,918 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 08:15:12,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:12,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:12,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:12,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:12,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:12,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:12,920 INFO L87 Difference]: Start difference. First operand 2865 states and 4336 transitions. Second operand 5 states. [2019-09-10 08:15:13,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:13,067 INFO L93 Difference]: Finished difference Result 2865 states and 4304 transitions. [2019-09-10 08:15:13,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:13,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:15:13,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:13,082 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 08:15:13,082 INFO L226 Difference]: Without dead ends: 2865 [2019-09-10 08:15:13,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:15:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-10 08:15:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-10 08:15:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4304 transitions. [2019-09-10 08:15:13,188 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4304 transitions. Word has length 82 [2019-09-10 08:15:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:13,188 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4304 transitions. [2019-09-10 08:15:13,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4304 transitions. [2019-09-10 08:15:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:13,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:13,190 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:13,190 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:13,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:13,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1555560134, now seen corresponding path program 1 times [2019-09-10 08:15:13,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:13,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:13,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:13,277 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 08:15:13,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:13,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:13,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:13,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:13,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:13,279 INFO L87 Difference]: Start difference. First operand 2865 states and 4304 transitions. Second operand 5 states. [2019-09-10 08:15:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:13,441 INFO L93 Difference]: Finished difference Result 2865 states and 4272 transitions. [2019-09-10 08:15:13,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:13,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:15:13,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:13,457 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 08:15:13,457 INFO L226 Difference]: Without dead ends: 2865 [2019-09-10 08:15:13,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:15:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-10 08:15:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-10 08:15:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4272 transitions. [2019-09-10 08:15:13,528 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4272 transitions. Word has length 82 [2019-09-10 08:15:13,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:13,528 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4272 transitions. [2019-09-10 08:15:13,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:13,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4272 transitions. [2019-09-10 08:15:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:13,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:13,530 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:13,530 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:13,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1275335605, now seen corresponding path program 1 times [2019-09-10 08:15:13,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:13,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:13,630 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 08:15:13,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:13,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:13,631 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:13,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:13,632 INFO L87 Difference]: Start difference. First operand 2865 states and 4272 transitions. Second operand 5 states. [2019-09-10 08:15:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:13,761 INFO L93 Difference]: Finished difference Result 2865 states and 4240 transitions. [2019-09-10 08:15:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:15:13,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 08:15:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:13,776 INFO L225 Difference]: With dead ends: 2865 [2019-09-10 08:15:13,776 INFO L226 Difference]: Without dead ends: 2865 [2019-09-10 08:15:13,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:15:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-09-10 08:15:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2865. [2019-09-10 08:15:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2865 states. [2019-09-10 08:15:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4240 transitions. [2019-09-10 08:15:13,835 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4240 transitions. Word has length 82 [2019-09-10 08:15:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:13,835 INFO L475 AbstractCegarLoop]: Abstraction has 2865 states and 4240 transitions. [2019-09-10 08:15:13,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4240 transitions. [2019-09-10 08:15:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 08:15:13,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:13,837 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:13,837 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1745763686, now seen corresponding path program 1 times [2019-09-10 08:15:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:13,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:14,025 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 08:15:14,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:14,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:14,026 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:14,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:14,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:14,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:14,027 INFO L87 Difference]: Start difference. First operand 2865 states and 4240 transitions. Second operand 8 states. [2019-09-10 08:15:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:14,386 INFO L93 Difference]: Finished difference Result 28227 states and 41465 transitions. [2019-09-10 08:15:14,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:15:14,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-10 08:15:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:14,525 INFO L225 Difference]: With dead ends: 28227 [2019-09-10 08:15:14,525 INFO L226 Difference]: Without dead ends: 28227 [2019-09-10 08:15:14,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:15:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2019-09-10 08:15:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 8497. [2019-09-10 08:15:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8497 states. [2019-09-10 08:15:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 12496 transitions. [2019-09-10 08:15:14,964 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 12496 transitions. Word has length 82 [2019-09-10 08:15:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:14,965 INFO L475 AbstractCegarLoop]: Abstraction has 8497 states and 12496 transitions. [2019-09-10 08:15:14,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 12496 transitions. [2019-09-10 08:15:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:15:14,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:14,966 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:14,967 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 760119925, now seen corresponding path program 1 times [2019-09-10 08:15:14,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:14,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:15,113 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 08:15:15,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:15,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:15:15,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:15,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:15:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:15:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:15:15,115 INFO L87 Difference]: Start difference. First operand 8497 states and 12496 transitions. Second operand 3 states. [2019-09-10 08:15:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:15,173 INFO L93 Difference]: Finished difference Result 12597 states and 18291 transitions. [2019-09-10 08:15:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:15:15,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 08:15:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:15,204 INFO L225 Difference]: With dead ends: 12597 [2019-09-10 08:15:15,204 INFO L226 Difference]: Without dead ends: 12597 [2019-09-10 08:15:15,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 08:15:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12597 states. [2019-09-10 08:15:15,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12597 to 12595. [2019-09-10 08:15:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-10 08:15:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 18290 transitions. [2019-09-10 08:15:15,430 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 18290 transitions. Word has length 84 [2019-09-10 08:15:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:15,431 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 18290 transitions. [2019-09-10 08:15:15,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:15:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 18290 transitions. [2019-09-10 08:15:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 08:15:15,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:15,434 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:15,434 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash 780169268, now seen corresponding path program 1 times [2019-09-10 08:15:15,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:15,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:15,768 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 08:15:15,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:15,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:15,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:15,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:15,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:15,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:15,771 INFO L87 Difference]: Start difference. First operand 12595 states and 18290 transitions. Second operand 8 states. [2019-09-10 08:15:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:16,310 INFO L93 Difference]: Finished difference Result 15417 states and 22389 transitions. [2019-09-10 08:15:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:16,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-10 08:15:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:16,348 INFO L225 Difference]: With dead ends: 15417 [2019-09-10 08:15:16,349 INFO L226 Difference]: Without dead ends: 15417 [2019-09-10 08:15:16,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-10 08:15:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15417 states. [2019-09-10 08:15:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15417 to 12595. [2019-09-10 08:15:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12595 states. [2019-09-10 08:15:16,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12595 states to 12595 states and 18194 transitions. [2019-09-10 08:15:16,563 INFO L78 Accepts]: Start accepts. Automaton has 12595 states and 18194 transitions. Word has length 84 [2019-09-10 08:15:16,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:16,563 INFO L475 AbstractCegarLoop]: Abstraction has 12595 states and 18194 transitions. [2019-09-10 08:15:16,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 12595 states and 18194 transitions. [2019-09-10 08:15:16,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 08:15:16,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:16,564 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:16,564 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:16,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1586465785, now seen corresponding path program 1 times [2019-09-10 08:15:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:16,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:16,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:16,678 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 08:15:16,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:16,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:15:16,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:16,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:15:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:15:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:15:16,680 INFO L87 Difference]: Start difference. First operand 12595 states and 18194 transitions. Second operand 5 states. [2019-09-10 08:15:16,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:16,778 INFO L93 Difference]: Finished difference Result 23557 states and 33649 transitions. [2019-09-10 08:15:16,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:15:16,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 08:15:16,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:16,821 INFO L225 Difference]: With dead ends: 23557 [2019-09-10 08:15:16,821 INFO L226 Difference]: Without dead ends: 23557 [2019-09-10 08:15:16,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:15:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23557 states. [2019-09-10 08:15:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23557 to 13043. [2019-09-10 08:15:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13043 states. [2019-09-10 08:15:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13043 states to 13043 states and 18610 transitions. [2019-09-10 08:15:17,194 INFO L78 Accepts]: Start accepts. Automaton has 13043 states and 18610 transitions. Word has length 85 [2019-09-10 08:15:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:17,195 INFO L475 AbstractCegarLoop]: Abstraction has 13043 states and 18610 transitions. [2019-09-10 08:15:17,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:15:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 13043 states and 18610 transitions. [2019-09-10 08:15:17,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:17,201 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:17,201 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:17,201 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash -784533912, now seen corresponding path program 1 times [2019-09-10 08:15:17,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:17,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:17,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:17,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:15:17,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:17,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:17,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:17,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:17,363 INFO L87 Difference]: Start difference. First operand 13043 states and 18610 transitions. Second operand 8 states. [2019-09-10 08:15:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:17,860 INFO L93 Difference]: Finished difference Result 57919 states and 82808 transitions. [2019-09-10 08:15:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:17,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:17,961 INFO L225 Difference]: With dead ends: 57919 [2019-09-10 08:15:17,961 INFO L226 Difference]: Without dead ends: 57919 [2019-09-10 08:15:17,961 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:15:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57919 states. [2019-09-10 08:15:19,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57919 to 20307. [2019-09-10 08:15:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20307 states. [2019-09-10 08:15:19,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20307 states to 20307 states and 28850 transitions. [2019-09-10 08:15:19,261 INFO L78 Accepts]: Start accepts. Automaton has 20307 states and 28850 transitions. Word has length 115 [2019-09-10 08:15:19,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:19,261 INFO L475 AbstractCegarLoop]: Abstraction has 20307 states and 28850 transitions. [2019-09-10 08:15:19,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:19,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20307 states and 28850 transitions. [2019-09-10 08:15:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:19,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:19,269 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:19,269 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:19,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1354552530, now seen corresponding path program 1 times [2019-09-10 08:15:19,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:19,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:19,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:19,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:19,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:19,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:19,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:19,400 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:15:19,403 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [146], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [341], [344], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:15:19,455 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:19,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:19,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:21,354 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:21,358 INFO L272 AbstractInterpreter]: Visited 107 different actions 983 times. Merged at 60 different actions 759 times. Widened at 24 different actions 140 times. Performed 3703 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3703 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 98 fixpoints after 18 different actions. Largest state had 156 variables. [2019-09-10 08:15:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:21,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:21,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:21,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:15:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:21,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:15:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:21,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:15:21,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:15:21,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 08:15:21,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:15:21,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:15:21,947 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:21,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:21,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:21,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:21,948 INFO L87 Difference]: Start difference. First operand 20307 states and 28850 transitions. Second operand 8 states. [2019-09-10 08:15:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:22,437 INFO L93 Difference]: Finished difference Result 66623 states and 95096 transitions. [2019-09-10 08:15:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:22,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:22,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:22,600 INFO L225 Difference]: With dead ends: 66623 [2019-09-10 08:15:22,600 INFO L226 Difference]: Without dead ends: 66623 [2019-09-10 08:15:22,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66623 states. [2019-09-10 08:15:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66623 to 24691. [2019-09-10 08:15:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24691 states. [2019-09-10 08:15:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24691 states to 24691 states and 35090 transitions. [2019-09-10 08:15:23,490 INFO L78 Accepts]: Start accepts. Automaton has 24691 states and 35090 transitions. Word has length 115 [2019-09-10 08:15:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:23,491 INFO L475 AbstractCegarLoop]: Abstraction has 24691 states and 35090 transitions. [2019-09-10 08:15:23,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24691 states and 35090 transitions. [2019-09-10 08:15:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:23,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:23,508 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:23,508 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1652537018, now seen corresponding path program 1 times [2019-09-10 08:15:23,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:23,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:23,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:23,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:23,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:23,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:23,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:23,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:23,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:15:23,716 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [198], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [241], [244], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:15:23,725 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:23,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:23,772 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:24,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:24,635 INFO L272 AbstractInterpreter]: Visited 107 different actions 1013 times. Merged at 60 different actions 785 times. Widened at 27 different actions 137 times. Performed 3688 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3688 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 105 fixpoints after 26 different actions. Largest state had 156 variables. [2019-09-10 08:15:24,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:24,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:24,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:24,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:15:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:24,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:15:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:24,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:15:24,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:15:24,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:15:25,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:15:25,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:15:25,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:25,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:25,126 INFO L87 Difference]: Start difference. First operand 24691 states and 35090 transitions. Second operand 8 states. [2019-09-10 08:15:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:25,709 INFO L93 Difference]: Finished difference Result 53469 states and 75991 transitions. [2019-09-10 08:15:25,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:25,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:25,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:25,849 INFO L225 Difference]: With dead ends: 53469 [2019-09-10 08:15:25,849 INFO L226 Difference]: Without dead ends: 53469 [2019-09-10 08:15:25,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:25,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53469 states. [2019-09-10 08:15:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53469 to 33299. [2019-09-10 08:15:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33299 states. [2019-09-10 08:15:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33299 states to 33299 states and 47218 transitions. [2019-09-10 08:15:26,452 INFO L78 Accepts]: Start accepts. Automaton has 33299 states and 47218 transitions. Word has length 115 [2019-09-10 08:15:26,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:26,452 INFO L475 AbstractCegarLoop]: Abstraction has 33299 states and 47218 transitions. [2019-09-10 08:15:26,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33299 states and 47218 transitions. [2019-09-10 08:15:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:26,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:26,461 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:26,461 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1676282240, now seen corresponding path program 1 times [2019-09-10 08:15:26,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:26,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:26,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:26,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:26,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:26,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:26,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:26,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 116 with the following transitions: [2019-09-10 08:15:26,593 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [185], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [266], [269], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:15:26,602 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:26,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:26,656 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:27,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:27,479 INFO L272 AbstractInterpreter]: Visited 107 different actions 968 times. Merged at 60 different actions 744 times. Widened at 27 different actions 147 times. Performed 3662 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3662 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 98 fixpoints after 25 different actions. Largest state had 156 variables. [2019-09-10 08:15:27,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:27,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:27,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:27,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:15:27,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:27,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:15:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:27,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:15:27,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:15:27,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:15:27,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:15:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 8] total 15 [2019-09-10 08:15:27,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:27,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:27,963 INFO L87 Difference]: Start difference. First operand 33299 states and 47218 transitions. Second operand 8 states. [2019-09-10 08:15:28,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:28,904 INFO L93 Difference]: Finished difference Result 62079 states and 88120 transitions. [2019-09-10 08:15:28,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:28,905 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:28,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:28,997 INFO L225 Difference]: With dead ends: 62079 [2019-09-10 08:15:28,997 INFO L226 Difference]: Without dead ends: 62079 [2019-09-10 08:15:28,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:15:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62079 states. [2019-09-10 08:15:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62079 to 41907. [2019-09-10 08:15:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41907 states. [2019-09-10 08:15:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41907 states to 41907 states and 59346 transitions. [2019-09-10 08:15:29,697 INFO L78 Accepts]: Start accepts. Automaton has 41907 states and 59346 transitions. Word has length 115 [2019-09-10 08:15:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:29,697 INFO L475 AbstractCegarLoop]: Abstraction has 41907 states and 59346 transitions. [2019-09-10 08:15:29,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 41907 states and 59346 transitions. [2019-09-10 08:15:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:29,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:29,708 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:29,708 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2048808134, now seen corresponding path program 1 times [2019-09-10 08:15:29,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:29,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:29,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:29,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:15:29,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:29,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:29,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:29,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:29,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:29,918 INFO L87 Difference]: Start difference. First operand 41907 states and 59346 transitions. Second operand 8 states. [2019-09-10 08:15:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:30,355 INFO L93 Difference]: Finished difference Result 70687 states and 100248 transitions. [2019-09-10 08:15:30,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:30,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:30,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:30,765 INFO L225 Difference]: With dead ends: 70687 [2019-09-10 08:15:30,766 INFO L226 Difference]: Without dead ends: 70687 [2019-09-10 08:15:30,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70687 states. [2019-09-10 08:15:31,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70687 to 50515. [2019-09-10 08:15:31,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-10 08:15:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 71474 transitions. [2019-09-10 08:15:31,692 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 71474 transitions. Word has length 115 [2019-09-10 08:15:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:31,693 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 71474 transitions. [2019-09-10 08:15:31,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 71474 transitions. [2019-09-10 08:15:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 08:15:31,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:31,712 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:31,712 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash 333801332, now seen corresponding path program 1 times [2019-09-10 08:15:31,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:31,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:31,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:31,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:15:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:15:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:15:31,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:15:31,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:15:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:15:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:15:31,996 INFO L87 Difference]: Start difference. First operand 50515 states and 71474 transitions. Second operand 8 states. [2019-09-10 08:15:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:32,429 INFO L93 Difference]: Finished difference Result 79295 states and 112376 transitions. [2019-09-10 08:15:32,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:15:32,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-09-10 08:15:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:32,540 INFO L225 Difference]: With dead ends: 79295 [2019-09-10 08:15:32,540 INFO L226 Difference]: Without dead ends: 79295 [2019-09-10 08:15:32,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:15:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79295 states. [2019-09-10 08:15:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79295 to 59123. [2019-09-10 08:15:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59123 states. [2019-09-10 08:15:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59123 states to 59123 states and 83602 transitions. [2019-09-10 08:15:34,612 INFO L78 Accepts]: Start accepts. Automaton has 59123 states and 83602 transitions. Word has length 115 [2019-09-10 08:15:34,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:34,612 INFO L475 AbstractCegarLoop]: Abstraction has 59123 states and 83602 transitions. [2019-09-10 08:15:34,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:15:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59123 states and 83602 transitions. [2019-09-10 08:15:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 08:15:34,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:34,624 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:34,624 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:34,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash 90667176, now seen corresponding path program 1 times [2019-09-10 08:15:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:34,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:34,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:15:34,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:34,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:34,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2019-09-10 08:15:34,721 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [138], [140], [143], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [211], [215], [217], [220], [221], [223], [225], [230], [232], [235], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [348], [350], [353], [356], [358], [373], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:15:34,723 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:34,723 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:34,748 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:35,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:35,563 INFO L272 AbstractInterpreter]: Visited 107 different actions 1043 times. Merged at 60 different actions 799 times. Widened at 29 different actions 150 times. Performed 3911 root evaluator evaluations with a maximum evaluation depth of 8. Performed 3911 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 124 fixpoints after 29 different actions. Largest state had 156 variables. [2019-09-10 08:15:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:35,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:35,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:35,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:15:35,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:35,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:15:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:35,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:15:35,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:36,120 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:36,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:36,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:15:36,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 08:15:36,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:15:36,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:15:36,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:15:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:15:36,427 INFO L87 Difference]: Start difference. First operand 59123 states and 83602 transitions. Second operand 12 states. [2019-09-10 08:15:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:15:42,607 INFO L93 Difference]: Finished difference Result 420045 states and 583511 transitions. [2019-09-10 08:15:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-10 08:15:42,609 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 116 [2019-09-10 08:15:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:15:43,181 INFO L225 Difference]: With dead ends: 420045 [2019-09-10 08:15:43,181 INFO L226 Difference]: Without dead ends: 420045 [2019-09-10 08:15:43,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1274, Invalid=3696, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 08:15:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420045 states. [2019-09-10 08:15:49,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420045 to 213555. [2019-09-10 08:15:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213555 states. [2019-09-10 08:15:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213555 states to 213555 states and 298210 transitions. [2019-09-10 08:15:49,510 INFO L78 Accepts]: Start accepts. Automaton has 213555 states and 298210 transitions. Word has length 116 [2019-09-10 08:15:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:15:49,510 INFO L475 AbstractCegarLoop]: Abstraction has 213555 states and 298210 transitions. [2019-09-10 08:15:49,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:15:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 213555 states and 298210 transitions. [2019-09-10 08:15:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 08:15:49,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:15:49,525 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:15:49,525 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:15:49,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -827392191, now seen corresponding path program 1 times [2019-09-10 08:15:49,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:15:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:15:49,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:15:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:49,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:49,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:15:49,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 118 with the following transitions: [2019-09-10 08:15:49,763 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [123], [127], [130], [133], [138], [140], [143], [146], [151], [153], [156], [164], [166], [169], [177], [179], [182], [190], [192], [195], [203], [205], [208], [215], [217], [220], [221], [223], [232], [235], [239], [248], [250], [253], [256], [258], [273], [275], [278], [281], [283], [298], [300], [303], [306], [308], [323], [325], [328], [331], [333], [341], [344], [350], [353], [356], [358], [366], [369], [375], [378], [381], [383], [434], [435], [439], [440], [441] [2019-09-10 08:15:49,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:15:49,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:15:49,795 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:15:50,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:15:50,421 INFO L272 AbstractInterpreter]: Visited 109 different actions 893 times. Merged at 62 different actions 684 times. Widened at 22 different actions 110 times. Performed 3438 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3438 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 88 fixpoints after 19 different actions. Largest state had 156 variables. [2019-09-10 08:15:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:15:50,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:15:50,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:15:50,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:15:50,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:15:50,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:15:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:15:53,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:15:53,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:15:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:53,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:15:53,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:15:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:15:53,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:15:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2019-09-10 08:15:53,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:15:53,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:15:53,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:15:53,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-09-10 08:15:53,888 INFO L87 Difference]: Start difference. First operand 213555 states and 298210 transitions. Second operand 17 states. [2019-09-10 08:16:10,083 WARN L188 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-10 08:16:10,348 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-09-10 08:16:11,149 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-10 08:16:11,323 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:16:13,035 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-09-10 08:16:55,695 WARN L188 SmtUtils]: Spent 11.95 s on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-10 08:17:01,534 WARN L188 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2019-09-10 08:17:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:54,075 INFO L93 Difference]: Finished difference Result 6996629 states and 9527887 transitions. [2019-09-10 08:17:54,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 411 states. [2019-09-10 08:17:54,076 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2019-09-10 08:17:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:24,480 INFO L225 Difference]: With dead ends: 6996629 [2019-09-10 08:18:24,480 INFO L226 Difference]: Without dead ends: 6996629 [2019-09-10 08:18:24,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84610 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=19376, Invalid=165954, Unknown=0, NotChecked=0, Total=185330 [2019-09-10 08:18:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996629 states.