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/Problem16_label02.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 21:15:18,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 21:15:18,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 21:15:18,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 21:15:18,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 21:15:18,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 21:15:18,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 21:15:18,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 21:15:18,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 21:15:18,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 21:15:18,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 21:15:18,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 21:15:18,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 21:15:18,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 21:15:18,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 21:15:18,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 21:15:18,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 21:15:18,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 21:15:18,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 21:15:18,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 21:15:18,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 21:15:18,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 21:15:18,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 21:15:18,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 21:15:18,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 21:15:18,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 21:15:18,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 21:15:18,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 21:15:18,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 21:15:18,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 21:15:18,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 21:15:18,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 21:15:18,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 21:15:18,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 21:15:18,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 21:15:18,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 21:15:18,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 21:15:18,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 21:15:18,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 21:15:18,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 21:15:18,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 21:15:18,168 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-10-02 21:15:18,190 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 21:15:18,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 21:15:18,190 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 21:15:18,191 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 21:15:18,191 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 21:15:18,192 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 21:15:18,192 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 21:15:18,192 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 21:15:18,192 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 21:15:18,192 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 21:15:18,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 21:15:18,193 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 21:15:18,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 21:15:18,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 21:15:18,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 21:15:18,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 21:15:18,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 21:15:18,195 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 21:15:18,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 21:15:18,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 21:15:18,195 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 21:15:18,196 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 21:15:18,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 21:15:18,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 21:15:18,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 21:15:18,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 21:15:18,197 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 21:15:18,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 21:15:18,197 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 21:15:18,197 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 21:15:18,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 21:15:18,240 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 21:15:18,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 21:15:18,245 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 21:15:18,246 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 21:15:18,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label02.c [2019-10-02 21:15:18,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419ec4ed/6b4fa255061640ac80fc328136f7980b/FLAGe679b62da [2019-10-02 21:15:18,988 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 21:15:18,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label02.c [2019-10-02 21:15:19,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419ec4ed/6b4fa255061640ac80fc328136f7980b/FLAGe679b62da [2019-10-02 21:15:19,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7419ec4ed/6b4fa255061640ac80fc328136f7980b [2019-10-02 21:15:19,218 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 21:15:19,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 21:15:19,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 21:15:19,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 21:15:19,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 21:15:19,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:15:19" (1/1) ... [2019-10-02 21:15:19,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53500b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:19, skipping insertion in model container [2019-10-02 21:15:19,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:15:19" (1/1) ... [2019-10-02 21:15:19,237 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 21:15:19,305 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 21:15:20,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:15:20,165 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 21:15:20,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:15:20,511 INFO L192 MainTranslator]: Completed translation [2019-10-02 21:15:20,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20 WrapperNode [2019-10-02 21:15:20,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 21:15:20,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 21:15:20,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 21:15:20,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 21:15:20,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (1/1) ... [2019-10-02 21:15:20,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 21:15:20,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 21:15:20,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 21:15:20,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 21:15:20,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (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-10-02 21:15:20,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 21:15:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 21:15:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 21:15:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 21:15:20,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 21:15:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 21:15:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 21:15:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 21:15:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 21:15:20,767 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 21:15:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 21:15:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 21:15:20,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 21:15:23,173 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 21:15:23,174 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 21:15:23,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:15:23 BoogieIcfgContainer [2019-10-02 21:15:23,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 21:15:23,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 21:15:23,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 21:15:23,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 21:15:23,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:15:19" (1/3) ... [2019-10-02 21:15:23,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad88fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:15:23, skipping insertion in model container [2019-10-02 21:15:23,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:15:20" (2/3) ... [2019-10-02 21:15:23,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad88fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:15:23, skipping insertion in model container [2019-10-02 21:15:23,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:15:23" (3/3) ... [2019-10-02 21:15:23,187 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label02.c [2019-10-02 21:15:23,199 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 21:15:23,211 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 21:15:23,229 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 21:15:23,267 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 21:15:23,267 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 21:15:23,267 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 21:15:23,267 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 21:15:23,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 21:15:23,268 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 21:15:23,268 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 21:15:23,268 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 21:15:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 21:15:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 21:15:23,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:23,329 INFO L411 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] [2019-10-02 21:15:23,332 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -64019710, now seen corresponding path program 1 times [2019-10-02 21:15:23,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:23,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:23,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:23,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:15:23,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:23,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:15:23,819 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:23,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:15:23,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:15:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:15:23,843 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-10-02 21:15:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:27,548 INFO L93 Difference]: Finished difference Result 1106 states and 1888 transitions. [2019-10-02 21:15:27,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:15:27,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-10-02 21:15:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:27,578 INFO L225 Difference]: With dead ends: 1106 [2019-10-02 21:15:27,579 INFO L226 Difference]: Without dead ends: 1019 [2019-10-02 21:15:27,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-02 21:15:27,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-02 21:15:27,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-10-02 21:15:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-02 21:15:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1739 transitions. [2019-10-02 21:15:27,712 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1739 transitions. Word has length 67 [2019-10-02 21:15:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:27,713 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1739 transitions. [2019-10-02 21:15:27,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:15:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1739 transitions. [2019-10-02 21:15:27,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 21:15:27,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:27,724 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 21:15:27,724 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:27,725 INFO L82 PathProgramCache]: Analyzing trace with hash -2118195102, now seen corresponding path program 1 times [2019-10-02 21:15:27,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:27,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:27,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:27,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:15:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:15:27,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:27,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:15:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:15:27,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:15:27,891 INFO L87 Difference]: Start difference. First operand 1019 states and 1739 transitions. Second operand 6 states. [2019-10-02 21:15:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:33,094 INFO L93 Difference]: Finished difference Result 2084 states and 3454 transitions. [2019-10-02 21:15:33,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:15:33,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-10-02 21:15:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:33,118 INFO L225 Difference]: With dead ends: 2084 [2019-10-02 21:15:33,118 INFO L226 Difference]: Without dead ends: 2084 [2019-10-02 21:15:33,119 INFO L640 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-10-02 21:15:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-10-02 21:15:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2061. [2019-10-02 21:15:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-10-02 21:15:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3384 transitions. [2019-10-02 21:15:33,219 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3384 transitions. Word has length 137 [2019-10-02 21:15:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:33,222 INFO L475 AbstractCegarLoop]: Abstraction has 2061 states and 3384 transitions. [2019-10-02 21:15:33,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:15:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3384 transitions. [2019-10-02 21:15:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 21:15:33,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:33,230 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:15:33,230 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -287717798, now seen corresponding path program 1 times [2019-10-02 21:15:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:33,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:15:33,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:33,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:15:33,519 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:33,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:15:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:15:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:15:33,520 INFO L87 Difference]: Start difference. First operand 2061 states and 3384 transitions. Second operand 6 states. [2019-10-02 21:15:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:36,469 INFO L93 Difference]: Finished difference Result 3849 states and 6346 transitions. [2019-10-02 21:15:36,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:15:36,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-10-02 21:15:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:36,496 INFO L225 Difference]: With dead ends: 3849 [2019-10-02 21:15:36,496 INFO L226 Difference]: Without dead ends: 3849 [2019-10-02 21:15:36,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 21:15:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2019-10-02 21:15:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3813. [2019-10-02 21:15:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-10-02 21:15:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6183 transitions. [2019-10-02 21:15:36,611 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 6183 transitions. Word has length 165 [2019-10-02 21:15:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:36,612 INFO L475 AbstractCegarLoop]: Abstraction has 3813 states and 6183 transitions. [2019-10-02 21:15:36,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:15:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 6183 transitions. [2019-10-02 21:15:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 21:15:36,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:36,616 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:15:36,616 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:36,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 319632798, now seen corresponding path program 1 times [2019-10-02 21:15:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:36,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:36,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:15:36,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:36,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:15:36,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:36,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:15:36,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:15:36,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:15:36,836 INFO L87 Difference]: Start difference. First operand 3813 states and 6183 transitions. Second operand 6 states. [2019-10-02 21:15:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:39,470 INFO L93 Difference]: Finished difference Result 5942 states and 8256 transitions. [2019-10-02 21:15:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:15:39,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-02 21:15:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:39,501 INFO L225 Difference]: With dead ends: 5942 [2019-10-02 21:15:39,501 INFO L226 Difference]: Without dead ends: 5942 [2019-10-02 21:15:39,502 INFO L640 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-10-02 21:15:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2019-10-02 21:15:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5896. [2019-10-02 21:15:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5896 states. [2019-10-02 21:15:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 8054 transitions. [2019-10-02 21:15:39,655 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 8054 transitions. Word has length 183 [2019-10-02 21:15:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:39,656 INFO L475 AbstractCegarLoop]: Abstraction has 5896 states and 8054 transitions. [2019-10-02 21:15:39,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:15:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 8054 transitions. [2019-10-02 21:15:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 21:15:39,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:39,660 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 21:15:39,660 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:39,661 INFO L82 PathProgramCache]: Analyzing trace with hash 511639243, now seen corresponding path program 1 times [2019-10-02 21:15:39,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:39,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:39,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:39,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:39,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:15:39,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:39,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:15:39,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:39,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:15:39,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:15:39,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:15:39,874 INFO L87 Difference]: Start difference. First operand 5896 states and 8054 transitions. Second operand 6 states. [2019-10-02 21:15:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:42,572 INFO L93 Difference]: Finished difference Result 8687 states and 11576 transitions. [2019-10-02 21:15:42,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:15:42,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 230 [2019-10-02 21:15:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:42,612 INFO L225 Difference]: With dead ends: 8687 [2019-10-02 21:15:42,612 INFO L226 Difference]: Without dead ends: 8687 [2019-10-02 21:15:42,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 21:15:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8687 states. [2019-10-02 21:15:42,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8687 to 8651. [2019-10-02 21:15:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8651 states. [2019-10-02 21:15:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8651 states to 8651 states and 11412 transitions. [2019-10-02 21:15:42,810 INFO L78 Accepts]: Start accepts. Automaton has 8651 states and 11412 transitions. Word has length 230 [2019-10-02 21:15:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:42,810 INFO L475 AbstractCegarLoop]: Abstraction has 8651 states and 11412 transitions. [2019-10-02 21:15:42,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:15:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8651 states and 11412 transitions. [2019-10-02 21:15:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 21:15:42,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:42,817 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 21:15:42,818 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:42,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash -71690297, now seen corresponding path program 1 times [2019-10-02 21:15:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:42,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:42,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:42,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 21:15:42,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:15:42,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:15:42,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:15:42,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:15:42,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:15:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:15:42,991 INFO L87 Difference]: Start difference. First operand 8651 states and 11412 transitions. Second operand 4 states. [2019-10-02 21:15:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:15:46,370 INFO L93 Difference]: Finished difference Result 14417 states and 17911 transitions. [2019-10-02 21:15:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:15:46,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 266 [2019-10-02 21:15:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:15:46,426 INFO L225 Difference]: With dead ends: 14417 [2019-10-02 21:15:46,426 INFO L226 Difference]: Without dead ends: 14417 [2019-10-02 21:15:46,427 INFO L640 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-10-02 21:15:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14417 states. [2019-10-02 21:15:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14417 to 13741. [2019-10-02 21:15:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13741 states. [2019-10-02 21:15:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13741 states to 13741 states and 17141 transitions. [2019-10-02 21:15:46,827 INFO L78 Accepts]: Start accepts. Automaton has 13741 states and 17141 transitions. Word has length 266 [2019-10-02 21:15:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:15:46,829 INFO L475 AbstractCegarLoop]: Abstraction has 13741 states and 17141 transitions. [2019-10-02 21:15:46,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:15:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 13741 states and 17141 transitions. [2019-10-02 21:15:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-10-02 21:15:46,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:15:46,850 INFO L411 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:15:46,850 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:15:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:15:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1075441394, now seen corresponding path program 1 times [2019-10-02 21:15:46,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:15:46,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:46,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:15:46,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:15:46,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:15:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:15:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-10-02 21:15:47,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:15:47,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:15:47,626 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 490 with the following transitions: [2019-10-02 21:15:47,629 INFO L207 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [623], [625], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [913], [917], [921], [925], [929], [933], [937], [941], [945], [949], [953], [957], [961], [965], [969], [973], [977], [981], [985], [989], [993], [997], [1001], [1005], [1009], [1013], [1017], [1021], [1025], [1029], [1033], [1037], [1041], [1045], [1049], [1053], [1057], [1061], [1065], [1069], [1073], [1077], [1081], [1085], [1089], [1093], [1097], [1101], [1105], [1109], [1113], [1117], [1121], [1125], [1128], [1129], [1133], [1137], [1141], [1145], [1149], [1153], [1157], [1161], [1165], [1169], [1173], [1177], [1181], [1185], [1189], [1193], [1197], [1201], [1205], [1209], [1213], [1217], [1221], [1225], [1229], [1233], [1237], [1241], [1245], [1249], [1253], [1257], [1261], [1265], [1269], [1273], [1277], [1281], [1285], [1289], [1293], [1297], [1301], [1305], [1309], [1313], [1317], [1321], [1325], [1329], [1333], [1337], [1341], [1345], [1349], [1352], [1552], [1556], [1565], [1569], [1571], [1578], [1579], [1580], [1582], [1583] [2019-10-02 21:15:47,715 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:15:47,715 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:16:22,638 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 21:16:39,532 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:16:39,535 INFO L272 AbstractInterpreter]: Visited 247 different actions 734 times. Merged at 6 different actions 13 times. Never widened. Performed 1300 root evaluator evaluations with a maximum evaluation depth of 16. Performed 1300 inverse root evaluator evaluations with a maximum inverse evaluation depth of 16. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 21:16:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:39,539 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:16:51,012 INFO L227 lantSequenceWeakener]: Weakened 486 states. On average, predicates are now at 77.73% of their original sizes. [2019-10-02 21:16:51,013 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:16:51,100 INFO L420 sIntCurrentIteration]: We unified 488 AI predicates to 488 [2019-10-02 21:16:51,101 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:16:51,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:16:51,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-10-02 21:16:51,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:51,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 21:16:51,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 21:16:51,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 21:16:51,103 INFO L87 Difference]: Start difference. First operand 13741 states and 17141 transitions. Second operand 10 states.