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/Problem17_label19.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 21:08:27,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 21:08:27,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 21:08:27,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 21:08:27,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 21:08:27,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 21:08:27,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 21:08:27,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 21:08:27,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 21:08:27,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 21:08:27,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 21:08:27,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 21:08:27,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 21:08:27,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 21:08:27,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 21:08:27,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 21:08:27,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 21:08:27,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 21:08:27,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 21:08:27,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 21:08:27,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 21:08:27,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 21:08:27,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 21:08:27,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 21:08:27,226 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 21:08:27,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 21:08:27,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 21:08:27,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 21:08:27,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 21:08:27,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 21:08:27,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 21:08:27,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 21:08:27,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 21:08:27,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 21:08:27,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 21:08:27,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 21:08:27,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 21:08:27,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 21:08:27,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 21:08:27,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 21:08:27,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 21:08:27,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 21:08:27,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 21:08:27,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 21:08:27,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 21:08:27,257 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 21:08:27,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 21:08:27,258 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 21:08:27,258 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 21:08:27,259 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 21:08:27,259 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 21:08:27,259 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 21:08:27,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 21:08:27,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 21:08:27,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 21:08:27,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 21:08:27,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 21:08:27,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 21:08:27,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 21:08:27,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 21:08:27,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 21:08:27,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 21:08:27,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 21:08:27,262 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 21:08:27,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 21:08:27,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 21:08:27,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 21:08:27,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 21:08:27,263 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 21:08:27,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 21:08:27,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 21:08:27,263 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 21:08:27,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 21:08:27,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 21:08:27,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 21:08:27,329 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 21:08:27,329 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 21:08:27,330 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label19.c [2019-09-09 21:08:27,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbc14e2d/3a4ec37a4a68491e84ed9f8cbbc53b33/FLAGcaf2adc65 [2019-09-09 21:08:28,111 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 21:08:28,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label19.c [2019-09-09 21:08:28,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbc14e2d/3a4ec37a4a68491e84ed9f8cbbc53b33/FLAGcaf2adc65 [2019-09-09 21:08:28,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfbc14e2d/3a4ec37a4a68491e84ed9f8cbbc53b33 [2019-09-09 21:08:28,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 21:08:28,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 21:08:28,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 21:08:28,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 21:08:28,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 21:08:28,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:08:28" (1/1) ... [2019-09-09 21:08:28,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d452d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:28, skipping insertion in model container [2019-09-09 21:08:28,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 09:08:28" (1/1) ... [2019-09-09 21:08:28,263 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 21:08:28,368 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 21:08:29,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:08:29,409 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 21:08:29,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 21:08:29,856 INFO L192 MainTranslator]: Completed translation [2019-09-09 21:08:29,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29 WrapperNode [2019-09-09 21:08:29,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 21:08:29,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 21:08:29,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 21:08:29,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 21:08:29,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:29,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:29,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:29,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:30,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:30,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:30,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... [2019-09-09 21:08:30,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 21:08:30,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 21:08:30,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 21:08:30,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 21:08:30,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 21:08:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 21:08:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 21:08:30,275 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-09 21:08:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-09 21:08:30,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 21:08:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-09 21:08:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-09 21:08:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 21:08:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-09 21:08:30,277 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-09 21:08:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 21:08:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 21:08:30,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 21:08:34,098 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 21:08:34,099 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-09 21:08:34,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:08:34 BoogieIcfgContainer [2019-09-09 21:08:34,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 21:08:34,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 21:08:34,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 21:08:34,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 21:08:34,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 09:08:28" (1/3) ... [2019-09-09 21:08:34,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545bf975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:08:34, skipping insertion in model container [2019-09-09 21:08:34,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 09:08:29" (2/3) ... [2019-09-09 21:08:34,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545bf975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 09:08:34, skipping insertion in model container [2019-09-09 21:08:34,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 09:08:34" (3/3) ... [2019-09-09 21:08:34,120 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label19.c [2019-09-09 21:08:34,134 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 21:08:34,142 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 21:08:34,159 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 21:08:34,181 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 21:08:34,181 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 21:08:34,181 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 21:08:34,181 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 21:08:34,181 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 21:08:34,181 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 21:08:34,182 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 21:08:34,182 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 21:08:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states. [2019-09-09 21:08:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 21:08:34,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:08:34,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 21:08:34,230 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:08:34,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:08:34,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1980938625, now seen corresponding path program 1 times [2019-09-09 21:08:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:08:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:34,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:08:34,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:34,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:08:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:08:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:08:34,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:08:34,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 21:08:34,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:08:34,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 21:08:34,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 21:08:34,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-09 21:08:34,628 INFO L87 Difference]: Start difference. First operand 603 states. Second operand 4 states. [2019-09-09 21:08:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:08:42,868 INFO L93 Difference]: Finished difference Result 1563 states and 2716 transitions. [2019-09-09 21:08:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 21:08:42,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-09 21:08:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:08:42,913 INFO L225 Difference]: With dead ends: 1563 [2019-09-09 21:08:42,913 INFO L226 Difference]: Without dead ends: 1476 [2019-09-09 21:08:42,917 INFO L628 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-09-09 21:08:42,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-09-09 21:08:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 989. [2019-09-09 21:08:43,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-09-09 21:08:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1713 transitions. [2019-09-09 21:08:43,090 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1713 transitions. Word has length 48 [2019-09-09 21:08:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:08:43,091 INFO L475 AbstractCegarLoop]: Abstraction has 989 states and 1713 transitions. [2019-09-09 21:08:43,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 21:08:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1713 transitions. [2019-09-09 21:08:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-09 21:08:43,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:08:43,106 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 21:08:43,106 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:08:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:08:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 778961964, now seen corresponding path program 1 times [2019-09-09 21:08:43,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:08:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:43,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:08:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:43,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:08:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:08:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:08:43,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:08:43,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 21:08:43,349 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:08:43,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 21:08:43,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 21:08:43,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 21:08:43,358 INFO L87 Difference]: Start difference. First operand 989 states and 1713 transitions. Second operand 5 states. [2019-09-09 21:08:47,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:08:48,000 INFO L93 Difference]: Finished difference Result 1917 states and 3010 transitions. [2019-09-09 21:08:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 21:08:48,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-09-09 21:08:48,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:08:48,018 INFO L225 Difference]: With dead ends: 1917 [2019-09-09 21:08:48,019 INFO L226 Difference]: Without dead ends: 1917 [2019-09-09 21:08:48,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 21:08:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-09 21:08:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1893. [2019-09-09 21:08:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-09-09 21:08:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2962 transitions. [2019-09-09 21:08:48,097 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2962 transitions. Word has length 119 [2019-09-09 21:08:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:08:48,100 INFO L475 AbstractCegarLoop]: Abstraction has 1893 states and 2962 transitions. [2019-09-09 21:08:48,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 21:08:48,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2962 transitions. [2019-09-09 21:08:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-09 21:08:48,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:08:48,106 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-09 21:08:48,107 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:08:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:08:48,108 INFO L82 PathProgramCache]: Analyzing trace with hash 690572408, now seen corresponding path program 1 times [2019-09-09 21:08:48,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:08:48,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:48,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:08:48,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:48,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:08:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:08:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:08:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:08:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 21:08:48,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:08:48,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 21:08:48,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 21:08:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:08:48,326 INFO L87 Difference]: Start difference. First operand 1893 states and 2962 transitions. Second operand 3 states. [2019-09-09 21:08:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:08:53,620 INFO L93 Difference]: Finished difference Result 3665 states and 5193 transitions. [2019-09-09 21:08:53,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 21:08:53,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-09 21:08:53,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:08:53,645 INFO L225 Difference]: With dead ends: 3665 [2019-09-09 21:08:53,645 INFO L226 Difference]: Without dead ends: 3665 [2019-09-09 21:08:53,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:08:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2019-09-09 21:08:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3663. [2019-09-09 21:08:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3663 states. [2019-09-09 21:08:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 5189 transitions. [2019-09-09 21:08:53,739 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 5189 transitions. Word has length 122 [2019-09-09 21:08:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:08:53,740 INFO L475 AbstractCegarLoop]: Abstraction has 3663 states and 5189 transitions. [2019-09-09 21:08:53,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 21:08:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 5189 transitions. [2019-09-09 21:08:53,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-09 21:08:53,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:08:53,743 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-09-09 21:08:53,743 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:08:53,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:08:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash -329097648, now seen corresponding path program 1 times [2019-09-09 21:08:53,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:08:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:53,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:08:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:08:53,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:08:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:08:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:08:53,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:08:53,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-09 21:08:53,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:08:53,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 21:08:53,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 21:08:53,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-09 21:08:53,904 INFO L87 Difference]: Start difference. First operand 3663 states and 5189 transitions. Second operand 7 states. [2019-09-09 21:09:04,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:09:04,466 INFO L93 Difference]: Finished difference Result 8954 states and 13537 transitions. [2019-09-09 21:09:04,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 21:09:04,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-09-09 21:09:04,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:09:04,527 INFO L225 Difference]: With dead ends: 8954 [2019-09-09 21:09:04,527 INFO L226 Difference]: Without dead ends: 8954 [2019-09-09 21:09:04,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-09 21:09:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8954 states. [2019-09-09 21:09:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8954 to 8856. [2019-09-09 21:09:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8856 states. [2019-09-09 21:09:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8856 states to 8856 states and 12669 transitions. [2019-09-09 21:09:04,842 INFO L78 Accepts]: Start accepts. Automaton has 8856 states and 12669 transitions. Word has length 149 [2019-09-09 21:09:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:09:04,844 INFO L475 AbstractCegarLoop]: Abstraction has 8856 states and 12669 transitions. [2019-09-09 21:09:04,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 21:09:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 8856 states and 12669 transitions. [2019-09-09 21:09:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-09 21:09:04,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:09:04,851 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-09 21:09:04,851 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:09:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:09:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1987336143, now seen corresponding path program 1 times [2019-09-09 21:09:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:09:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:09:04,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:04,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:09:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:09:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 21:09:05,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:09:05,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 21:09:05,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:09:05,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 21:09:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 21:09:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 21:09:05,041 INFO L87 Difference]: Start difference. First operand 8856 states and 12669 transitions. Second operand 5 states. [2019-09-09 21:09:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:09:12,581 INFO L93 Difference]: Finished difference Result 15689 states and 22242 transitions. [2019-09-09 21:09:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 21:09:12,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-09-09 21:09:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:09:12,672 INFO L225 Difference]: With dead ends: 15689 [2019-09-09 21:09:12,673 INFO L226 Difference]: Without dead ends: 15689 [2019-09-09 21:09:12,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-09 21:09:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15689 states. [2019-09-09 21:09:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15689 to 15479. [2019-09-09 21:09:13,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15479 states. [2019-09-09 21:09:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15479 states to 15479 states and 21455 transitions. [2019-09-09 21:09:13,107 INFO L78 Accepts]: Start accepts. Automaton has 15479 states and 21455 transitions. Word has length 161 [2019-09-09 21:09:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:09:13,108 INFO L475 AbstractCegarLoop]: Abstraction has 15479 states and 21455 transitions. [2019-09-09 21:09:13,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 21:09:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15479 states and 21455 transitions. [2019-09-09 21:09:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-09 21:09:13,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:09:13,116 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 21:09:13,116 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:09:13,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:09:13,117 INFO L82 PathProgramCache]: Analyzing trace with hash 381994420, now seen corresponding path program 1 times [2019-09-09 21:09:13,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:09:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:13,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:09:13,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:13,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:09:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:09:13,896 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-09 21:09:13,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 21:09:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 21:09:13,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:09:13,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 21:09:13,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 21:09:13,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:09:13,898 INFO L87 Difference]: Start difference. First operand 15479 states and 21455 transitions. Second operand 3 states. [2019-09-09 21:09:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 21:09:17,079 INFO L93 Difference]: Finished difference Result 22608 states and 30379 transitions. [2019-09-09 21:09:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 21:09:17,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-09-09 21:09:17,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 21:09:17,181 INFO L225 Difference]: With dead ends: 22608 [2019-09-09 21:09:17,182 INFO L226 Difference]: Without dead ends: 22608 [2019-09-09 21:09:17,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 21:09:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22608 states. [2019-09-09 21:09:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22608 to 22596. [2019-09-09 21:09:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22596 states. [2019-09-09 21:09:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22596 states to 22596 states and 30349 transitions. [2019-09-09 21:09:17,737 INFO L78 Accepts]: Start accepts. Automaton has 22596 states and 30349 transitions. Word has length 228 [2019-09-09 21:09:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 21:09:17,737 INFO L475 AbstractCegarLoop]: Abstraction has 22596 states and 30349 transitions. [2019-09-09 21:09:17,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 21:09:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 22596 states and 30349 transitions. [2019-09-09 21:09:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-09 21:09:17,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 21:09:17,747 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 21:09:17,748 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 21:09:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:09:17,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1178675686, now seen corresponding path program 1 times [2019-09-09 21:09:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 21:09:17,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:17,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 21:09:17,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 21:09:17,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 21:09:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 21:09:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 83 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-09 21:09:17,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 21:09:17,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 21:09:17,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2019-09-09 21:09:17,986 INFO L207 CegarAbsIntRunner]: [0], [1], [711], [718], [726], [734], [742], [750], [758], [766], [774], [782], [790], [798], [806], [814], [822], [830], [838], [846], [854], [862], [870], [878], [886], [894], [902], [910], [918], [926], [934], [942], [950], [958], [966], [974], [982], [990], [998], [1002], [1004], [1007], [1015], [1023], [1031], [1039], [1047], [1055], [1063], [1071], [1079], [1087], [1095], [1103], [1111], [1119], [1127], [1135], [1143], [1151], [1159], [1167], [1175], [1183], [1191], [1199], [1204], [1208], [1212], [1216], [1220], [1223], [1224], [1228], [1232], [1236], [1240], [1244], [1255], [1259], [1263], [1267], [1271], [1275], [1279], [1283], [1287], [1291], [1295], [1299], [1303], [1307], [1318], [1322], [1326], [1330], [1334], [1345], [1349], [1353], [1357], [1361], [1365], [1369], [1373], [1377], [1381], [1385], [1389], [1393], [1397], [1400], [2279], [2283], [2292], [2296], [2298], [2305], [2306], [2307], [2309], [2310] [2019-09-09 21:09:18,044 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 21:09:18,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 21:09:22,078 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 21:09:31,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-09 21:09:31,172 INFO L272 AbstractInterpreter]: Visited 121 different actions 237 times. Merged at 4 different actions 5 times. Never widened. Performed 467 root evaluator evaluations with a maximum evaluation depth of 15. Performed 467 inverse root evaluator evaluations with a maximum inverse evaluation depth of 15. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2019-09-09 21:09:31,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 21:09:31,177 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-09 21:09:36,182 INFO L227 lantSequenceWeakener]: Weakened 232 states. On average, predicates are now at 75.48% of their original sizes. [2019-09-09 21:09:36,183 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-09 21:09:36,297 INFO L420 sIntCurrentIteration]: We unified 234 AI predicates to 234 [2019-09-09 21:09:36,297 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-09 21:09:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 21:09:36,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2019-09-09 21:09:36,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 21:09:36,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-09 21:09:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-09 21:09:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-09 21:09:36,300 INFO L87 Difference]: Start difference. First operand 22596 states and 30349 transitions. Second operand 12 states.