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/eca-rers2012/Problem14_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 18:26:33,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 18:26:33,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 18:26:33,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 18:26:33,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 18:26:33,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 18:26:33,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 18:26:33,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 18:26:33,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 18:26:33,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 18:26:33,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 18:26:33,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 18:26:33,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 18:26:33,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 18:26:33,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 18:26:33,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 18:26:33,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 18:26:33,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 18:26:33,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 18:26:33,124 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 18:26:33,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 18:26:33,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 18:26:33,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 18:26:33,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 18:26:33,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 18:26:33,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 18:26:33,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 18:26:33,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 18:26:33,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 18:26:33,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 18:26:33,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 18:26:33,134 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 18:26:33,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 18:26:33,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 18:26:33,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 18:26:33,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 18:26:33,137 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 18:26:33,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 18:26:33,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 18:26:33,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 18:26:33,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 18:26:33,140 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-09 18:26:33,155 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 18:26:33,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 18:26:33,155 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 18:26:33,156 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 18:26:33,159 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 18:26:33,160 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 18:26:33,160 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 18:26:33,160 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 18:26:33,160 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 18:26:33,160 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 18:26:33,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 18:26:33,161 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 18:26:33,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 18:26:33,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 18:26:33,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 18:26:33,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 18:26:33,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 18:26:33,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 18:26:33,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 18:26:33,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 18:26:33,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 18:26:33,165 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 18:26:33,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 18:26:33,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 18:26:33,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 18:26:33,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 18:26:33,167 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 18:26:33,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 18:26:33,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 18:26:33,167 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 18:26:33,217 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 18:26:33,235 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 18:26:33,238 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 18:26:33,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 18:26:33,240 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 18:26:33,241 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label39.c [2019-09-09 18:26:33,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86acfdcca/b29b033063544a0b8b1c050b221a728e/FLAGf85b73087 [2019-09-09 18:26:33,881 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 18:26:33,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label39.c [2019-09-09 18:26:33,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86acfdcca/b29b033063544a0b8b1c050b221a728e/FLAGf85b73087 [2019-09-09 18:26:34,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86acfdcca/b29b033063544a0b8b1c050b221a728e [2019-09-09 18:26:34,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 18:26:34,178 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 18:26:34,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 18:26:34,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 18:26:34,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 18:26:34,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:26:34" (1/1) ... [2019-09-09 18:26:34,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@695cd166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:34, skipping insertion in model container [2019-09-09 18:26:34,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 06:26:34" (1/1) ... [2019-09-09 18:26:34,196 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 18:26:34,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 18:26:34,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:26:34,891 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 18:26:35,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 18:26:35,024 INFO L192 MainTranslator]: Completed translation [2019-09-09 18:26:35,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35 WrapperNode [2019-09-09 18:26:35,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 18:26:35,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 18:26:35,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 18:26:35,026 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 18:26:35,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (1/1) ... [2019-09-09 18:26:35,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 18:26:35,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 18:26:35,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 18:26:35,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 18:26:35,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (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-09 18:26:35,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 18:26:35,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 18:26:35,286 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 18:26:35,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 18:26:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 18:26:35,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 18:26:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 18:26:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 18:26:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 18:26:35,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 18:26:35,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 18:26:36,990 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 18:26:36,990 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 18:26:36,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:26:36 BoogieIcfgContainer [2019-09-09 18:26:36,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 18:26:36,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 18:26:36,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 18:26:36,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 18:26:36,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 06:26:34" (1/3) ... [2019-09-09 18:26:36,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b6e8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:26:36, skipping insertion in model container [2019-09-09 18:26:36,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 06:26:35" (2/3) ... [2019-09-09 18:26:36,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b6e8db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 06:26:36, skipping insertion in model container [2019-09-09 18:26:36,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 06:26:36" (3/3) ... [2019-09-09 18:26:37,000 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label39.c [2019-09-09 18:26:37,010 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 18:26:37,018 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 18:26:37,036 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 18:26:37,067 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 18:26:37,068 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 18:26:37,068 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 18:26:37,069 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 18:26:37,069 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 18:26:37,069 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 18:26:37,069 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 18:26:37,069 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 18:26:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-09-09 18:26:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-09 18:26:37,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:26:37,122 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] [2019-09-09 18:26:37,124 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:26:37,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1874699218, now seen corresponding path program 1 times [2019-09-09 18:26:37,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:26:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:37,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:26:37,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:37,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:26:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:26:37,441 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-09 18:26:37,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:26:37,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 18:26:37,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:26:37,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 18:26:37,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 18:26:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 18:26:37,473 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-09-09 18:26:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:26:38,849 INFO L93 Difference]: Finished difference Result 440 states and 711 transitions. [2019-09-09 18:26:38,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 18:26:38,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-09 18:26:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:26:38,869 INFO L225 Difference]: With dead ends: 440 [2019-09-09 18:26:38,870 INFO L226 Difference]: Without dead ends: 372 [2019-09-09 18:26:38,872 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-09 18:26:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-09 18:26:38,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-09-09 18:26:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-09 18:26:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-09-09 18:26:38,958 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 31 [2019-09-09 18:26:38,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:26:38,958 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-09-09 18:26:38,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 18:26:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-09-09 18:26:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-09 18:26:38,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:26:38,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:26:38,965 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:26:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:38,965 INFO L82 PathProgramCache]: Analyzing trace with hash -226444274, now seen corresponding path program 1 times [2019-09-09 18:26:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:26:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:26:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:38,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:26:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:26:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:26:39,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:26:39,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 18:26:39,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:26:39,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 18:26:39,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 18:26:39,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-09 18:26:39,238 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-09-09 18:26:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:26:40,541 INFO L93 Difference]: Finished difference Result 570 states and 828 transitions. [2019-09-09 18:26:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 18:26:40,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-09 18:26:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:26:40,548 INFO L225 Difference]: With dead ends: 570 [2019-09-09 18:26:40,548 INFO L226 Difference]: Without dead ends: 570 [2019-09-09 18:26:40,549 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-09 18:26:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-09 18:26:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-09-09 18:26:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-09 18:26:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-09-09 18:26:40,595 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 117 [2019-09-09 18:26:40,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:26:40,595 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-09-09 18:26:40,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 18:26:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-09-09 18:26:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-09 18:26:40,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:26:40,601 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 18:26:40,602 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:26:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1934645859, now seen corresponding path program 1 times [2019-09-09 18:26:40,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:26:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:26:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:40,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:26:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:26:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:26:40,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:26:40,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 18:26:40,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:26:40,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 18:26:40,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 18:26:40,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:26:40,780 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-09-09 18:26:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:26:42,185 INFO L93 Difference]: Finished difference Result 1480 states and 2131 transitions. [2019-09-09 18:26:42,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 18:26:42,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-09 18:26:42,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:26:42,196 INFO L225 Difference]: With dead ends: 1480 [2019-09-09 18:26:42,196 INFO L226 Difference]: Without dead ends: 1480 [2019-09-09 18:26:42,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:26:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-09 18:26:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-09-09 18:26:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-09-09 18:26:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2131 transitions. [2019-09-09 18:26:42,258 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2131 transitions. Word has length 126 [2019-09-09 18:26:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:26:42,268 INFO L475 AbstractCegarLoop]: Abstraction has 1480 states and 2131 transitions. [2019-09-09 18:26:42,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 18:26:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2131 transitions. [2019-09-09 18:26:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-09 18:26:42,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:26:42,282 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:26:42,282 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:26:42,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 100331742, now seen corresponding path program 1 times [2019-09-09 18:26:42,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:26:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:42,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:26:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:42,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:26:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:26:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-09 18:26:42,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 18:26:42,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 18:26:42,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:26:42,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 18:26:42,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 18:26:42,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:26:42,516 INFO L87 Difference]: Start difference. First operand 1480 states and 2131 transitions. Second operand 4 states. [2019-09-09 18:26:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:26:44,003 INFO L93 Difference]: Finished difference Result 3678 states and 4988 transitions. [2019-09-09 18:26:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 18:26:44,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-09-09 18:26:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:26:44,033 INFO L225 Difference]: With dead ends: 3678 [2019-09-09 18:26:44,033 INFO L226 Difference]: Without dead ends: 3678 [2019-09-09 18:26:44,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 18:26:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-09-09 18:26:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3314. [2019-09-09 18:26:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3314 states. [2019-09-09 18:26:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 4468 transitions. [2019-09-09 18:26:44,194 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 4468 transitions. Word has length 229 [2019-09-09 18:26:44,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:26:44,196 INFO L475 AbstractCegarLoop]: Abstraction has 3314 states and 4468 transitions. [2019-09-09 18:26:44,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 18:26:44,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 4468 transitions. [2019-09-09 18:26:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-09 18:26:44,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:26:44,204 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:26:44,204 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:26:44,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1088808263, now seen corresponding path program 1 times [2019-09-09 18:26:44,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:26:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:44,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:26:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:26:44,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:26:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:26:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 147 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 18:26:45,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:26:45,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:26:45,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2019-09-09 18:26:45,166 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:26:45,232 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:26:45,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:26:55,692 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:26:55,694 INFO L272 AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Performed 273 root evaluator evaluations with a maximum evaluation depth of 13. Performed 273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-09-09 18:26:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:26:55,699 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:27:05,264 INFO L227 lantSequenceWeakener]: Weakened 225 states. On average, predicates are now at 77.66% of their original sizes. [2019-09-09 18:27:05,264 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:27:05,364 INFO L420 sIntCurrentIteration]: We unified 243 AI predicates to 243 [2019-09-09 18:27:05,365 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:27:05,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:27:05,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2019-09-09 18:27:05,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:27:05,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 18:27:05,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 18:27:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-09 18:27:05,368 INFO L87 Difference]: Start difference. First operand 3314 states and 4468 transitions. Second operand 11 states. [2019-09-09 18:28:35,889 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:29:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:29:35,029 INFO L93 Difference]: Finished difference Result 3500 states and 4665 transitions. [2019-09-09 18:29:35,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-09 18:29:35,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 244 [2019-09-09 18:29:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:29:35,046 INFO L225 Difference]: With dead ends: 3500 [2019-09-09 18:29:35,046 INFO L226 Difference]: Without dead ends: 3500 [2019-09-09 18:29:35,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-09-09 18:29:35,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2019-09-09 18:29:35,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 3496. [2019-09-09 18:29:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3496 states. [2019-09-09 18:29:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4658 transitions. [2019-09-09 18:29:35,130 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4658 transitions. Word has length 244 [2019-09-09 18:29:35,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:29:35,130 INFO L475 AbstractCegarLoop]: Abstraction has 3496 states and 4658 transitions. [2019-09-09 18:29:35,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 18:29:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4658 transitions. [2019-09-09 18:29:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-09 18:29:35,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:29:35,139 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:29:35,139 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:29:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:29:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 790102881, now seen corresponding path program 1 times [2019-09-09 18:29:35,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:29:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:29:35,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:29:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:29:35,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:29:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:29:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 158 proven. 179 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 18:29:36,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:29:36,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:29:36,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 329 with the following transitions: [2019-09-09 18:29:36,141 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:29:36,156 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:29:36,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:29:47,463 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:29:47,464 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 485 root evaluator evaluations with a maximum evaluation depth of 13. Performed 485 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 18:29:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:29:47,464 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:29:52,255 INFO L227 lantSequenceWeakener]: Weakened 325 states. On average, predicates are now at 77.47% of their original sizes. [2019-09-09 18:29:52,258 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:29:52,337 INFO L420 sIntCurrentIteration]: We unified 327 AI predicates to 327 [2019-09-09 18:29:52,337 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:29:52,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:29:52,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-09-09 18:29:52,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:29:52,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 18:29:52,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 18:29:52,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-09 18:29:52,339 INFO L87 Difference]: Start difference. First operand 3496 states and 4658 transitions. Second operand 11 states. [2019-09-09 18:30:27,219 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:30:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:30:55,210 INFO L93 Difference]: Finished difference Result 3712 states and 4884 transitions. [2019-09-09 18:30:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 18:30:55,210 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 328 [2019-09-09 18:30:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:30:55,227 INFO L225 Difference]: With dead ends: 3712 [2019-09-09 18:30:55,228 INFO L226 Difference]: Without dead ends: 3712 [2019-09-09 18:30:55,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-09-09 18:30:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2019-09-09 18:30:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3496. [2019-09-09 18:30:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3496 states. [2019-09-09 18:30:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4657 transitions. [2019-09-09 18:30:55,345 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4657 transitions. Word has length 328 [2019-09-09 18:30:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:30:55,345 INFO L475 AbstractCegarLoop]: Abstraction has 3496 states and 4657 transitions. [2019-09-09 18:30:55,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 18:30:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4657 transitions. [2019-09-09 18:30:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-09 18:30:55,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:30:55,354 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:30:55,354 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:30:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:30:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1298884429, now seen corresponding path program 1 times [2019-09-09 18:30:55,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:30:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:30:55,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:30:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:30:55,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:30:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:30:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 83 proven. 297 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 18:30:57,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:30:57,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:30:57,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 355 with the following transitions: [2019-09-09 18:30:57,088 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:30:57,091 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:30:57,091 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:31:11,830 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:31:11,831 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 565 root evaluator evaluations with a maximum evaluation depth of 13. Performed 565 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 18:31:11,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:31:11,831 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:31:24,863 INFO L227 lantSequenceWeakener]: Weakened 351 states. On average, predicates are now at 77.46% of their original sizes. [2019-09-09 18:31:24,864 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:31:24,950 INFO L420 sIntCurrentIteration]: We unified 353 AI predicates to 353 [2019-09-09 18:31:24,950 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:31:24,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:31:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2019-09-09 18:31:24,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:31:24,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-09 18:31:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-09 18:31:24,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-09 18:31:24,953 INFO L87 Difference]: Start difference. First operand 3496 states and 4657 transitions. Second operand 11 states. [2019-09-09 18:32:08,877 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:33:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:33:50,877 INFO L93 Difference]: Finished difference Result 3864 states and 5040 transitions. [2019-09-09 18:33:50,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-09 18:33:50,878 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 354 [2019-09-09 18:33:50,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:33:50,894 INFO L225 Difference]: With dead ends: 3864 [2019-09-09 18:33:50,895 INFO L226 Difference]: Without dead ends: 3864 [2019-09-09 18:33:50,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-09-09 18:33:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-09-09 18:33:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3862. [2019-09-09 18:33:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-09-09 18:33:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 5038 transitions. [2019-09-09 18:33:50,973 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 5038 transitions. Word has length 354 [2019-09-09 18:33:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:33:50,974 INFO L475 AbstractCegarLoop]: Abstraction has 3862 states and 5038 transitions. [2019-09-09 18:33:50,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-09 18:33:50,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 5038 transitions. [2019-09-09 18:33:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-09 18:33:50,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:33:50,987 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:33:50,987 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:33:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:33:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1844237835, now seen corresponding path program 1 times [2019-09-09 18:33:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:33:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:33:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:33:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:33:50,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:33:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:33:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 186 proven. 209 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-09 18:33:51,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:33:51,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:33:51,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 439 with the following transitions: [2019-09-09 18:33:51,339 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:33:51,346 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:33:51,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:34:06,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 18:34:06,417 INFO L272 AbstractInterpreter]: Visited 123 different actions 365 times. Merged at 6 different actions 18 times. Never widened. Performed 666 root evaluator evaluations with a maximum evaluation depth of 13. Performed 666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-09-09 18:34:06,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:34:06,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 18:34:06,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:34:06,419 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-09 18:34:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:34:06,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 18:34:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:34:06,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-09 18:34:06,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 18:34:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 507 proven. 2 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-09 18:34:06,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 18:34:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 186 proven. 209 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-09 18:34:07,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 18:34:07,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2019-09-09 18:34:07,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 18:34:07,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 18:34:07,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 18:34:07,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-09 18:34:07,083 INFO L87 Difference]: Start difference. First operand 3862 states and 5038 transitions. Second operand 9 states. [2019-09-09 18:34:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:34:11,123 INFO L93 Difference]: Finished difference Result 4642 states and 5330 transitions. [2019-09-09 18:34:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-09 18:34:11,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 438 [2019-09-09 18:34:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:34:11,141 INFO L225 Difference]: With dead ends: 4642 [2019-09-09 18:34:11,142 INFO L226 Difference]: Without dead ends: 4458 [2019-09-09 18:34:11,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 892 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=704, Unknown=0, NotChecked=0, Total=930 [2019-09-09 18:34:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2019-09-09 18:34:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 2802. [2019-09-09 18:34:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-09-09 18:34:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3273 transitions. [2019-09-09 18:34:11,216 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3273 transitions. Word has length 438 [2019-09-09 18:34:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:34:11,217 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 3273 transitions. [2019-09-09 18:34:11,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 18:34:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3273 transitions. [2019-09-09 18:34:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-09-09 18:34:11,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:34:11,228 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:34:11,229 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:34:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:34:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash -200402102, now seen corresponding path program 1 times [2019-09-09 18:34:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:34:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:34:11,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:34:11,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:34:11,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:34:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:34:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 202 proven. 463 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-09 18:34:12,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:34:12,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:34:12,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 442 with the following transitions: [2019-09-09 18:34:12,033 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:34:12,035 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:34:12,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:34:30,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 18:34:30,706 INFO L272 AbstractInterpreter]: Visited 123 different actions 358 times. Merged at 6 different actions 11 times. Never widened. Performed 720 root evaluator evaluations with a maximum evaluation depth of 13. Performed 720 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 1 different actions. Largest state had 24 variables. [2019-09-09 18:34:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:34:30,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 18:34:30,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:34:30,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 18:34:30,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:34:30,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 18:34:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:34:30,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-09 18:34:30,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 18:34:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 18:34:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 425 proven. 135 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-09 18:34:31,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 18:34:31,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-09 18:34:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 115 proven. 466 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-09 18:34:31,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-09 18:34:31,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 24 [2019-09-09 18:34:31,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-09 18:34:31,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-09 18:34:31,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-09 18:34:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2019-09-09 18:34:31,875 INFO L87 Difference]: Start difference. First operand 2802 states and 3273 transitions. Second operand 19 states. [2019-09-09 18:34:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:34:38,435 INFO L93 Difference]: Finished difference Result 3275 states and 3790 transitions. [2019-09-09 18:34:38,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-09 18:34:38,436 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 441 [2019-09-09 18:34:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:34:38,450 INFO L225 Difference]: With dead ends: 3275 [2019-09-09 18:34:38,450 INFO L226 Difference]: Without dead ends: 3228 [2019-09-09 18:34:38,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 945 GetRequests, 897 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2019-09-09 18:34:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2019-09-09 18:34:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2996. [2019-09-09 18:34:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2019-09-09 18:34:38,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 3347 transitions. [2019-09-09 18:34:38,514 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 3347 transitions. Word has length 441 [2019-09-09 18:34:38,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:34:38,515 INFO L475 AbstractCegarLoop]: Abstraction has 2996 states and 3347 transitions. [2019-09-09 18:34:38,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-09 18:34:38,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 3347 transitions. [2019-09-09 18:34:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-09-09 18:34:38,531 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:34:38,531 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-09 18:34:38,532 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:34:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:34:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 575927441, now seen corresponding path program 1 times [2019-09-09 18:34:38,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:34:38,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:34:38,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:34:38,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:34:38,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:34:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:34:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 325 proven. 303 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-09 18:34:39,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:34:39,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:34:39,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 531 with the following transitions: [2019-09-09 18:34:39,706 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:34:39,710 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:34:39,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:35:06,356 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:36:04,615 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:36:04,616 INFO L272 AbstractInterpreter]: Visited 189 different actions 744 times. Merged at 6 different actions 18 times. Never widened. Performed 1273 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1273 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-09-09 18:36:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:36:04,616 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:36:23,211 INFO L227 lantSequenceWeakener]: Weakened 527 states. On average, predicates are now at 77.41% of their original sizes. [2019-09-09 18:36:23,212 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:36:23,282 INFO L420 sIntCurrentIteration]: We unified 529 AI predicates to 529 [2019-09-09 18:36:23,282 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:36:23,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:36:23,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2019-09-09 18:36:23,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:36:23,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 18:36:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 18:36:23,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 18:36:23,284 INFO L87 Difference]: Start difference. First operand 2996 states and 3347 transitions. Second operand 10 states. [2019-09-09 18:37:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 18:37:48,004 INFO L93 Difference]: Finished difference Result 3369 states and 3727 transitions. [2019-09-09 18:37:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 18:37:48,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 530 [2019-09-09 18:37:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 18:37:48,015 INFO L225 Difference]: With dead ends: 3369 [2019-09-09 18:37:48,015 INFO L226 Difference]: Without dead ends: 3369 [2019-09-09 18:37:48,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-09-09 18:37:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2019-09-09 18:37:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3364. [2019-09-09 18:37:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3364 states. [2019-09-09 18:37:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 3722 transitions. [2019-09-09 18:37:48,065 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 3722 transitions. Word has length 530 [2019-09-09 18:37:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 18:37:48,066 INFO L475 AbstractCegarLoop]: Abstraction has 3364 states and 3722 transitions. [2019-09-09 18:37:48,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-09 18:37:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 3722 transitions. [2019-09-09 18:37:48,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-09-09 18:37:48,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 18:37:48,076 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 18:37:48,077 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 18:37:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:37:48,077 INFO L82 PathProgramCache]: Analyzing trace with hash -810815802, now seen corresponding path program 1 times [2019-09-09 18:37:48,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 18:37:48,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:37:48,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 18:37:48,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 18:37:48,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 18:37:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 18:37:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 356 proven. 258 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-09-09 18:37:48,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 18:37:48,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 18:37:48,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 690 with the following transitions: [2019-09-09 18:37:48,612 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [157], [159], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-09-09 18:37:48,614 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 18:37:48,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 18:38:15,238 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 18:40:13,274 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 18:40:13,276 INFO L272 AbstractInterpreter]: Visited 190 different actions 1131 times. Merged at 7 different actions 41 times. Widened at 1 different actions 1 times. Performed 1962 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1962 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2019-09-09 18:40:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 18:40:13,276 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 18:40:37,551 INFO L227 lantSequenceWeakener]: Weakened 686 states. On average, predicates are now at 77.38% of their original sizes. [2019-09-09 18:40:37,551 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 18:40:37,619 INFO L420 sIntCurrentIteration]: We unified 688 AI predicates to 688 [2019-09-09 18:40:37,619 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 18:40:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 18:40:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-09-09 18:40:37,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 18:40:37,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-09 18:40:37,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-09 18:40:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-09 18:40:37,621 INFO L87 Difference]: Start difference. First operand 3364 states and 3722 transitions. Second operand 10 states.