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_label37.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:41:13,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:41:13,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:41:13,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:41:13,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:41:13,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:41:13,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:41:13,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:41:13,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:41:13,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:41:13,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:41:13,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:41:13,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:41:13,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:41:13,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:41:13,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:41:13,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:41:13,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:41:13,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:41:13,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:41:13,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:41:13,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:41:13,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:41:13,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:41:13,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:41:13,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:41:13,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:41:13,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:41:13,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:41:13,105 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:41:13,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:41:13,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:41:13,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:41:13,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:41:13,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:41:13,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:41:13,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:41:13,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:41:13,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:41:13,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:41:13,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:41:13,112 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 20:41:13,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:41:13,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:41:13,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:41:13,128 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:41:13,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:41:13,129 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:41:13,129 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:41:13,130 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:41:13,130 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:41:13,130 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:41:13,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:41:13,131 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:41:13,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:41:13,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:41:13,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:41:13,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:41:13,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:41:13,132 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:41:13,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:41:13,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:41:13,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:41:13,133 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:41:13,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:41:13,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:41:13,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:41:13,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:41:13,134 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:41:13,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:41:13,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:41:13,134 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:41:13,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:41:13,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:41:13,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:41:13,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:41:13,198 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:41:13,199 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label37.c [2019-10-02 20:41:13,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a9e07f1/48b14c41fce147c7b5233c1f940d0749/FLAGbce033c72 [2019-10-02 20:41:13,832 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:41:13,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label37.c [2019-10-02 20:41:13,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a9e07f1/48b14c41fce147c7b5233c1f940d0749/FLAGbce033c72 [2019-10-02 20:41:14,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a9e07f1/48b14c41fce147c7b5233c1f940d0749 [2019-10-02 20:41:14,098 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:41:14,099 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:41:14,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:41:14,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:41:14,104 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:41:14,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:41:14" (1/1) ... [2019-10-02 20:41:14,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d997ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:14, skipping insertion in model container [2019-10-02 20:41:14,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:41:14" (1/1) ... [2019-10-02 20:41:14,116 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:41:14,184 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:41:14,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:41:14,895 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:41:15,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:41:15,057 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:41:15,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15 WrapperNode [2019-10-02 20:41:15,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:41:15,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:41:15,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:41:15,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:41:15,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (1/1) ... [2019-10-02 20:41:15,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:41:15,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:41:15,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:41:15,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:41:15,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (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 20:41:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:41:15,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:41:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:41:15,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:41:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:41:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:41:15,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:41:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:41:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:41:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:41:15,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:41:16,735 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:41:16,735 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:41:16,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:41:16 BoogieIcfgContainer [2019-10-02 20:41:16,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:41:16,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:41:16,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:41:16,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:41:16,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:41:14" (1/3) ... [2019-10-02 20:41:16,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704e52b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:41:16, skipping insertion in model container [2019-10-02 20:41:16,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:41:15" (2/3) ... [2019-10-02 20:41:16,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704e52b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:41:16, skipping insertion in model container [2019-10-02 20:41:16,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:41:16" (3/3) ... [2019-10-02 20:41:16,747 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label37.c [2019-10-02 20:41:16,758 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:41:16,770 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:41:16,788 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:41:16,823 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:41:16,825 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:41:16,825 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:41:16,825 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:41:16,825 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:41:16,826 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:41:16,826 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:41:16,826 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:41:16,869 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:41:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-02 20:41:16,881 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:16,882 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] [2019-10-02 20:41:16,886 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash -803708109, now seen corresponding path program 1 times [2019-10-02 20:41:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:16,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:16,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:16,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:17,281 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 20:41:17,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:41:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:41:17,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:41:17,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:41:17,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:41:17,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:41:17,313 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:41:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:18,805 INFO L93 Difference]: Finished difference Result 440 states and 711 transitions. [2019-10-02 20:41:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:41:18,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-02 20:41:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:18,825 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:41:18,825 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:41:18,827 INFO L640 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-10-02 20:41:18,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:41:18,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:41:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:41:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-02 20:41:18,972 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 24 [2019-10-02 20:41:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:18,974 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-02 20:41:18,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:41:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-02 20:41:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 20:41:18,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:18,985 INFO L411 BasicCegarLoop]: trace histogram [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 20:41:18,986 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1307539406, now seen corresponding path program 1 times [2019-10-02 20:41:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:18,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:18,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:18,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:19,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:41:19,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:41:19,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:41:19,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:41:19,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:41:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:41:19,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:41:19,200 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-02 20:41:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:20,638 INFO L93 Difference]: Finished difference Result 570 states and 828 transitions. [2019-10-02 20:41:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:41:20,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-10-02 20:41:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:20,650 INFO L225 Difference]: With dead ends: 570 [2019-10-02 20:41:20,650 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 20:41:20,651 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 20:41:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 20:41:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-10-02 20:41:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 20:41:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-10-02 20:41:20,702 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 98 [2019-10-02 20:41:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:20,703 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-10-02 20:41:20,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:41:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-10-02 20:41:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-02 20:41:20,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:20,712 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:41:20,712 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1750148479, now seen corresponding path program 1 times [2019-10-02 20:41:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:20,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:20,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:20,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:41:20,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:41:20,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 20:41:20,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:41:20,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 20:41:20,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 20:41:20,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:41:20,852 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-10-02 20:41:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:22,438 INFO L93 Difference]: Finished difference Result 1662 states and 2283 transitions. [2019-10-02 20:41:22,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 20:41:22,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-02 20:41:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:22,461 INFO L225 Difference]: With dead ends: 1662 [2019-10-02 20:41:22,461 INFO L226 Difference]: Without dead ends: 1662 [2019-10-02 20:41:22,462 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 20:41:22,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2019-10-02 20:41:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2019-10-02 20:41:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-10-02 20:41:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2283 transitions. [2019-10-02 20:41:22,547 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2283 transitions. Word has length 107 [2019-10-02 20:41:22,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:22,548 INFO L475 AbstractCegarLoop]: Abstraction has 1662 states and 2283 transitions. [2019-10-02 20:41:22,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 20:41:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2283 transitions. [2019-10-02 20:41:22,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 20:41:22,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:22,553 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:22,553 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1682277713, now seen corresponding path program 1 times [2019-10-02 20:41:22,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:22,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:22,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:22,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 20:41:22,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:41:22,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 20:41:22,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:41:22,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 20:41:22,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 20:41:22,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:41:22,752 INFO L87 Difference]: Start difference. First operand 1662 states and 2283 transitions. Second operand 4 states. [2019-10-02 20:41:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:24,294 INFO L93 Difference]: Finished difference Result 3678 states and 4968 transitions. [2019-10-02 20:41:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 20:41:24,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-10-02 20:41:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:24,323 INFO L225 Difference]: With dead ends: 3678 [2019-10-02 20:41:24,323 INFO L226 Difference]: Without dead ends: 3678 [2019-10-02 20:41:24,324 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 20:41:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-10-02 20:41:24,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3678. [2019-10-02 20:41:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-10-02 20:41:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4968 transitions. [2019-10-02 20:41:24,473 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4968 transitions. Word has length 216 [2019-10-02 20:41:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:24,474 INFO L475 AbstractCegarLoop]: Abstraction has 3678 states and 4968 transitions. [2019-10-02 20:41:24,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 20:41:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4968 transitions. [2019-10-02 20:41:24,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 20:41:24,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:24,482 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:41:24,483 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:24,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:24,483 INFO L82 PathProgramCache]: Analyzing trace with hash 710456757, now seen corresponding path program 1 times [2019-10-02 20:41:24,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:24,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:24,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:24,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 144 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:41:25,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:41:25,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:41:25,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2019-10-02 20:41:25,854 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [101], [103], [106], [114], [122], [130], [138], [146], [154], [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], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [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], [786], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:41:25,912 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:41:25,912 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:41:42,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:41:42,554 INFO L272 AbstractInterpreter]: Visited 147 different actions 147 times. Never merged. Never widened. Performed 333 root evaluator evaluations with a maximum evaluation depth of 14. Performed 333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:41:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:42,559 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:42:00,856 INFO L227 lantSequenceWeakener]: Weakened 259 states. On average, predicates are now at 77.49% of their original sizes. [2019-10-02 20:42:00,856 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:42:00,935 INFO L420 sIntCurrentIteration]: We unified 277 AI predicates to 277 [2019-10-02 20:42:00,935 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:42:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:42:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2019-10-02 20:42:00,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:42:00,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:42:00,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:42:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:42:00,938 INFO L87 Difference]: Start difference. First operand 3678 states and 4968 transitions. Second operand 11 states. [2019-10-02 20:43:38,239 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:46:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:46:02,503 INFO L93 Difference]: Finished difference Result 3864 states and 5165 transitions. [2019-10-02 20:46:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 20:46:02,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2019-10-02 20:46:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:46:02,530 INFO L225 Difference]: With dead ends: 3864 [2019-10-02 20:46:02,530 INFO L226 Difference]: Without dead ends: 3864 [2019-10-02 20:46:02,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 268 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-10-02 20:46:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3864 states. [2019-10-02 20:46:02,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3864 to 3860. [2019-10-02 20:46:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2019-10-02 20:46:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 5158 transitions. [2019-10-02 20:46:02,643 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 5158 transitions. Word has length 278 [2019-10-02 20:46:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:46:02,644 INFO L475 AbstractCegarLoop]: Abstraction has 3860 states and 5158 transitions. [2019-10-02 20:46:02,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:46:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 5158 transitions. [2019-10-02 20:46:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-02 20:46:02,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:46:02,655 INFO L411 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 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] [2019-10-02 20:46:02,655 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:46:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -987748772, now seen corresponding path program 1 times [2019-10-02 20:46:02,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:46:02,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:02,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:46:02,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:46:02,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:46:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:46:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 137 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:46:03,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:46:03,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:46:03,413 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 363 with the following transitions: [2019-10-02 20:46:03,414 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [101], [103], [106], [114], [122], [130], [138], [146], [154], [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], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [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], [786], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:46:03,421 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:46:03,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:46:25,643 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:46:25,645 INFO L272 AbstractInterpreter]: Visited 151 different actions 297 times. Merged at 4 different actions 5 times. Never widened. Performed 575 root evaluator evaluations with a maximum evaluation depth of 14. Performed 575 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:46:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:46:25,645 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:46:33,916 INFO L227 lantSequenceWeakener]: Weakened 359 states. On average, predicates are now at 77.36% of their original sizes. [2019-10-02 20:46:33,916 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:46:33,991 INFO L420 sIntCurrentIteration]: We unified 361 AI predicates to 361 [2019-10-02 20:46:33,991 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:46:33,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:46:33,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:46:33,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:46:33,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:46:33,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:46:33,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:46:33,998 INFO L87 Difference]: Start difference. First operand 3860 states and 5158 transitions. Second operand 11 states. [2019-10-02 20:47:15,292 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:50:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:50:24,705 INFO L93 Difference]: Finished difference Result 4076 states and 5384 transitions. [2019-10-02 20:50:24,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:50:24,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 362 [2019-10-02 20:50:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:50:24,728 INFO L225 Difference]: With dead ends: 4076 [2019-10-02 20:50:24,728 INFO L226 Difference]: Without dead ends: 4076 [2019-10-02 20:50:24,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 352 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-10-02 20:50:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2019-10-02 20:50:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3860. [2019-10-02 20:50:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3860 states. [2019-10-02 20:50:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 5157 transitions. [2019-10-02 20:50:24,841 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 5157 transitions. Word has length 362 [2019-10-02 20:50:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:50:24,841 INFO L475 AbstractCegarLoop]: Abstraction has 3860 states and 5157 transitions. [2019-10-02 20:50:24,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:50:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 5157 transitions. [2019-10-02 20:50:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-10-02 20:50:24,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:50:24,852 INFO L411 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 20:50:24,852 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:50:24,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:50:24,853 INFO L82 PathProgramCache]: Analyzing trace with hash 683671176, now seen corresponding path program 1 times [2019-10-02 20:50:24,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:50:24,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:50:24,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:50:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:50:24,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:50:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:50:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 108 proven. 222 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 20:50:25,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:50:25,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:50:25,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 389 with the following transitions: [2019-10-02 20:50:25,421 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [101], [103], [106], [114], [122], [130], [138], [146], [154], [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], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [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], [786], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:50:25,425 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:50:25,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:50:53,671 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:50:53,671 INFO L272 AbstractInterpreter]: Visited 151 different actions 297 times. Merged at 4 different actions 5 times. Never widened. Performed 685 root evaluator evaluations with a maximum evaluation depth of 14. Performed 685 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:50:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:50:53,672 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:51:13,723 INFO L227 lantSequenceWeakener]: Weakened 385 states. On average, predicates are now at 77.36% of their original sizes. [2019-10-02 20:51:13,724 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:51:13,826 INFO L420 sIntCurrentIteration]: We unified 387 AI predicates to 387 [2019-10-02 20:51:13,826 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:51:13,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:51:13,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2019-10-02 20:51:13,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:51:13,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 20:51:13,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 20:51:13,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 20:51:13,828 INFO L87 Difference]: Start difference. First operand 3860 states and 5157 transitions. Second operand 12 states. [2019-10-02 20:51:59,860 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:53:41,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:53:41,726 INFO L93 Difference]: Finished difference Result 4228 states and 5539 transitions. [2019-10-02 20:53:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 20:53:41,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2019-10-02 20:53:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:53:41,745 INFO L225 Difference]: With dead ends: 4228 [2019-10-02 20:53:41,745 INFO L226 Difference]: Without dead ends: 4228 [2019-10-02 20:53:41,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2019-10-02 20:53:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4228 states. [2019-10-02 20:53:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4228 to 4226. [2019-10-02 20:53:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4226 states. [2019-10-02 20:53:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 5537 transitions. [2019-10-02 20:53:41,840 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 5537 transitions. Word has length 388 [2019-10-02 20:53:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:53:41,840 INFO L475 AbstractCegarLoop]: Abstraction has 4226 states and 5537 transitions. [2019-10-02 20:53:41,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 20:53:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 5537 transitions. [2019-10-02 20:53:41,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-10-02 20:53:41,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:53:41,854 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:53:41,854 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:53:41,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:53:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1784960273, now seen corresponding path program 1 times [2019-10-02 20:53:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:53:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:53:41,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:53:41,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:53:41,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:53:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:53:42,245 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 158 proven. 218 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-10-02 20:53:42,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:53:42,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:53:42,246 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 473 with the following transitions: [2019-10-02 20:53:42,246 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [101], [103], [106], [114], [122], [130], [138], [146], [154], [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], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [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], [786], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:53:42,258 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:53:42,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:54:23,018 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:54:23,018 INFO L272 AbstractInterpreter]: Visited 152 different actions 600 times. Merged at 6 different actions 22 times. Never widened. Performed 1009 root evaluator evaluations with a maximum evaluation depth of 14. Performed 1009 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:54:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:54:23,019 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:54:32,566 INFO L227 lantSequenceWeakener]: Weakened 469 states. On average, predicates are now at 77.36% of their original sizes. [2019-10-02 20:54:32,566 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:54:32,625 INFO L420 sIntCurrentIteration]: We unified 471 AI predicates to 471 [2019-10-02 20:54:32,625 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:54:32,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:54:32,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:54:32,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:54:32,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:54:32,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:54:32,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:54:32,627 INFO L87 Difference]: Start difference. First operand 4226 states and 5537 transitions. Second operand 10 states. [2019-10-02 20:55:08,811 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.